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.r091-tall-171624187300230.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 CloudReconfiguration-PT-315, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187300230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 19:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 19:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 19:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 19:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-315-ReachabilityCardinality-2024-00
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-01
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-02
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-03
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-04
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-05
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-06
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-07
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-08
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-09
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-10
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-11
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-12
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-13
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-14
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716270910182

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:55:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 05:55:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:55:11] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-21 05:55:11] [INFO ] Transformed 2585 places.
[2024-05-21 05:55:11] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:55:11] [INFO ] Found NUPN structural information;
[2024-05-21 05:55:11] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (309 resets) in 2001 ms. (19 steps per ms) remains 12/15 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (96 resets) in 546 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (96 resets) in 421 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (91 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (100 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (88 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (96 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (93 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (93 resets) in 202 ms. (197 steps per ms) remains 11/12 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (99 resets) in 476 ms. (83 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (96 resets) in 155 ms. (256 steps per ms) remains 10/11 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (99 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (92 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-21 05:55:13] [INFO ] Computed 4 invariants in 52 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2435/2574 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2574 variables, 2435/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2574 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5659 variables, 2574/5152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5659 variables, 0/5152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/5661 variables, 1/5153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5661 variables, 1/5154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5661 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/5663 variables, 1/5155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5663 variables, 1/5156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5663/5680 variables, and 5156 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5060 ms.
Refiners :[Domain max(s): 2576/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2576/2585 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2435/2574 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2574 variables, 2435/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2574 variables, 0/2578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5659 variables, 2574/5152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5659 variables, 10/5162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5659 variables, 0/5162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 10373ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 139 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2642 edges and 2585 vertex of which 513 / 2585 are part of one of the 52 SCC in 12 ms
Free SCC test removed 461 places
Drop transitions (Empty/Sink Transition effects.) removed 566 transitions
Reduce isomorphic transitions removed 566 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1174 transitions
Trivial Post-agglo rules discarded 1174 transitions
Performed 1174 trivial Post agglomeration. Transition count delta: 1174
Iterating post reduction 0 with 1174 rules applied. Total rules applied 1175 place count 2124 transition count 1355
Reduce places removed 1174 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 1274 rules applied. Total rules applied 2449 place count 950 transition count 1255
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 46 rules applied. Total rules applied 2495 place count 908 transition count 1251
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2498 place count 907 transition count 1249
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 2502 place count 906 transition count 1246
Reduce places removed 2 places and 0 transitions.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 5 with 87 rules applied. Total rules applied 2589 place count 904 transition count 1161
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 86 rules applied. Total rules applied 2675 place count 819 transition count 1160
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 35 Pre rules applied. Total rules applied 2675 place count 819 transition count 1125
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 2745 place count 784 transition count 1125
Discarding 103 places :
Symmetric choice reduction at 7 with 103 rule applications. Total rules 2848 place count 681 transition count 1022
Iterating global reduction 7 with 103 rules applied. Total rules applied 2951 place count 681 transition count 1022
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 12 rules applied. Total rules applied 2963 place count 681 transition count 1010
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 9 rules applied. Total rules applied 2972 place count 678 transition count 1004
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 7 rules applied. Total rules applied 2979 place count 675 transition count 1000
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 2982 place count 674 transition count 998
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 3 rules applied. Total rules applied 2985 place count 673 transition count 996
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 2987 place count 671 transition count 996
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 7 Pre rules applied. Total rules applied 2987 place count 671 transition count 989
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 3001 place count 664 transition count 989
Discarding 53 places :
Symmetric choice reduction at 13 with 53 rule applications. Total rules 3054 place count 611 transition count 936
Iterating global reduction 13 with 53 rules applied. Total rules applied 3107 place count 611 transition count 936
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 13 with 24 rules applied. Total rules applied 3131 place count 611 transition count 912
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 14 with 20 rules applied. Total rules applied 3151 place count 599 transition count 904
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3155 place count 595 transition count 904
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 3161 place count 589 transition count 895
Iterating global reduction 16 with 6 rules applied. Total rules applied 3167 place count 589 transition count 895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 3168 place count 589 transition count 894
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3170 place count 587 transition count 890
Iterating global reduction 17 with 2 rules applied. Total rules applied 3172 place count 587 transition count 890
Performed 183 Post agglomeration using F-continuation condition with reduction of 58 identical transitions.
Deduced a syphon composed of 183 places in 0 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 17 with 366 rules applied. Total rules applied 3538 place count 404 transition count 649
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 3550 place count 404 transition count 637
Performed 53 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 18 with 106 rules applied. Total rules applied 3656 place count 351 transition count 678
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 18 with 22 rules applied. Total rules applied 3678 place count 351 transition count 656
Discarding 13 places :
Symmetric choice reduction at 19 with 13 rule applications. Total rules 3691 place count 338 transition count 630
Iterating global reduction 19 with 13 rules applied. Total rules applied 3704 place count 338 transition count 630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 3706 place count 338 transition count 628
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 20 with 53 rules applied. Total rules applied 3759 place count 338 transition count 575
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3760 place count 337 transition count 574
Iterating global reduction 20 with 1 rules applied. Total rules applied 3761 place count 337 transition count 574
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3762 place count 337 transition count 573
Free-agglomeration rule applied 27 times.
Iterating global reduction 20 with 27 rules applied. Total rules applied 3789 place count 337 transition count 546
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 28 rules applied. Total rules applied 3817 place count 310 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 21 with 6 rules applied. Total rules applied 3823 place count 310 transition count 539
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3824 place count 310 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 3825 place count 309 transition count 538
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 22 with 11 rules applied. Total rules applied 3836 place count 309 transition count 538
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 22 with 5 rules applied. Total rules applied 3841 place count 309 transition count 538
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 3843 place count 309 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 3844 place count 308 transition count 535
Applied a total of 3844 rules in 497 ms. Remains 308 /2585 variables (removed 2277) and now considering 535/3095 (removed 2560) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 308/2585 places, 535/3095 transitions.
RANDOM walk for 40000 steps (1904 resets) in 710 ms. (56 steps per ms) remains 6/10 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (486 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (485 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (461 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (470 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (490 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (431 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
[2024-05-21 05:55:24] [INFO ] Flow matrix only has 530 transitions (discarded 5 similar events)
// Phase 1: matrix 530 rows 308 cols
[2024-05-21 05:55:25] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 05:55:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 199/308 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 530/838 variables, 308/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/838 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 316 constraints, problems are : Problem set: 0 solved, 6 unsolved in 455 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 308/308 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 199/308 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 530/838 variables, 308/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/838 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 838/838 variables, and 322 constraints, problems are : Problem set: 0 solved, 6 unsolved in 823 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 308/308 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1336ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 663 ms.
Support contains 53 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 535/535 transitions.
Graph (trivial) has 240 edges and 308 vertex of which 48 / 308 are part of one of the 20 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 660 edges and 280 vertex of which 274 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 274 transition count 435
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 116 place count 229 transition count 414
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 126 place count 219 transition count 414
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 126 place count 219 transition count 404
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 146 place count 209 transition count 404
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 204 transition count 395
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 204 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 204 transition count 394
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 199 place count 183 transition count 371
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 209 place count 183 transition count 361
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 211 place count 181 transition count 358
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 181 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 180 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 180 transition count 356
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 232 place count 172 transition count 374
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 250 place count 172 transition count 356
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 253 place count 169 transition count 350
Iterating global reduction 8 with 3 rules applied. Total rules applied 256 place count 169 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 269 place count 169 transition count 337
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 274 place count 169 transition count 332
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 279 place count 164 transition count 332
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 282 place count 164 transition count 332
Applied a total of 282 rules in 82 ms. Remains 164 /308 variables (removed 144) and now considering 332/535 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 164/308 places, 332/535 transitions.
RANDOM walk for 40000 steps (249 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (62 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 971123 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 3
Probabilistic random walk after 971123 steps, saw 179026 distinct states, run finished after 3005 ms. (steps per millisecond=323 ) properties seen :0
[2024-05-21 05:55:30] [INFO ] Flow matrix only has 324 transitions (discarded 8 similar events)
// Phase 1: matrix 324 rows 164 cols
[2024-05-21 05:55:30] [INFO ] Computed 1 invariants in 2 ms
[2024-05-21 05:55:30] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/330 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/481 variables, 95/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/488 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/330 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 151/481 variables, 95/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/488 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/488 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 456 ms.
Support contains 53 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/164 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-21 05:55:31] [INFO ] Flow matrix only has 324 transitions (discarded 8 similar events)
[2024-05-21 05:55:31] [INFO ] Invariant cache hit.
[2024-05-21 05:55:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 05:55:31] [INFO ] Flow matrix only has 324 transitions (discarded 8 similar events)
[2024-05-21 05:55:31] [INFO ] Invariant cache hit.
[2024-05-21 05:55:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:55:31] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [110, 158]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 162/164 places, 330/332 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 161 transition count 338
Applied a total of 2 rules in 11 ms. Remains 161 /162 variables (removed 1) and now considering 338/330 (removed -8) transitions.
[2024-05-21 05:55:31] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
// Phase 1: matrix 329 rows 161 cols
[2024-05-21 05:55:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 05:55:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 05:55:31] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2024-05-21 05:55:31] [INFO ] Invariant cache hit.
[2024-05-21 05:55:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 05:55:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 161/164 places, 338/332 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 429 ms. Remains : 161/164 places, 338/332 transitions.
RANDOM walk for 40000 steps (117 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1034883 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 3
Probabilistic random walk after 1034883 steps, saw 192621 distinct states, run finished after 3002 ms. (steps per millisecond=344 ) properties seen :0
[2024-05-21 05:55:35] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2024-05-21 05:55:35] [INFO ] Invariant cache hit.
[2024-05-21 05:55:35] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/330 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 157/487 variables, 95/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/490 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/490 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/330 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 157/487 variables, 95/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/490 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 383 ms.
Support contains 53 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 338/338 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 161/161 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 338/338 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-05-21 05:55:35] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2024-05-21 05:55:35] [INFO ] Invariant cache hit.
[2024-05-21 05:55:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 05:55:36] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2024-05-21 05:55:36] [INFO ] Invariant cache hit.
[2024-05-21 05:55:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 05:55:36] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 05:55:36] [INFO ] Redundant transitions in 20 ms returned []
Running 334 sub problems to find dead transitions.
[2024-05-21 05:55:36] [INFO ] Flow matrix only has 329 transitions (discarded 9 similar events)
[2024-05-21 05:55:36] [INFO ] Invariant cache hit.
[2024-05-21 05:55:36] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 329/489 variables, 160/161 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 8/169 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-21 05:55:41] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/490 variables, 1/171 constraints. Problems are: Problem set: 8 solved, 326 unsolved
[2024-05-21 05:55:47] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-21 05:55:48] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 2/173 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 173 constraints, problems are : Problem set: 8 solved, 326 unsolved in 18955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 8 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 2/3 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 329/489 variables, 160/163 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 8/171 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 326/497 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/497 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 1/490 variables, 1/498 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/499 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/499 constraints. Problems are: Problem set: 8 solved, 326 unsolved
At refinement iteration 10 (OVERLAPS) 0/490 variables, 0/499 constraints. Problems are: Problem set: 8 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 499 constraints, problems are : Problem set: 8 solved, 326 unsolved in 19115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 326/334 constraints, Known Traps: 3/3 constraints]
After SMT, in 38412ms problems are : Problem set: 8 solved, 326 unsolved
Search for dead transitions found 8 dead transitions in 38418ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/161 places, 330/338 transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 8 places and 38 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 292
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 13 ms. Remains 153 /161 variables (removed 8) and now considering 292/330 (removed 38) transitions.
[2024-05-21 05:56:14] [INFO ] Flow matrix only has 287 transitions (discarded 5 similar events)
// Phase 1: matrix 287 rows 153 cols
[2024-05-21 05:56:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 05:56:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 05:56:14] [INFO ] Flow matrix only has 287 transitions (discarded 5 similar events)
[2024-05-21 05:56:14] [INFO ] Invariant cache hit.
[2024-05-21 05:56:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:56:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 153/161 places, 292/338 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38909 ms. Remains : 153/161 places, 292/338 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
RANDOM walk for 40000 steps (109 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (17 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1155974 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :0 out of 3
Probabilistic random walk after 1155974 steps, saw 211797 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
[2024-05-21 05:56:18] [INFO ] Flow matrix only has 287 transitions (discarded 5 similar events)
// Phase 1: matrix 287 rows 149 cols
[2024-05-21 05:56:18] [INFO ] Computed 1 invariants in 10 ms
[2024-05-21 05:56:18] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 12/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 200/248 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 170/418 variables, 86/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 17/435 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/436 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/436 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem CloudReconfiguration-PT-315-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 12/48 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 200/248 variables, 48/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 170/418 variables, 86/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 5/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem CloudReconfiguration-PT-315-ReachabilityCardinality-2024-07 is UNSAT
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 17/435 variables, 14/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/436 variables, 1/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/436 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 157 constraints, problems are : Problem set: 2 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 292/292 transitions.
Graph (trivial) has 137 edges and 149 vertex of which 32 / 149 are part of one of the 14 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 131 transition count 234
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 107 transition count 231
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 52 place count 107 transition count 224
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 100 transition count 224
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 90 transition count 211
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 90 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 90 transition count 210
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Discarding 13 places :
Also discarding 35 output transitions
Drop transitions (Output transitions of discarded places.) removed 35 transitions
Remove reverse transitions (loop back) rule discarded transition t2182.t2183.t2184.t2185.t2186.t2187.t2188.t2189.t3029.t1838.t1916.t2630.t2631.t2632.t2648.t2649.t2650.t2651.t2652.t2653.t2654.t2655.t2656.t2733.t2734.t2735.t2756.t2757.t2744.t2745.t2656.t2657.t2658.t2659.t2660.t2731.t2732.t2667.t2668.t2704.t2705.t2675.t2676.t2677.t2181 and 13 places that fell out of Prefix Of Interest.
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 63 transition count 162
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2182.t2183.t2184.t2185.t2186.t2187.t2188.t2189.t3080.t511.t500.t501.t495.t496.t497.t2630.t2631.t2632.t2648.t2649.t2650.t2651.t2652.t2653.t2654.t2655.t2656.t2733.t2734.t2735.t2756.t2757.t2744.t2745.t2656.t2657.t2658.t2659.t2660.t2731.t2732.t2667.t2668.t2704.t2705.t2675.t2676.t2677.t2181 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (trivial) has 91 edges and 62 vertex of which 42 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 32 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 32 rules applied. Total rules applied 133 place count 30 transition count 131
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 81 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 86 rules applied. Total rules applied 219 place count 28 transition count 47
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 224 place count 25 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 224 place count 25 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 24 transition count 44
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 234 place count 20 transition count 39
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 239 place count 20 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 245 place count 17 transition count 36
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 253 place count 17 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 254 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 255 place count 17 transition count 27
Applied a total of 255 rules in 11 ms. Remains 17 /149 variables (removed 132) and now considering 27/292 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 17/149 places, 27/292 transitions.
RANDOM walk for 40000 steps (17 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (10 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 262 steps, run visited all 1 properties in 3 ms. (steps per millisecond=87 )
Probabilistic random walk after 262 steps, saw 88 distinct states, run finished after 7 ms. (steps per millisecond=37 ) properties seen :1
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 67211 ms.
ITS solved all properties within timeout

BK_STOP 1716270978638

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="CloudReconfiguration-PT-315"
export BK_EXAMINATION="ReachabilityCardinality"
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 CloudReconfiguration-PT-315, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187300230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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