Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 16:07 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-b128-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b128-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716432970187

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:56:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:56:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:56:11] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-23 02:56:11] [INFO ] Transformed 306 places.
[2024-05-23 02:56:11] [INFO ] Transformed 840 transitions.
[2024-05-23 02:56:11] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 24 place count 198 transition count 566
Iterating global reduction 1 with 16 rules applied. Total rules applied 40 place count 198 transition count 566
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 102 place count 198 transition count 504
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 192 transition count 492
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 192 transition count 492
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 134 place count 192 transition count 472
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 191 transition count 470
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 191 transition count 470
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 190 transition count 466
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 190 transition count 466
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 189 transition count 464
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 189 transition count 464
Applied a total of 140 rules in 82 ms. Remains 189 /222 variables (removed 33) and now considering 464/648 (removed 184) transitions.
[2024-05-23 02:56:11] [INFO ] Flow matrix only has 318 transitions (discarded 146 similar events)
// Phase 1: matrix 318 rows 189 cols
[2024-05-23 02:56:11] [INFO ] Computed 2 invariants in 20 ms
[2024-05-23 02:56:12] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 02:56:12] [INFO ] Flow matrix only has 318 transitions (discarded 146 similar events)
[2024-05-23 02:56:12] [INFO ] Invariant cache hit.
[2024-05-23 02:56:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-23 02:56:12] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-23 02:56:12] [INFO ] Flow matrix only has 318 transitions (discarded 146 similar events)
[2024-05-23 02:56:12] [INFO ] Invariant cache hit.
[2024-05-23 02:56:12] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 318/505 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 63/252 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 462 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/507 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (OVERLAPS) 0/507 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 254 constraints, problems are : Problem set: 0 solved, 462 unsolved in 19118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 318/505 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 63/252 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 32/284 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 2/507 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 430/716 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 10 (OVERLAPS) 0/507 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 716 constraints, problems are : Problem set: 0 solved, 462 unsolved in 26520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints]
After SMT, in 46418ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 46442ms
Starting structural reductions in LTL mode, iteration 1 : 189/222 places, 464/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47161 ms. Remains : 189/222 places, 464/648 transitions.
Support contains 44 out of 189 places after structural reductions.
[2024-05-23 02:56:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-23 02:56:59] [INFO ] Flatten gal took : 56 ms
[2024-05-23 02:56:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-b128-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:56:59] [INFO ] Flatten gal took : 27 ms
[2024-05-23 02:56:59] [INFO ] Input system was already deterministic with 464 transitions.
Support contains 38 out of 189 places (down from 44) after GAL structural reductions.
RANDOM walk for 40165 steps (22 resets) in 1306 ms. (30 steps per ms) remains 15/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 41 ms. (95 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (9 resets) in 50 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (9 resets) in 43 ms. (91 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
[2024-05-23 02:56:59] [INFO ] Flow matrix only has 318 transitions (discarded 146 similar events)
[2024-05-23 02:56:59] [INFO ] Invariant cache hit.
[2024-05-23 02:56:59] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 46/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 28/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 235/330 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 8 (OVERLAPS) 136/466 variables, 66/219 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 7/226 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 41/507 variables, 28/254 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 254 constraints, problems are : Problem set: 3 solved, 11 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 47/64 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 29/93 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 186/279 variables, 93/95 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 16/111 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 137/416 variables, 44/155 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 41/196 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 11/207 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 81/497 variables, 42/249 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 6/255 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 10/507 variables, 10/265 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/265 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/507 variables, 0/265 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 265 constraints, problems are : Problem set: 3 solved, 11 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 1264ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 30243 ms.
Support contains 13 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 464/464 transitions.
Graph (complete) has 749 edges and 189 vertex of which 169 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 169 transition count 428
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 161 transition count 412
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 161 transition count 412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 161 transition count 408
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 155 transition count 396
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 155 transition count 396
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 151 transition count 388
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 151 transition count 388
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 147 transition count 372
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 147 transition count 372
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 143 transition count 364
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 143 transition count 364
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 141 transition count 356
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 141 transition count 356
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 139 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 139 transition count 348
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 137 transition count 344
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 137 transition count 344
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 135 transition count 340
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 135 transition count 340
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 134 transition count 338
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 134 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 133 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 133 transition count 336
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 125 place count 133 transition count 324
Applied a total of 125 rules in 116 ms. Remains 133 /189 variables (removed 56) and now considering 324/464 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 133/189 places, 324/464 transitions.
RANDOM walk for 40001 steps (8 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (14 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 284219 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 7
Probabilistic random walk after 284219 steps, saw 176931 distinct states, run finished after 3004 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-23 02:57:34] [INFO ] Flow matrix only has 217 transitions (discarded 107 similar events)
// Phase 1: matrix 217 rows 133 cols
[2024-05-23 02:57:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:57:34] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 47/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 149/226 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 90/316 variables, 33/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 33/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 33/349 variables, 22/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 176 constraints, problems are : Problem set: 0 solved, 7 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 47/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 149/226 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 90/316 variables, 33/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 33/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 33/349 variables, 22/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/350 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/350 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 183 constraints, problems are : Problem set: 0 solved, 7 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10014 ms.
Support contains 13 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 324/324 transitions.
Applied a total of 0 rules in 21 ms. Remains 133 /133 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 133/133 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 324/324 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2024-05-23 02:57:45] [INFO ] Flow matrix only has 217 transitions (discarded 107 similar events)
[2024-05-23 02:57:45] [INFO ] Invariant cache hit.
[2024-05-23 02:57:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:57:45] [INFO ] Flow matrix only has 217 transitions (discarded 107 similar events)
[2024-05-23 02:57:45] [INFO ] Invariant cache hit.
[2024-05-23 02:57:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 02:57:45] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-23 02:57:45] [INFO ] Redundant transitions in 16 ms returned []
Running 322 sub problems to find dead transitions.
[2024-05-23 02:57:45] [INFO ] Flow matrix only has 217 transitions (discarded 107 similar events)
[2024-05-23 02:57:45] [INFO ] Invariant cache hit.
[2024-05-23 02:57:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 217/350 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 322 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/350 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 176 constraints, problems are : Problem set: 0 solved, 322 unsolved in 9268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 217/350 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 322/498 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 498 constraints, problems are : Problem set: 0 solved, 322 unsolved in 10968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
After SMT, in 20551ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 20556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20830 ms. Remains : 133/133 places, 324/324 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 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 114 rules applied. Total rules applied 114 place count 133 transition count 210
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 123 place count 126 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 124 transition count 208
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 125 place count 124 transition count 181
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 179 place count 97 transition count 181
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 215 place count 79 transition count 163
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 221 place count 73 transition count 151
Iterating global reduction 3 with 6 rules applied. Total rules applied 227 place count 73 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 67 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 67 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 245 place count 61 transition count 127
Iterating global reduction 3 with 6 rules applied. Total rules applied 251 place count 61 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 257 place count 61 transition count 121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 267 place count 56 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 56 transition count 118
Applied a total of 271 rules in 33 ms. Remains 56 /133 variables (removed 77) and now considering 118/324 (removed 206) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 118 rows 56 cols
[2024-05-23 02:58:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:58:06] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-23 02:58:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:58:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:58:06] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-23 02:58:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:58:06] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-23 02:58:06] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-23 02:58:06] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 261 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b128-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:58:06] [INFO ] Flatten gal took : 20 ms
[2024-05-23 02:58:06] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:58:06] [INFO ] Input system was already deterministic with 464 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 999 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Graph (complete) has 999 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 173 transition count 436
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 173 transition count 436
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 35 place count 173 transition count 430
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 163 transition count 408
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 163 transition count 408
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 156 transition count 392
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 156 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 149 transition count 364
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 142 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 142 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 135 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 135 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 128 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 128 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 132 place count 121 transition count 286
Iterating global reduction 1 with 7 rules applied. Total rules applied 139 place count 121 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 114 transition count 272
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 114 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 159 place count 108 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 165 place count 108 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 103 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 103 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 179 place count 99 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 183 place count 99 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 185 place count 99 transition count 240
Applied a total of 185 rules in 68 ms. Remains 99 /189 variables (removed 90) and now considering 240/464 (removed 224) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 99/189 places, 240/464 transitions.
[2024-05-23 02:58:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:58:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:58:06] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40036 steps (27 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1726801 steps, run timeout after 3001 ms. (steps per millisecond=575 ) properties seen :0 out of 1
Probabilistic random walk after 1726801 steps, saw 1135228 distinct states, run finished after 3001 ms. (steps per millisecond=575 ) properties seen :0
[2024-05-23 02:58:09] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2024-05-23 02:58:09] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 02:58:09] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/136 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/185 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/242 variables, 27/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/255 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/259 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/262 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/136 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/185 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/242 variables, 27/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/255 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/262 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/262 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/262 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 240/240 transitions.
Graph (complete) has 404 edges and 99 vertex of which 78 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 78 transition count 198
Applied a total of 43 rules in 5 ms. Remains 78 /99 variables (removed 21) and now considering 198/240 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 78/99 places, 198/240 transitions.
RANDOM walk for 4000002 steps (9 resets) in 5990 ms. (667 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (242 resets) in 2999 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3821368 steps, run timeout after 6001 ms. (steps per millisecond=636 ) properties seen :0 out of 1
Probabilistic random walk after 3821368 steps, saw 2411823 distinct states, run finished after 6001 ms. (steps per millisecond=636 ) properties seen :0
[2024-05-23 02:58:18] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
// Phase 1: matrix 123 rows 78 cols
[2024-05-23 02:58:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:58:18] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/136 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/166 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/188 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/194 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/198 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/136 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/166 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/188 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/194 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/198 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/201 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 78/78 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 198/198 transitions.
Applied a total of 0 rules in 12 ms. Remains 78 /78 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-23 02:58:18] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:18] [INFO ] Invariant cache hit.
[2024-05-23 02:58:18] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 02:58:18] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:18] [INFO ] Invariant cache hit.
[2024-05-23 02:58:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 02:58:18] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-23 02:58:18] [INFO ] Redundant transitions in 3 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-23 02:58:18] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:18] [INFO ] Invariant cache hit.
[2024-05-23 02:58:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 123/201 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 3759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 123/201 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 4502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 8383ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 8386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8559 ms. Remains : 78/78 places, 198/198 transitions.
RANDOM walk for 400000 steps (10 resets) in 1462 ms. (273 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-23 02:58:27] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:27] [INFO ] Invariant cache hit.
[2024-05-23 02:58:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:58:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:58:27] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:58:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 02:58:27] [INFO ] After 3ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:27] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:27] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 02:58:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:58:28] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:28] [INFO ] After 3ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:28] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:28] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000013 steps (8 resets) in 4953 ms. (807 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (228 resets) in 2939 ms. (1360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4065598 steps, run timeout after 6001 ms. (steps per millisecond=677 ) properties seen :0 out of 1
Probabilistic random walk after 4065598 steps, saw 2579433 distinct states, run finished after 6001 ms. (steps per millisecond=677 ) properties seen :0
[2024-05-23 02:58:36] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:36] [INFO ] Invariant cache hit.
[2024-05-23 02:58:36] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/136 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/166 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/188 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/194 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/198 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/136 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/166 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/188 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/194 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/198 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/201 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 78/78 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-23 02:58:36] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:36] [INFO ] Invariant cache hit.
[2024-05-23 02:58:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 02:58:36] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:36] [INFO ] Invariant cache hit.
[2024-05-23 02:58:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 02:58:36] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-23 02:58:36] [INFO ] Redundant transitions in 4 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-23 02:58:36] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:36] [INFO ] Invariant cache hit.
[2024-05-23 02:58:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 123/201 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 3793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 123/201 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 296 constraints, problems are : Problem set: 0 solved, 196 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 8275ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 8277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8436 ms. Remains : 78/78 places, 198/198 transitions.
RANDOM walk for 400001 steps (8 resets) in 757 ms. (527 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-23 02:58:45] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:45] [INFO ] Invariant cache hit.
[2024-05-23 02:58:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:58:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:58:45] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:58:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 02:58:45] [INFO ] After 6ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:45] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:45] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:58:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:58:45] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:45] [INFO ] After 3ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:45] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:45] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 37341 steps (8 resets) in 85 ms. (434 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (13 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2049219 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :0 out of 1
Probabilistic random walk after 2049219 steps, saw 1275578 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
[2024-05-23 02:58:48] [INFO ] Flow matrix only has 123 transitions (discarded 75 similar events)
[2024-05-23 02:58:48] [INFO ] Invariant cache hit.
[2024-05-23 02:58:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/153 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/185 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/194 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/198 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/153 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/185 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/194 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/198 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/201 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 198/198 transitions.
Graph (complete) has 341 edges and 78 vertex of which 75 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 75 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 74 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 74 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 74 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 73 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 73 transition count 186
Applied a total of 13 rules in 7 ms. Remains 73 /78 variables (removed 5) and now considering 186/198 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 73/78 places, 186/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2082457 steps, run timeout after 3001 ms. (steps per millisecond=693 ) properties seen :0 out of 1
Probabilistic random walk after 2082457 steps, saw 1268668 distinct states, run finished after 3001 ms. (steps per millisecond=693 ) properties seen :0
[2024-05-23 02:58:51] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2024-05-23 02:58:51] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 02:58:51] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/154 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/171 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 7/178 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/182 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/185 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/129 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/148 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/154 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/171 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/178 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/182 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/185 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 10 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-23 02:58:51] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:58:51] [INFO ] Invariant cache hit.
[2024-05-23 02:58:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:58:51] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:58:51] [INFO ] Invariant cache hit.
[2024-05-23 02:58:51] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 02:58:52] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-23 02:58:52] [INFO ] Redundant transitions in 1 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-23 02:58:52] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
[2024-05-23 02:58:52] [INFO ] Invariant cache hit.
[2024-05-23 02:58:52] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 91 constraints, problems are : Problem set: 0 solved, 184 unsolved in 3292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 112/185 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 275 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 7407ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 7410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7592 ms. Remains : 73/73 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 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 81 rules applied. Total rules applied 81 place count 73 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 66 transition count 105
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 88 place count 66 transition count 94
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 110 place count 55 transition count 94
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 138 place count 41 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 35 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 35 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 29 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 29 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 23 transition count 44
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 23 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 180 place count 23 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 21 transition count 39
Applied a total of 184 rules in 10 ms. Remains 21 /73 variables (removed 52) and now considering 39/186 (removed 147) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 21 cols
[2024-05-23 02:58:59] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:58:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:58:59] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:58:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:58:59] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:59] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:59] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:58:59] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:59] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:59] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:59] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 78 transition count 117
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 72 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 71 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 89 place count 71 transition count 106
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 109 place count 61 transition count 106
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 141 place count 45 transition count 90
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 147 place count 39 transition count 78
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 39 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 159 place count 33 transition count 66
Iterating global reduction 3 with 6 rules applied. Total rules applied 165 place count 33 transition count 66
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 171 place count 27 transition count 54
Iterating global reduction 3 with 6 rules applied. Total rules applied 177 place count 27 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 183 place count 27 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 25 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 25 transition count 46
Applied a total of 190 rules in 8 ms. Remains 25 /78 variables (removed 53) and now considering 46/198 (removed 152) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 25 cols
[2024-05-23 02:58:59] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 02:58:59] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:58:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 02:58:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:58:59] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:58:59] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:58:59] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:58:59] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 63 ms.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 464
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 175 transition count 440
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 175 transition count 440
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 34 place count 175 transition count 432
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 41 place count 168 transition count 418
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 168 transition count 418
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 163 transition count 406
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 163 transition count 406
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 158 transition count 386
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 158 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 153 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 153 transition count 376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 149 transition count 362
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 149 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 145 transition count 348
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 145 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 141 transition count 340
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 141 transition count 340
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 138 transition count 334
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 138 transition count 334
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 136 transition count 330
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 136 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 134 transition count 326
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 134 transition count 326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 132 transition count 322
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 132 transition count 322
Applied a total of 120 rules in 33 ms. Remains 132 /189 variables (removed 57) and now considering 322/464 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 132/189 places, 322/464 transitions.
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 12 ms
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 12 ms
[2024-05-23 02:58:59] [INFO ] Input system was already deterministic with 322 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Graph (complete) has 999 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 172 transition count 434
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 172 transition count 434
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 39 place count 172 transition count 426
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 162 transition count 404
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 162 transition count 404
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 155 transition count 388
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 155 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 148 transition count 360
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 148 transition count 360
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 141 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 141 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 135 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 135 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 129 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 129 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 130 place count 124 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 124 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 140 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 145 place count 119 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 116 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 114 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 112 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 112 transition count 270
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 161 place count 112 transition count 268
Applied a total of 161 rules in 40 ms. Remains 112 /189 variables (removed 77) and now considering 268/464 (removed 196) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 112/189 places, 268/464 transitions.
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:58:59] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 464
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 175 transition count 438
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 175 transition count 438
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 175 transition count 432
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 42 place count 166 transition count 412
Iterating global reduction 2 with 9 rules applied. Total rules applied 51 place count 166 transition count 412
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 160 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 160 transition count 398
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 154 transition count 374
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 154 transition count 374
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 81 place count 148 transition count 360
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 148 transition count 360
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 93 place count 142 transition count 340
Iterating global reduction 2 with 6 rules applied. Total rules applied 99 place count 142 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 137 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 137 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 132 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 127 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 123 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 120 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 120 transition count 290
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 118 transition count 286
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 118 transition count 286
Applied a total of 147 rules in 23 ms. Remains 118 /189 variables (removed 71) and now considering 286/464 (removed 178) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 118/189 places, 286/464 transitions.
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:58:59] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 464
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 174 transition count 438
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 174 transition count 438
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 174 transition count 434
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 164 transition count 412
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 164 transition count 412
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 157 transition count 396
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 157 transition count 396
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 150 transition count 368
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 143 transition count 352
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 143 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 137 transition count 332
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 137 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 131 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 125 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 120 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 120 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 115 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 115 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 154 place count 111 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 111 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 108 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 108 transition count 266
Applied a total of 164 rules in 22 ms. Remains 108 /189 variables (removed 81) and now considering 266/464 (removed 198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 108/189 places, 266/464 transitions.
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:58:59] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 464
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 177 transition count 442
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 177 transition count 442
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 177 transition count 434
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 170 transition count 418
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 170 transition count 418
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 165 transition count 408
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 165 transition count 408
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 161 transition count 392
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 161 transition count 392
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 157 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 157 transition count 384
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 153 transition count 368
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 153 transition count 368
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 149 transition count 352
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 149 transition count 352
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 145 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 145 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 141 transition count 336
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 141 transition count 336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 138 transition count 330
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 138 transition count 330
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 135 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 135 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 132 transition count 318
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 132 transition count 318
Applied a total of 121 rules in 25 ms. Remains 132 /189 variables (removed 57) and now considering 318/464 (removed 146) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 132/189 places, 318/464 transitions.
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:58:59] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 464
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 172 transition count 434
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 172 transition count 434
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 40 place count 172 transition count 426
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 50 place count 162 transition count 404
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 162 transition count 404
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 155 transition count 388
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 155 transition count 388
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 148 transition count 360
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 148 transition count 360
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 141 transition count 344
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 141 transition count 344
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 134 transition count 320
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 134 transition count 320
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 123 place count 127 transition count 296
Iterating global reduction 2 with 7 rules applied. Total rules applied 130 place count 127 transition count 296
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 137 place count 120 transition count 282
Iterating global reduction 2 with 7 rules applied. Total rules applied 144 place count 120 transition count 282
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 113 transition count 268
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 113 transition count 268
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 164 place count 107 transition count 256
Iterating global reduction 2 with 6 rules applied. Total rules applied 170 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 175 place count 102 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 180 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 185 place count 97 transition count 236
Iterating global reduction 2 with 5 rules applied. Total rules applied 190 place count 97 transition count 236
Applied a total of 190 rules in 20 ms. Remains 97 /189 variables (removed 92) and now considering 236/464 (removed 228) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 97/189 places, 236/464 transitions.
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:58:59] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:58:59] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 464/464 transitions.
Graph (complete) has 999 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 172 transition count 434
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 172 transition count 434
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 39 place count 172 transition count 426
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 162 transition count 404
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 162 transition count 404
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 155 transition count 388
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 155 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 148 transition count 360
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 148 transition count 360
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 141 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 141 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 108 place count 134 transition count 320
Iterating global reduction 1 with 7 rules applied. Total rules applied 115 place count 134 transition count 320
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 127 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 127 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 136 place count 120 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 143 place count 120 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 150 place count 113 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 157 place count 113 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 163 place count 107 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 169 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 174 place count 102 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 179 place count 102 transition count 246
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 184 place count 97 transition count 236
Iterating global reduction 1 with 5 rules applied. Total rules applied 189 place count 97 transition count 236
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 191 place count 97 transition count 234
Applied a total of 191 rules in 35 ms. Remains 97 /189 variables (removed 92) and now considering 234/464 (removed 230) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 97/189 places, 234/464 transitions.
[2024-05-23 02:59:00] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:59:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:59:00] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-23 02:59:00] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:59:00] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:59:00] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:59:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 464 transitions and 1864 arcs took 4 ms.
Total runtime 168778 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b128

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/404/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 189
TRANSITIONS: 464
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


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


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

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

Process ID: 707
MODEL NAME: /home/mcc/execution/404/model
189 places, 464 transitions.
Enabling coverability test.

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

BK_STOP 1716433153424

--------------------
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

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-b128"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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