fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624188800231
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CloudReconfiguration-PT-315

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
732.960 93251.00 128406.00 269.70 ?FTTTTTFFFTTT?FF normal

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.r480-tall-171624188800231.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudReconfiguration-PT-315, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188800231
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-315-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717184115889

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:35:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:35:17] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-31 19:35:17] [INFO ] Transformed 2585 places.
[2024-05-31 19:35:17] [INFO ] Transformed 3095 transitions.
[2024-05-31 19:35:17] [INFO ] Found NUPN structural information;
[2024-05-31 19:35:17] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (317 resets) in 1212 ms. (32 steps per ms) remains 10/16 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (100 resets) in 638 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (100 resets) in 340 ms. (117 steps per ms) remains 9/10 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (89 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (90 resets) in 175 ms. (227 steps per ms) remains 8/9 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (43 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (94 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (87 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (93 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (97 resets) in 561 ms. (71 steps per ms) remains 8/8 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-31 19:35:19] [INFO ] Computed 4 invariants in 76 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2459/2575 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2575 variables, 2459/2579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2575 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 3087/5662 variables, 2575/5154 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5662 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 3/5665 variables, 2/5156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5665 variables, 2/5158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5665 variables, 0/5158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/5667 variables, 1/5159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5667 variables, 1/5160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5667 variables, 0/5160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/5669 variables, 1/5161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5669 variables, 1/5162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5669 variables, 0/5162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 5299ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2654 edges and 2585 vertex of which 495 / 2585 are part of one of the 48 SCC in 11 ms
Free SCC test removed 447 places
Drop transitions (Empty/Sink Transition effects.) removed 544 transitions
Reduce isomorphic transitions removed 544 transitions.
Graph (complete) has 2831 edges and 2138 vertex of which 2124 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1205 transitions
Trivial Post-agglo rules discarded 1205 transitions
Performed 1205 trivial Post agglomeration. Transition count delta: 1205
Iterating post reduction 0 with 1213 rules applied. Total rules applied 1215 place count 2124 transition count 1329
Reduce places removed 1205 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 1305 rules applied. Total rules applied 2520 place count 919 transition count 1229
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 41 rules applied. Total rules applied 2561 place count 883 transition count 1224
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 2564 place count 882 transition count 1222
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 2568 place count 881 transition count 1219
Reduce places removed 2 places and 0 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 5 with 117 rules applied. Total rules applied 2685 place count 879 transition count 1104
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 130 rules applied. Total rules applied 2815 place count 764 transition count 1089
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2818 place count 761 transition count 1089
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 41 Pre rules applied. Total rules applied 2818 place count 761 transition count 1048
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 2900 place count 720 transition count 1048
Discarding 94 places :
Symmetric choice reduction at 8 with 94 rule applications. Total rules 2994 place count 626 transition count 954
Iterating global reduction 8 with 94 rules applied. Total rules applied 3088 place count 626 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 3092 place count 626 transition count 950
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3094 place count 625 transition count 949
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 3094 place count 625 transition count 941
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 3110 place count 617 transition count 941
Discarding 56 places :
Symmetric choice reduction at 10 with 56 rule applications. Total rules 3166 place count 561 transition count 885
Iterating global reduction 10 with 56 rules applied. Total rules applied 3222 place count 561 transition count 885
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 10 with 28 rules applied. Total rules applied 3250 place count 561 transition count 857
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 11 with 17 rules applied. Total rules applied 3267 place count 548 transition count 853
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 3 rules applied. Total rules applied 3270 place count 546 transition count 852
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3271 place count 545 transition count 852
Discarding 15 places :
Symmetric choice reduction at 14 with 15 rule applications. Total rules 3286 place count 530 transition count 827
Iterating global reduction 14 with 15 rules applied. Total rules applied 3301 place count 530 transition count 827
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3305 place count 530 transition count 823
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3310 place count 525 transition count 813
Iterating global reduction 15 with 5 rules applied. Total rules applied 3315 place count 525 transition count 813
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 3318 place count 522 transition count 807
Iterating global reduction 15 with 3 rules applied. Total rules applied 3321 place count 522 transition count 807
Performed 165 Post agglomeration using F-continuation condition with reduction of 57 identical transitions.
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 15 with 330 rules applied. Total rules applied 3651 place count 357 transition count 585
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3657 place count 357 transition count 579
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 3663 place count 354 transition count 576
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 3669 place count 354 transition count 570
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 17 with 2 rules applied. Total rules applied 3671 place count 353 transition count 569
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3673 place count 353 transition count 567
Performed 52 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 18 with 104 rules applied. Total rules applied 3777 place count 301 transition count 608
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 18 with 32 rules applied. Total rules applied 3809 place count 301 transition count 576
Discarding 10 places :
Symmetric choice reduction at 19 with 10 rule applications. Total rules 3819 place count 291 transition count 555
Iterating global reduction 19 with 10 rules applied. Total rules applied 3829 place count 291 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3830 place count 291 transition count 554
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 20 with 30 rules applied. Total rules applied 3860 place count 291 transition count 524
Free-agglomeration rule applied 14 times.
Iterating global reduction 20 with 14 rules applied. Total rules applied 3874 place count 291 transition count 510
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 20 with 14 rules applied. Total rules applied 3888 place count 277 transition count 510
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3889 place count 277 transition count 509
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 21 with 17 rules applied. Total rules applied 3906 place count 277 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 3909 place count 277 transition count 506
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3910 place count 277 transition count 506
Applied a total of 3910 rules in 484 ms. Remains 277 /2585 variables (removed 2308) and now considering 506/3095 (removed 2589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 277/2585 places, 506/3095 transitions.
RANDOM walk for 40000 steps (1811 resets) in 849 ms. (47 steps per ms) remains 3/8 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (463 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (386 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (445 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
[2024-05-31 19:35:25] [INFO ] Flow matrix only has 500 transitions (discarded 6 similar events)
// Phase 1: matrix 500 rows 277 cols
[2024-05-31 19:35:25] [INFO ] Computed 3 invariants in 7 ms
[2024-05-31 19:35:25] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 149/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 462/692 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 69/761 variables, 33/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/776 variables, 13/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/776 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem CloudReconfiguration-PT-315-ReachabilityFireability-2024-07 is UNSAT
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 1/777 variables, 1/285 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/777 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 285 constraints, problems are : Problem set: 1 solved, 2 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 277/277 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/229 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 460/689 variables, 229/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 3/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 71/760 variables, 33/268 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 2/270 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 2/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/776 variables, 14/286 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/776 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/777 variables, 1/287 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/777 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/777 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 287 constraints, problems are : Problem set: 1 solved, 2 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 277/277 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1293ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 80 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 506/506 transitions.
Graph (trivial) has 112 edges and 277 vertex of which 26 / 277 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 264 transition count 467
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 20 rules applied. Total rules applied 34 place count 251 transition count 460
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 245 transition count 460
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 40 place count 245 transition count 452
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 56 place count 237 transition count 452
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 236 transition count 450
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 236 transition count 450
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 235 transition count 448
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 235 transition count 448
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 80 place count 225 transition count 436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 225 transition count 434
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 100 place count 216 transition count 435
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 113 place count 216 transition count 422
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 118 place count 211 transition count 412
Iterating global reduction 5 with 5 rules applied. Total rules applied 123 place count 211 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 134 place count 211 transition count 401
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 209 transition count 398
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 209 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 209 transition count 397
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 143 place count 209 transition count 393
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 148 place count 205 transition count 392
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 150 place count 205 transition count 392
Applied a total of 150 rules in 75 ms. Remains 205 /277 variables (removed 72) and now considering 392/506 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 205/277 places, 392/506 transitions.
RANDOM walk for 40000 steps (2205 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (482 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (514 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 985549 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 2
Probabilistic random walk after 985549 steps, saw 212849 distinct states, run finished after 3009 ms. (steps per millisecond=327 ) properties seen :0
[2024-05-31 19:35:30] [INFO ] Flow matrix only has 387 transitions (discarded 5 similar events)
// Phase 1: matrix 387 rows 205 cols
[2024-05-31 19:35:30] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 19:35:30] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/180 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 384/564 variables, 180/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/592 variables, 25/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/592 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/180 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 384/564 variables, 180/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/592 variables, 25/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/592 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 253 ms.
Support contains 80 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 392/392 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 205/205 places, 392/392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 392/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2024-05-31 19:35:31] [INFO ] Flow matrix only has 387 transitions (discarded 5 similar events)
[2024-05-31 19:35:31] [INFO ] Invariant cache hit.
[2024-05-31 19:35:31] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 19:35:31] [INFO ] Flow matrix only has 387 transitions (discarded 5 similar events)
[2024-05-31 19:35:31] [INFO ] Invariant cache hit.
[2024-05-31 19:35:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 19:35:31] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [140, 199]
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 238 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/205 places, 390/392 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 201 transition count 396
Applied a total of 4 rules in 18 ms. Remains 201 /203 variables (removed 2) and now considering 396/390 (removed -6) transitions.
[2024-05-31 19:35:31] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
// Phase 1: matrix 389 rows 201 cols
[2024-05-31 19:35:31] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 19:35:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 19:35:31] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-31 19:35:31] [INFO ] Invariant cache hit.
[2024-05-31 19:35:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:35:31] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 201/205 places, 396/392 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 478 ms. Remains : 201/205 places, 396/392 transitions.
RANDOM walk for 40000 steps (2019 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (444 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (449 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 976743 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 2
Probabilistic random walk after 976743 steps, saw 204799 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
[2024-05-31 19:35:34] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-31 19:35:34] [INFO ] Invariant cache hit.
[2024-05-31 19:35:34] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/180 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 387/567 variables, 180/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 23/590 variables, 21/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/590 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 201/201 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/180 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 387/567 variables, 180/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 23/590 variables, 21/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/590 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 201/201 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 80 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 396/396 transitions.
Applied a total of 0 rules in 6 ms. Remains 201 /201 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 201/201 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 396/396 transitions.
Applied a total of 0 rules in 6 ms. Remains 201 /201 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-05-31 19:35:35] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-31 19:35:35] [INFO ] Invariant cache hit.
[2024-05-31 19:35:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 19:35:35] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-31 19:35:35] [INFO ] Invariant cache hit.
[2024-05-31 19:35:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:35:35] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 19:35:35] [INFO ] Redundant transitions in 42 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 19:35:35] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-31 19:35:35] [INFO ] Invariant cache hit.
[2024-05-31 19:35:35] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
At refinement iteration 1 (OVERLAPS) 1/201 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 391 unsolved
[2024-05-31 19:35:39] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 12 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 389/590 variables, 201/205 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 7/212 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/212 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 7 (OVERLAPS) 0/590 variables, 0/212 constraints. Problems are: Problem set: 8 solved, 387 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 212 constraints, problems are : Problem set: 8 solved, 387 unsolved in 15949 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 201/201 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 3/201 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 4 (OVERLAPS) 389/590 variables, 201/205 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 7/212 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 387/599 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/599 constraints. Problems are: Problem set: 8 solved, 387 unsolved
At refinement iteration 8 (OVERLAPS) 0/590 variables, 0/599 constraints. Problems are: Problem set: 8 solved, 387 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 599 constraints, problems are : Problem set: 8 solved, 387 unsolved in 18545 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 201/201 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 387/395 constraints, Known Traps: 1/1 constraints]
After SMT, in 34741ms problems are : Problem set: 8 solved, 387 unsolved
Search for dead transitions found 8 dead transitions in 34751ms
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 : 201/201 places, 388/396 transitions.
Graph (complete) has 527 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 199 /201 variables (removed 2) and now considering 388/388 (removed 0) transitions.
[2024-05-31 19:36:10] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
// Phase 1: matrix 383 rows 199 cols
[2024-05-31 19:36:10] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 19:36:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 19:36:10] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-31 19:36:10] [INFO ] Invariant cache hit.
[2024-05-31 19:36:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 19:36:10] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 199/201 places, 388/396 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35272 ms. Remains : 199/201 places, 388/396 transitions.
RANDOM walk for 40000 steps (2023 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (415 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (460 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1033392 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 2
Probabilistic random walk after 1033392 steps, saw 215178 distinct states, run finished after 3002 ms. (steps per millisecond=344 ) properties seen :0
[2024-05-31 19:36:13] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-31 19:36:13] [INFO ] Invariant cache hit.
[2024-05-31 19:36:13] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 381/559 variables, 178/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 23/582 variables, 21/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/582 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 381/559 variables, 178/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 23/582 variables, 21/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/582 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 80 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 388/388 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 199/199 places, 388/388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 388/388 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-05-31 19:36:14] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-31 19:36:14] [INFO ] Invariant cache hit.
[2024-05-31 19:36:14] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 19:36:14] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-31 19:36:14] [INFO ] Invariant cache hit.
[2024-05-31 19:36:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 19:36:15] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-31 19:36:15] [INFO ] Redundant transitions in 22 ms returned []
Running 387 sub problems to find dead transitions.
[2024-05-31 19:36:15] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-31 19:36:15] [INFO ] Invariant cache hit.
[2024-05-31 19:36:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 383/582 variables, 199/202 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 387 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 208 constraints, problems are : Problem set: 0 solved, 387 unsolved in 14843 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 383/582 variables, 199/202 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 387/595 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 387 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 595 constraints, problems are : Problem set: 0 solved, 387 unsolved in 17809 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
After SMT, in 32838ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 32842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33095 ms. Remains : 199/199 places, 388/388 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 199 transition count 383
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 196 transition count 380
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 196 transition count 380
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 196 transition count 375
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 196 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 196 transition count 374
Applied a total of 19 rules in 31 ms. Remains 196 /199 variables (removed 3) and now considering 374/388 (removed 14) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 374 rows 196 cols
[2024-05-31 19:36:47] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 19:36:48] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 19:36:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 19:36:48] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 19:36:48] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 19:36:48] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 599 ms.
[2024-05-31 19:36:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 19:36:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 388 transitions and 1071 arcs took 4 ms.
[2024-05-31 19:36:48] [INFO ] Flatten gal took : 65 ms
Total runtime 91568 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CloudReconfiguration-PT-315-ReachabilityFireability-2024-00
Could not compute solution for formula : CloudReconfiguration-PT-315-ReachabilityFireability-2024-13

BK_STOP 1717184209140

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name CloudReconfiguration-PT-315-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/607/inv_0_
rfs formula name CloudReconfiguration-PT-315-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/607/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-315, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624188800231"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;