Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:06 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-b016-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717188722162

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:52:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:52:03] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-31 20:52:03] [INFO ] Transformed 306 places.
[2024-05-31 20:52:03] [INFO ] Transformed 840 transitions.
[2024-05-31 20:52:03] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 84 places in 4 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 648
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 20 place count 202 transition count 576
Iterating global reduction 1 with 13 rules applied. Total rules applied 33 place count 202 transition count 576
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 202 transition count 540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 200 transition count 536
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 200 transition count 536
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 200 transition count 526
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 199 transition count 524
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 199 transition count 524
Applied a total of 85 rules in 65 ms. Remains 199 /222 variables (removed 23) and now considering 524/648 (removed 124) transitions.
[2024-05-31 20:52:03] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
// Phase 1: matrix 349 rows 199 cols
[2024-05-31 20:52:03] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 20:52:03] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 20:52:03] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
[2024-05-31 20:52:03] [INFO ] Invariant cache hit.
[2024-05-31 20:52:04] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-31 20:52:04] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-05-31 20:52:04] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
[2024-05-31 20:52:04] [INFO ] Invariant cache hit.
[2024-05-31 20:52:04] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 349/546 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 522 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (OVERLAPS) 2/548 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 266 constraints, problems are : Problem set: 0 solved, 522 unsolved in 28773 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 349/546 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 32/296 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 2/548 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 490/788 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 11 (OVERLAPS) 0/548 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 522 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 788 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints]
After SMT, in 59640ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 59658ms
Starting structural reductions in LTL mode, iteration 1 : 199/222 places, 524/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60366 ms. Remains : 199/222 places, 524/648 transitions.
Support contains 74 out of 199 places after structural reductions.
[2024-05-31 20:53:04] [INFO ] Flatten gal took : 75 ms
[2024-05-31 20:53:04] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:53:04] [INFO ] Flatten gal took : 37 ms
[2024-05-31 20:53:04] [INFO ] Input system was already deterministic with 524 transitions.
Support contains 45 out of 199 places (down from 74) after GAL structural reductions.
RANDOM walk for 40016 steps (39 resets) in 1239 ms. (32 steps per ms) remains 12/30 properties
BEST_FIRST walk for 40004 steps (14 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (19 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (20 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (20 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (16 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (17 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
[2024-05-31 20:53:05] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
[2024-05-31 20:53:05] [INFO ] Invariant cache hit.
[2024-05-31 20:53:05] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/44 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 200/246 variables, 46/48 constraints. Problems are: Problem set: 3 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 17/65 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 242/488 variables, 108/173 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 47/220 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 6/494 variables, 1/221 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 54/548 variables, 45/266 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/548 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 266 constraints, problems are : Problem set: 3 solved, 9 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 42/52 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 213/265 variables, 29/39 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 5/44 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 9/53 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 28/293 variables, 2/55 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 5/60 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 217/510 variables, 124/184 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 59/243 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/243 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 6/516 variables, 1/244 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 32/548 variables, 31/275 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/548 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 275 constraints, problems are : Problem set: 3 solved, 9 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1440ms problems are : Problem set: 3 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 3838 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 807 edges and 199 vertex of which 172 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 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 172 transition count 476
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 68 place count 153 transition count 404
Iterating global reduction 1 with 19 rules applied. Total rules applied 87 place count 153 transition count 404
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 99 place count 153 transition count 392
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 110 place count 142 transition count 370
Iterating global reduction 2 with 11 rules applied. Total rules applied 121 place count 142 transition count 370
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 138 transition count 360
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 138 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 135 transition count 350
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 135 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 132 transition count 342
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 132 transition count 342
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 130 transition count 334
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 130 transition count 334
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 128 transition count 328
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 128 transition count 328
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 126 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 126 transition count 324
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 124 transition count 320
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 124 transition count 320
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 122 transition count 316
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 122 transition count 316
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 163 place count 120 transition count 312
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 120 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 119 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 119 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 179 place count 119 transition count 298
Applied a total of 179 rules in 116 ms. Remains 119 /199 variables (removed 80) and now considering 298/524 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 119/199 places, 298/524 transitions.
RANDOM walk for 40001 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
[2024-05-31 20:53:10] [INFO ] Flow matrix only has 193 transitions (discarded 105 similar events)
// Phase 1: matrix 193 rows 119 cols
[2024-05-31 20:53:10] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 20:53:10] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 111/141 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/156 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 136/292 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/298 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 14/312 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/312 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 152 constraints, problems are : Problem set: 0 solved, 6 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 30/30 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 111/141 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 15/156 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 136/292 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 6/298 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/312 variables, 16/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/312 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 158 constraints, problems are : Problem set: 0 solved, 6 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 298/298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 117 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 117 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 116 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 116 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 115 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 115 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 114 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 282
Applied a total of 14 rules in 30 ms. Remains 112 /119 variables (removed 7) and now considering 282/298 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 112/119 places, 282/298 transitions.
RANDOM walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 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
[2024-05-31 20:53:11] [INFO ] Flow matrix only has 181 transitions (discarded 101 similar events)
// Phase 1: matrix 181 rows 112 cols
[2024-05-31 20:53:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:53:11] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 105/129 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 13/142 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 129/271 variables, 76/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 25/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/277 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 16/293 variables, 16/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 142 constraints, problems are : Problem set: 0 solved, 5 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 27/27 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 105/129 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 13/142 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 129/271 variables, 76/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 25/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/277 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 16/293 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/293 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/293 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 147 constraints, problems are : Problem set: 0 solved, 5 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 1816 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 282/282 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 109 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 107 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 107 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 105 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 105 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 103 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 103 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 101 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 101 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 99 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 99 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 97 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 97 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 95 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 95 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 94 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 94 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 93 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 93 transition count 236
Applied a total of 40 rules in 23 ms. Remains 93 /112 variables (removed 19) and now considering 236/282 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 93/112 places, 236/282 transitions.
RANDOM walk for 40001 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 464859 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 4
Probabilistic random walk after 464859 steps, saw 289370 distinct states, run finished after 3009 ms. (steps per millisecond=154 ) properties seen :0
[2024-05-31 20:53:17] [INFO ] Flow matrix only has 148 transitions (discarded 88 similar events)
// Phase 1: matrix 148 rows 93 cols
[2024-05-31 20:53:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:53:17] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/106 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/115 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 109/224 variables, 63/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 19/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/230 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/241 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/241 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 117 constraints, problems are : Problem set: 0 solved, 4 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/106 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/115 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 109/224 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/230 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 11/241 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 333ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/93 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2024-05-31 20:53:17] [INFO ] Flow matrix only has 148 transitions (discarded 88 similar events)
[2024-05-31 20:53:17] [INFO ] Invariant cache hit.
[2024-05-31 20:53:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:53:17] [INFO ] Flow matrix only has 148 transitions (discarded 88 similar events)
[2024-05-31 20:53:17] [INFO ] Invariant cache hit.
[2024-05-31 20:53:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-31 20:53:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-31 20:53:18] [INFO ] Redundant transitions in 8 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-31 20:53:18] [INFO ] Flow matrix only has 148 transitions (discarded 88 similar events)
[2024-05-31 20:53:18] [INFO ] Invariant cache hit.
[2024-05-31 20:53:18] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 148/241 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/241 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 117 constraints, problems are : Problem set: 0 solved, 234 unsolved in 4019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 148/241 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 21/117 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 234/351 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 351 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 10760ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 10762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10985 ms. Remains : 93/93 places, 236/236 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 93 transition count 141
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 102 place count 86 transition count 141
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 102 place count 86 transition count 121
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 142 place count 66 transition count 121
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 170 place count 52 transition count 107
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 45 transition count 93
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 45 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 38 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 38 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 205 place count 31 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 212 place count 31 transition count 65
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 219 place count 31 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 219 place count 31 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 30 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 227 place count 27 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 27 transition count 56
Applied a total of 228 rules in 21 ms. Remains 27 /93 variables (removed 66) and now considering 56/236 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 56 rows 27 cols
[2024-05-31 20:53:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 20:53:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:28] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 20:53:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:53:28] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 20:53:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:53:28] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 20:53:28] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 20:53:28] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:53:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 20:53:28] [INFO ] Flatten gal took : 24 ms
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:53:28] [INFO ] Flatten gal took : 25 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 524 transitions.
Support contains 38 out of 199 places (down from 40) after GAL structural reductions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 174 transition count 446
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 174 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 61 place count 174 transition count 430
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 163 transition count 408
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 163 transition count 408
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 156 transition count 390
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 156 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 149 transition count 364
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 142 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 142 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 131 place count 136 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 136 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 155 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 161 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 178 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 183 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 188 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 193 place count 108 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 197 place count 104 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 201 place count 104 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 203 place count 104 transition count 252
Applied a total of 203 rules in 110 ms. Remains 104 /199 variables (removed 95) and now considering 252/524 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 104/199 places, 252/524 transitions.
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 176 transition count 458
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 176 transition count 458
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 65 place count 176 transition count 436
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 75 place count 166 transition count 416
Iterating global reduction 2 with 10 rules applied. Total rules applied 85 place count 166 transition count 416
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 159 transition count 398
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 159 transition count 398
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 105 place count 153 transition count 376
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 153 transition count 376
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 117 place count 147 transition count 362
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 147 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 143 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 143 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 139 transition count 332
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 139 transition count 332
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 136 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 136 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 133 transition count 320
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 133 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 154 place count 130 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 157 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 127 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 127 transition count 308
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 125 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 125 transition count 304
Applied a total of 167 rules in 54 ms. Remains 125 /199 variables (removed 74) and now considering 304/524 (removed 220) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 125/199 places, 304/524 transitions.
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 176 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 176 transition count 450
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 55 place count 176 transition count 436
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 165 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 165 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 159 transition count 400
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 159 transition count 400
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 153 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 153 transition count 378
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 147 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 141 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 141 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 131 place count 135 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 135 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 129 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 155 place count 123 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 161 place count 123 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 117 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 117 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 179 place count 111 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 185 place count 111 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 190 place count 106 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 195 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 106 transition count 256
Applied a total of 199 rules in 114 ms. Remains 106 /199 variables (removed 93) and now considering 256/524 (removed 268) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 106/199 places, 256/524 transitions.
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 256 transitions.
RANDOM walk for 32593 steps (43 resets) in 119 ms. (271 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 174 transition count 446
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 174 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 63 place count 174 transition count 430
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 163 transition count 408
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 163 transition count 408
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 156 transition count 390
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 156 transition count 390
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 149 transition count 364
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 120 place count 142 transition count 348
Iterating global reduction 2 with 7 rules applied. Total rules applied 127 place count 142 transition count 348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 133 place count 136 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 139 place count 136 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 130 transition count 306
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 118 transition count 282
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 113 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 108 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 108 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 104 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 104 transition count 254
Applied a total of 203 rules in 42 ms. Remains 104 /199 variables (removed 95) and now considering 254/524 (removed 270) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 104/199 places, 254/524 transitions.
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 177 transition count 460
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 177 transition count 460
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 59 place count 177 transition count 440
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 168 transition count 422
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 168 transition count 422
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 162 transition count 406
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 162 transition count 406
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 157 transition count 388
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 157 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 152 transition count 376
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 152 transition count 376
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 113 place count 148 transition count 362
Iterating global reduction 1 with 4 rules applied. Total rules applied 117 place count 148 transition count 362
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 144 transition count 350
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 144 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 129 place count 140 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 133 place count 140 transition count 342
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 137 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 137 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 134 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 134 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 131 transition count 324
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 131 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 129 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 129 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 163 place count 129 transition count 312
Applied a total of 163 rules in 77 ms. Remains 129 /199 variables (removed 70) and now considering 312/524 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 129/199 places, 312/524 transitions.
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 174 transition count 446
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 174 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 63 place count 174 transition count 430
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 163 transition count 408
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 163 transition count 408
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 157 transition count 392
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 157 transition count 392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 151 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 151 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 145 transition count 356
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 127 place count 139 transition count 334
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 139 transition count 334
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 133 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 133 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 127 transition count 302
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 127 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 163 place count 121 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 116 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 111 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 111 transition count 270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 107 transition count 262
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 107 transition count 262
Applied a total of 197 rules in 34 ms. Remains 107 /199 variables (removed 92) and now considering 262/524 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 107/199 places, 262/524 transitions.
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 19 ms
[2024-05-31 20:53:29] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:53:29] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 175 transition count 448
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 175 transition count 448
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 61 place count 175 transition count 432
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 164 transition count 410
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 164 transition count 410
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 157 transition count 392
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 157 transition count 392
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 150 transition count 366
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 150 transition count 366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 143 transition count 350
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 137 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 131 transition count 308
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 131 transition count 308
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 125 transition count 296
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 119 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 115 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 111 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 108 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 108 transition count 262
Applied a total of 195 rules in 31 ms. Remains 108 /199 variables (removed 91) and now considering 262/524 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 108/199 places, 262/524 transitions.
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:53:30] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 175 transition count 456
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 175 transition count 456
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 69 place count 175 transition count 432
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 165 transition count 412
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 165 transition count 412
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 158 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 158 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 110 place count 151 transition count 368
Iterating global reduction 2 with 7 rules applied. Total rules applied 117 place count 151 transition count 368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 124 place count 144 transition count 352
Iterating global reduction 2 with 7 rules applied. Total rules applied 131 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 137 place count 138 transition count 330
Iterating global reduction 2 with 6 rules applied. Total rules applied 143 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 149 place count 132 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 155 place count 132 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 126 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 120 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 115 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 110 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 106 transition count 258
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 106 transition count 258
Applied a total of 207 rules in 31 ms. Remains 106 /199 variables (removed 93) and now considering 258/524 (removed 266) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 106/199 places, 258/524 transitions.
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:53:30] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 177 transition count 460
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 177 transition count 460
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 59 place count 177 transition count 442
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 68 place count 168 transition count 424
Iterating global reduction 2 with 9 rules applied. Total rules applied 77 place count 168 transition count 424
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 162 transition count 410
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 162 transition count 410
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 156 transition count 388
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 156 transition count 388
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 150 transition count 374
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 150 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 145 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 145 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 140 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 140 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 138 place count 135 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 135 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 130 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 125 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 125 transition count 306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 168 place count 120 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 173 place count 120 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 116 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 116 transition count 288
Applied a total of 181 rules in 16 ms. Remains 116 /199 variables (removed 83) and now considering 288/524 (removed 236) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 116/199 places, 288/524 transitions.
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 9 ms
[2024-05-31 20:53:30] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:53:30] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:53:30] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:53:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 524 transitions and 2112 arcs took 4 ms.
Total runtime 87063 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-00
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-01
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-04
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-05
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-08
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-09
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-10
Could not compute solution for formula : FunctionPointer-PT-b016-CTLCardinality-2024-11

BK_STOP 1717188810577

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/579/ctl_0_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/579/ctl_1_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/579/ctl_2_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/579/ctl_3_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/579/ctl_4_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/579/ctl_5_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/579/ctl_6_
ctl formula name FunctionPointer-PT-b016-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/579/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b016"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-b016, 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 r496-tall-171640603000241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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