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.r179-tall-171640601100249.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 greatspnxred
Input is FunctionPointer-PT-b032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:04 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-b032-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716432530127

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:48:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:48:51] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-23 02:48:51] [INFO ] Transformed 306 places.
[2024-05-23 02:48:51] [INFO ] Transformed 840 transitions.
[2024-05-23 02:48:51] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
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-b032-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 199 transition count 558
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 199 transition count 558
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 199 transition count 526
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 192 transition count 512
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 192 transition count 512
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 189 transition count 506
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 189 transition count 506
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 187 transition count 498
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 187 transition count 498
Applied a total of 94 rules in 69 ms. Remains 187 /222 variables (removed 35) and now considering 498/648 (removed 150) transitions.
[2024-05-23 02:48:51] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
// Phase 1: matrix 330 rows 187 cols
[2024-05-23 02:48:51] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 02:48:51] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-23 02:48:51] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
[2024-05-23 02:48:51] [INFO ] Invariant cache hit.
[2024-05-23 02:48:52] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-23 02:48:52] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-23 02:48:52] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
[2024-05-23 02:48:52] [INFO ] Invariant cache hit.
[2024-05-23 02:48:52] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 330/515 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 62/249 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 2/517 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 251 constraints, problems are : Problem set: 0 solved, 496 unsolved in 25355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 330/515 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 62/249 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 32/281 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (OVERLAPS) 2/517 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 464/747 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 10 (OVERLAPS) 0/517 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 747 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 56128ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 56145ms
Starting structural reductions in LTL mode, iteration 1 : 187/222 places, 498/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56780 ms. Remains : 187/222 places, 498/648 transitions.
Support contains 66 out of 187 places after structural reductions.
[2024-05-23 02:49:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:49:48] [INFO ] Flatten gal took : 62 ms
FORMULA FunctionPointer-PT-b032-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:49:48] [INFO ] Flatten gal took : 30 ms
[2024-05-23 02:49:48] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 54 out of 187 places (down from 66) after GAL structural reductions.
RANDOM walk for 40064 steps (28 resets) in 1572 ms. (25 steps per ms) remains 21/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 50 ms. (78 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
[2024-05-23 02:49:49] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
[2024-05-23 02:49:49] [INFO ] Invariant cache hit.
[2024-05-23 02:49:49] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 44/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 205/300 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 8 (OVERLAPS) 173/473 variables, 60/187 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 25/212 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/212 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 43/516 variables, 31/243 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 7/250 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 0/250 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 1/517 variables, 1/251 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/517 variables, 0/251 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/517 variables, 0/251 constraints. Problems are: Problem set: 4 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 251 constraints, problems are : Problem set: 4 solved, 17 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 44/66 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 26/92 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 197/289 variables, 92/94 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 30/124 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/124 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 178/467 variables, 58/182 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 25/207 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 17/224 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 49/516 variables, 36/260 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 7/267 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/267 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 1/517 variables, 1/268 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/517 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 268 constraints, problems are : Problem set: 4 solved, 17 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 17/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 2465ms problems are : Problem set: 4 solved, 17 unsolved
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 10 properties in 25292 ms.
Support contains 9 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 498/498 transitions.
Graph (complete) has 755 edges and 187 vertex of which 161 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 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 450
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 146 transition count 392
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 146 transition count 392
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 93 place count 146 transition count 378
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 103 place count 136 transition count 358
Iterating global reduction 2 with 10 rules applied. Total rules applied 113 place count 136 transition count 358
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 136 transition count 354
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 132 transition count 344
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 132 transition count 344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 128 transition count 328
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 128 transition count 328
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 124 transition count 320
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 124 transition count 320
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 120 transition count 306
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 120 transition count 306
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 117 transition count 296
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 117 transition count 296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 114 transition count 290
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 114 transition count 290
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 111 transition count 284
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 111 transition count 284
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 169 place count 109 transition count 280
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 109 transition count 280
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 107 transition count 276
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 107 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 105 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 105 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 189 place count 105 transition count 262
Applied a total of 189 rules in 89 ms. Remains 105 /187 variables (removed 82) and now considering 262/498 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 105/187 places, 262/498 transitions.
RANDOM walk for 40006 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 439838 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 7
Probabilistic random walk after 439838 steps, saw 276362 distinct states, run finished after 3004 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-23 02:50:20] [INFO ] Flow matrix only has 167 transitions (discarded 95 similar events)
// Phase 1: matrix 167 rows 105 cols
[2024-05-23 02:50:20] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 02:50:20] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 100/155 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 74/229 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 22/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 11/240 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 28/268 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 4/272 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 135 constraints, problems are : Problem set: 0 solved, 7 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 100/155 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 74/229 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 22/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 11/240 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 28/268 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 4/272 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/272 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 142 constraints, problems are : Problem set: 0 solved, 7 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4347 ms.
Support contains 8 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 262/262 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 252
Applied a total of 10 rules in 22 ms. Remains 100 /105 variables (removed 5) and now considering 252/262 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 100/105 places, 252/262 transitions.
RANDOM walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 366953 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 6
Probabilistic random walk after 366953 steps, saw 228414 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-23 02:50:28] [INFO ] Flow matrix only has 160 transitions (discarded 92 similar events)
// Phase 1: matrix 160 rows 100 cols
[2024-05-23 02:50:28] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:50:28] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 97/151 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/217 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 12/229 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 28/257 variables, 24/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/260 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 129 constraints, problems are : Problem set: 0 solved, 6 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 100/100 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 97/151 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/217 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 28/257 variables, 24/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/260 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/260 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 135 constraints, problems are : Problem set: 0 solved, 6 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 100/100 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 3467 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 252/252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 98 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 98 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 97 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 97 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 96 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 96 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 95 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 95 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 94 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 94 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 93 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 93 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 92 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 92 transition count 234
Applied a total of 16 rules in 22 ms. Remains 92 /100 variables (removed 8) and now considering 234/252 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 92/100 places, 234/252 transitions.
RANDOM walk for 40011 steps (8 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 352320 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 5
Probabilistic random walk after 352320 steps, saw 219320 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-23 02:50:36] [INFO ] Flow matrix only has 147 transitions (discarded 87 similar events)
// Phase 1: matrix 147 rows 92 cols
[2024-05-23 02:50:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:50:36] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 95/148 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 56/204 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10/214 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 23/237 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/239 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/239 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 118 constraints, problems are : Problem set: 0 solved, 5 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 46/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 95/148 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 56/204 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/214 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 23/237 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/239 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 123 constraints, problems are : Problem set: 0 solved, 5 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4181 ms.
Support contains 7 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 92/92 places, 234/234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 234/234 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-23 02:50:40] [INFO ] Flow matrix only has 147 transitions (discarded 87 similar events)
[2024-05-23 02:50:40] [INFO ] Invariant cache hit.
[2024-05-23 02:50:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:50:40] [INFO ] Flow matrix only has 147 transitions (discarded 87 similar events)
[2024-05-23 02:50:40] [INFO ] Invariant cache hit.
[2024-05-23 02:50:40] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-23 02:50:40] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-23 02:50:40] [INFO ] Redundant transitions in 8 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 02:50:40] [INFO ] Flow matrix only has 147 transitions (discarded 87 similar events)
[2024-05-23 02:50:40] [INFO ] Invariant cache hit.
[2024-05-23 02:50:40] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 147/239 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 0/239 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 118 constraints, problems are : Problem set: 0 solved, 232 unsolved in 3909 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 23/23 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/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 147/239 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 23/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 232/350 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 350 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6514 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 10594ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 10597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10803 ms. Remains : 92/92 places, 234/234 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 92 transition count 144
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 89 transition count 144
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 93 place count 89 transition count 125
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 131 place count 70 transition count 125
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 161 place count 55 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 49 transition count 98
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 49 transition count 98
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 43 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 43 transition count 86
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 38 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 38 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 199 place count 38 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 35 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 212 place count 35 transition count 68
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 35 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 34 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 34 transition count 66
Applied a total of 215 rules in 42 ms. Remains 34 /92 variables (removed 58) and now considering 66/234 (removed 168) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-23 02:50:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:50:51] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:50:51] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 02:50:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:51] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 02:50:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:50:51] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-23 02:50:51] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-23 02:50:51] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 212 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA FunctionPointer-PT-b032-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 21 ms
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 23 ms
[2024-05-23 02:50:51] [INFO ] Input system was already deterministic with 498 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 1011 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Graph (complete) has 1011 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 167 transition count 432
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 53 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 156 transition count 392
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 149 transition count 366
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 142 transition count 342
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 114 place count 135 transition count 326
Iterating global reduction 2 with 7 rules applied. Total rules applied 121 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 128 transition count 304
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 128 transition count 304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 122 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 122 transition count 288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 116 transition count 276
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 116 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 111 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 111 transition count 266
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 172 place count 108 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 105 transition count 254
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 103 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 103 transition count 250
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 189 place count 103 transition count 246
Applied a total of 189 rules in 66 ms. Remains 103 /187 variables (removed 84) and now considering 246/498 (removed 252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 103/187 places, 246/498 transitions.
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:50:51] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 142 transition count 342
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 135 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 128 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 143 place count 121 transition count 284
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 114 transition count 270
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 108 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 104 transition count 250
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 100 transition count 242
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 97 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 97 transition count 236
Applied a total of 198 rules in 28 ms. Remains 97 /187 variables (removed 90) and now considering 236/498 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 97/187 places, 236/498 transitions.
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:50:51] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 169 transition count 434
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 169 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 51 place count 169 transition count 418
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 61 place count 159 transition count 396
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 159 transition count 396
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 159 transition count 392
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 154 transition count 374
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 154 transition count 374
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 149 transition count 358
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 149 transition count 358
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 144 transition count 346
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 144 transition count 346
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 140 transition count 334
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 140 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 136 transition count 324
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 136 transition count 324
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 132 transition count 316
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 132 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 128 transition count 308
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 128 transition count 308
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 126 transition count 304
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 126 transition count 304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 124 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 124 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 123 transition count 298
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 123 transition count 298
Applied a total of 147 rules in 30 ms. Remains 123 /187 variables (removed 64) and now considering 298/498 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 123/187 places, 298/498 transitions.
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:50:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:50:51] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 142 transition count 342
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 135 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 128 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 143 place count 121 transition count 284
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 114 transition count 270
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 108 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 104 transition count 250
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 100 transition count 242
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 97 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 97 transition count 236
Applied a total of 198 rules in 26 ms. Remains 97 /187 variables (removed 90) and now considering 236/498 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 97/187 places, 236/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 168 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 52 place count 168 transition count 418
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 158 transition count 398
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 158 transition count 398
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 158 transition count 394
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 152 transition count 376
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 152 transition count 376
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 146 transition count 354
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 146 transition count 354
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 140 transition count 340
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 118 place count 134 transition count 320
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 134 transition count 320
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 128 transition count 302
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 128 transition count 302
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 142 place count 122 transition count 290
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 122 transition count 290
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 154 place count 116 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 164 place count 112 transition count 270
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 112 transition count 270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 108 transition count 262
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 108 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 179 place count 105 transition count 256
Iterating global reduction 3 with 3 rules applied. Total rules applied 182 place count 105 transition count 256
Applied a total of 182 rules in 26 ms. Remains 105 /187 variables (removed 82) and now considering 256/498 (removed 242) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 105/187 places, 256/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Graph (complete) has 1011 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 171 transition count 438
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 171 transition count 438
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 45 place count 171 transition count 424
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 162 transition count 404
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 162 transition count 404
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 162 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 157 transition count 382
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 157 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 152 transition count 366
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 152 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 147 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 147 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 142 transition count 340
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 142 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 137 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 132 transition count 318
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 132 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 128 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 128 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 126 transition count 306
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 126 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 124 transition count 302
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 123 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 123 transition count 300
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 151 place count 123 transition count 294
Applied a total of 151 rules in 55 ms. Remains 123 /187 variables (removed 64) and now considering 294/498 (removed 204) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 123/187 places, 294/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 168 transition count 436
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 168 transition count 436
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 52 place count 168 transition count 420
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 158 transition count 398
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 158 transition count 398
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 158 transition count 394
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 81 place count 153 transition count 378
Iterating global reduction 3 with 5 rules applied. Total rules applied 86 place count 153 transition count 378
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 91 place count 148 transition count 360
Iterating global reduction 3 with 5 rules applied. Total rules applied 96 place count 148 transition count 360
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 143 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 143 transition count 350
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 111 place count 138 transition count 336
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 133 transition count 322
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 133 transition count 322
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 128 transition count 312
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 140 place count 124 transition count 304
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 124 transition count 304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 122 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 122 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 120 transition count 296
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 120 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 119 transition count 294
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 119 transition count 294
Applied a total of 154 rules in 24 ms. Remains 119 /187 variables (removed 68) and now considering 294/498 (removed 204) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 119/187 places, 294/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 86 place count 150 transition count 370
Iterating global reduction 3 with 6 rules applied. Total rules applied 92 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 98 place count 144 transition count 350
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 138 transition count 336
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 138 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 122 place count 132 transition count 316
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 132 transition count 316
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 127 transition count 300
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 127 transition count 300
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 124 transition count 294
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 124 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 121 transition count 288
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 121 transition count 288
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 118 transition count 282
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 118 transition count 282
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 115 transition count 276
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 115 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 113 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 113 transition count 272
Applied a total of 166 rules in 17 ms. Remains 113 /187 variables (removed 74) and now considering 272/498 (removed 226) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 113/187 places, 272/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 168 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 52 place count 168 transition count 418
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 159 transition count 400
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 159 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 159 transition count 396
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 154 transition count 380
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 154 transition count 380
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 89 place count 149 transition count 362
Iterating global reduction 3 with 5 rules applied. Total rules applied 94 place count 149 transition count 362
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 144 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 144 transition count 350
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 139 transition count 334
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 139 transition count 334
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 134 transition count 320
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 134 transition count 320
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 129 transition count 310
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 139 place count 124 transition count 300
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 121 transition count 294
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 118 transition count 288
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 116 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 116 transition count 284
Applied a total of 160 rules in 17 ms. Remains 116 /187 variables (removed 71) and now considering 284/498 (removed 214) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 116/187 places, 284/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 142 transition count 342
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 135 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 128 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 143 place count 121 transition count 284
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 114 transition count 270
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 108 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 104 transition count 250
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 100 transition count 242
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 97 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 97 transition count 236
Applied a total of 198 rules in 17 ms. Remains 97 /187 variables (removed 90) and now considering 236/498 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 97/187 places, 236/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 169 transition count 438
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 169 transition count 438
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 48 place count 169 transition count 424
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 162 transition count 410
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 162 transition count 410
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 157 transition count 394
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 157 transition count 394
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 152 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 147 transition count 364
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 142 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 132 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 132 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 127 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 127 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 124 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 124 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 121 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 121 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 119 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 119 transition count 298
Applied a total of 148 rules in 18 ms. Remains 119 /187 variables (removed 68) and now considering 298/498 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 119/187 places, 298/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 171 transition count 448
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 171 transition count 448
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 44 place count 171 transition count 434
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 163 transition count 416
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 163 transition count 416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 163 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 159 transition count 396
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 159 transition count 396
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 155 transition count 382
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 155 transition count 382
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 151 transition count 374
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 151 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 148 transition count 366
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 148 transition count 366
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 145 transition count 358
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 145 transition count 358
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 142 transition count 352
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 142 transition count 352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 141 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 141 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 140 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 140 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 139 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 139 transition count 346
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 138 transition count 344
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 138 transition count 344
Applied a total of 118 rules in 18 ms. Remains 138 /187 variables (removed 49) and now considering 344/498 (removed 154) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 138/187 places, 344/498 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:50:52] [INFO ] Input system was already deterministic with 344 transitions.
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:50:52] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:50:52] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:50:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 498 transitions and 2004 arcs took 4 ms.
Total runtime 121315 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b032

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 187
TRANSITIONS: 498
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 615
MODEL NAME: /home/mcc/execution/413/model
187 places, 498 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716432655802

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-b032"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-b032, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601100249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b032.tgz
mv FunctionPointer-PT-b032 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;