About the Execution of GreatSPN+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 |
724.191 | 113204.00 | 151842.00 | 353.40 | FFTTTTTFFFTTTTFF | 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.r091-tall-171624187300231.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187300231
=====================================================================
--------------------
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 1716270952115
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:55:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 05:55:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:55:53] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-21 05:55:53] [INFO ] Transformed 2585 places.
[2024-05-21 05:55:53] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:55:53] [INFO ] Found NUPN structural information;
[2024-05-21 05:55:53] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (320 resets) in 1329 ms. (30 steps per ms) remains 11/16 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-14 FALSE 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 40002 steps (95 resets) in 362 ms. (110 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (95 resets) in 143 ms. (277 steps per ms) remains 10/11 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (102 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (92 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (44 resets) in 97 ms. (408 steps per ms) remains 8/10 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (95 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (91 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (92 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (99 resets) in 531 ms. (75 steps per ms) remains 8/8 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-21 05:55:54] [INFO ] Computed 4 invariants in 49 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
At refinement iteration 16 (OVERLAPS) 2/5671 variables, 1/5163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5671 variables, 1/5164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5671/5680 variables, and 5164 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5052 ms.
Refiners :[Domain max(s): 2580/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2580/2585 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
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, 7/5161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5662 variables, 0/5161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 3/5665 variables, 2/5163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5665 variables, 2/5165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5665 variables, 1/5166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5665/5680 variables, and 5166 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5016 ms.
Refiners :[Domain max(s): 2577/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2577/2585 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 10268ms 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 2652 edges and 2585 vertex of which 495 / 2585 are part of one of the 48 SCC in 12 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 1203 transitions
Trivial Post-agglo rules discarded 1203 transitions
Performed 1203 trivial Post agglomeration. Transition count delta: 1203
Iterating post reduction 0 with 1211 rules applied. Total rules applied 1213 place count 2124 transition count 1331
Reduce places removed 1203 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 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 1302 rules applied. Total rules applied 2515 place count 921 transition count 1232
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 2556 place count 885 transition count 1227
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 2559 place count 884 transition count 1225
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 2563 place count 883 transition count 1222
Reduce places removed 2 places and 0 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Iterating post reduction 5 with 121 rules applied. Total rules applied 2684 place count 881 transition count 1103
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 135 rules applied. Total rules applied 2819 place count 762 transition count 1087
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2822 place count 759 transition count 1087
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 41 Pre rules applied. Total rules applied 2822 place count 759 transition count 1046
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 2904 place count 718 transition count 1046
Discarding 94 places :
Symmetric choice reduction at 8 with 94 rule applications. Total rules 2998 place count 624 transition count 952
Iterating global reduction 8 with 94 rules applied. Total rules applied 3092 place count 624 transition count 952
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 3096 place count 624 transition count 948
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 3098 place count 623 transition count 947
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 3098 place count 623 transition count 939
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 3114 place count 615 transition count 939
Discarding 56 places :
Symmetric choice reduction at 10 with 56 rule applications. Total rules 3170 place count 559 transition count 883
Iterating global reduction 10 with 56 rules applied. Total rules applied 3226 place count 559 transition count 883
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 3254 place count 559 transition count 855
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 3271 place count 546 transition count 851
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 3274 place count 544 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3275 place count 543 transition count 850
Discarding 14 places :
Symmetric choice reduction at 14 with 14 rule applications. Total rules 3289 place count 529 transition count 827
Iterating global reduction 14 with 14 rules applied. Total rules applied 3303 place count 529 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 3307 place count 529 transition count 823
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3312 place count 524 transition count 813
Iterating global reduction 15 with 5 rules applied. Total rules applied 3317 place count 524 transition count 813
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 3319 place count 522 transition count 809
Iterating global reduction 15 with 2 rules applied. Total rules applied 3321 place count 522 transition count 809
Performed 166 Post agglomeration using F-continuation condition with reduction of 58 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 15 with 332 rules applied. Total rules applied 3653 place count 356 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 3659 place count 356 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 3663 place count 354 transition count 577
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3667 place count 354 transition count 573
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 3669 place count 353 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3671 place count 353 transition count 570
Performed 52 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 18 with 104 rules applied. Total rules applied 3775 place count 301 transition count 611
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 18 with 32 rules applied. Total rules applied 3807 place count 301 transition count 579
Discarding 10 places :
Symmetric choice reduction at 19 with 10 rule applications. Total rules 3817 place count 291 transition count 558
Iterating global reduction 19 with 10 rules applied. Total rules applied 3827 place count 291 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3828 place count 291 transition count 557
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 20 with 32 rules applied. Total rules applied 3860 place count 291 transition count 525
Free-agglomeration rule applied 14 times.
Iterating global reduction 20 with 14 rules applied. Total rules applied 3874 place count 291 transition count 511
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 511
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 510
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 510
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 507
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 507
Applied a total of 3910 rules in 456 ms. Remains 277 /2585 variables (removed 2308) and now considering 507/3095 (removed 2588) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 277/2585 places, 507/3095 transitions.
RANDOM walk for 40000 steps (1777 resets) in 573 ms. (69 steps per ms) remains 4/8 properties
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-12 TRUE 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
BEST_FIRST walk for 40002 steps (446 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (455 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (361 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (458 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
[2024-05-21 05:56:05] [INFO ] Flow matrix only has 501 transitions (discarded 6 similar events)
// Phase 1: matrix 501 rows 277 cols
[2024-05-21 05:56:05] [INFO ] Computed 3 invariants in 5 ms
[2024-05-21 05:56:05] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 465/697 variables, 232/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 66/763 variables, 32/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 14/777 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/777 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 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/778 variables, 1/285 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/778 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/778 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 778/778 variables, and 285 constraints, problems are : Problem set: 1 solved, 3 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 277/277 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/231 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 463/694 variables, 231/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 3/237 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 68/762 variables, 32/270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/762 variables, 2/272 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 2/274 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 15/777 variables, 13/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/778 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/778 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/778 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 778/778 variables, and 288 constraints, problems are : Problem set: 1 solved, 3 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 277/277 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1442ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 384 ms.
Support contains 80 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 507/507 transitions.
Graph (trivial) has 113 edges and 277 vertex of which 26 / 277 are part of one of the 13 SCC in 0 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 264 transition count 469
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 18 rules applied. Total rules applied 31 place count 252 transition count 463
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 36 place count 247 transition count 463
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 36 place count 247 transition count 454
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 54 place count 238 transition count 454
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 236 transition count 450
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 236 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 236 transition count 449
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 235 transition count 447
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 235 transition count 447
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 4 with 20 rules applied. Total rules applied 81 place count 225 transition count 435
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 225 transition count 433
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 5 with 18 rules applied. Total rules applied 101 place count 216 transition count 434
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 114 place count 216 transition count 421
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 119 place count 211 transition count 411
Iterating global reduction 6 with 5 rules applied. Total rules applied 124 place count 211 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 134 place count 211 transition count 401
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 136 place count 209 transition count 398
Iterating global reduction 6 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 6 with 1 rules applied. Total rules applied 139 place count 209 transition count 397
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 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 7 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 8 with 2 rules applied. Total rules applied 150 place count 205 transition count 392
Applied a total of 150 rules in 70 ms. Remains 205 /277 variables (removed 72) and now considering 392/507 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 205/277 places, 392/507 transitions.
RANDOM walk for 40000 steps (2109 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (499 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (535 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1143728 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :0 out of 2
Probabilistic random walk after 1143728 steps, saw 244309 distinct states, run finished after 3004 ms. (steps per millisecond=380 ) properties seen :0
[2024-05-21 05:56:10] [INFO ] Flow matrix only has 387 transitions (discarded 5 similar events)
// Phase 1: matrix 387 rows 205 cols
[2024-05-21 05:56:10] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 05:56:10] [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 195 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
[2024-05-21 05:56:11] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/592 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/592 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 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: 1/1 constraints]
After SMT, in 907ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 119 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 7 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 6 ms. Remains 205 /205 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2024-05-21 05:56:11] [INFO ] Flow matrix only has 387 transitions (discarded 5 similar events)
[2024-05-21 05:56:11] [INFO ] Invariant cache hit.
[2024-05-21 05:56:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 05:56:11] [INFO ] Flow matrix only has 387 transitions (discarded 5 similar events)
[2024-05-21 05:56:11] [INFO ] Invariant cache hit.
[2024-05-21 05:56:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:56:11] [INFO ] Implicit Places using invariants and state equation in 145 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 235 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 0 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 0 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 24 ms. Remains 201 /203 variables (removed 2) and now considering 396/390 (removed -6) transitions.
[2024-05-21 05:56:11] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
// Phase 1: matrix 389 rows 201 cols
[2024-05-21 05:56:11] [INFO ] Computed 3 invariants in 3 ms
[2024-05-21 05:56:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 05:56:12] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-21 05:56:12] [INFO ] Invariant cache hit.
[2024-05-21 05:56:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:56:12] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 190 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 457 ms. Remains : 201/205 places, 396/392 transitions.
RANDOM walk for 40000 steps (2007 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (455 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (453 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1227660 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 2
Probabilistic random walk after 1227660 steps, saw 256291 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-05-21 05:56:15] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-21 05:56:15] [INFO ] Invariant cache hit.
[2024-05-21 05:56:15] [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 201 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 438 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 661ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 102 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 6 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 5 ms. Remains 201 /201 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-05-21 05:56:16] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-21 05:56:16] [INFO ] Invariant cache hit.
[2024-05-21 05:56:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 05:56:16] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-21 05:56:16] [INFO ] Invariant cache hit.
[2024-05-21 05:56:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:56:16] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-21 05:56:16] [INFO ] Redundant transitions in 42 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-21 05:56:16] [INFO ] Flow matrix only has 389 transitions (discarded 7 similar events)
[2024-05-21 05:56:16] [INFO ] Invariant cache hit.
[2024-05-21 05:56:16] [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-21 05:56:20] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 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 15824 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 19171 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 35201ms problems are : Problem set: 8 solved, 387 unsolved
Search for dead transitions found 8 dead transitions in 35207ms
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 11 ms. Remains 199 /201 variables (removed 2) and now considering 388/388 (removed 0) transitions.
[2024-05-21 05:56:51] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
// Phase 1: matrix 383 rows 199 cols
[2024-05-21 05:56:51] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 05:56:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 05:56:51] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-21 05:56:51] [INFO ] Invariant cache hit.
[2024-05-21 05:56:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 05:56:51] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 182 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 35679 ms. Remains : 199/201 places, 388/396 transitions.
RANDOM walk for 40000 steps (2032 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (427 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (454 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1210596 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 2
Probabilistic random walk after 1210596 steps, saw 252262 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2024-05-21 05:56:54] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-21 05:56:54] [INFO ] Invariant cache hit.
[2024-05-21 05:56:54] [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 201 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 438 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 663ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 109 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 5 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 5 ms. Remains 199 /199 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-05-21 05:56:55] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-21 05:56:55] [INFO ] Invariant cache hit.
[2024-05-21 05:56:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 05:56:55] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-21 05:56:55] [INFO ] Invariant cache hit.
[2024-05-21 05:56:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 05:56:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 05:56:55] [INFO ] Redundant transitions in 22 ms returned []
Running 387 sub problems to find dead transitions.
[2024-05-21 05:56:55] [INFO ] Flow matrix only has 383 transitions (discarded 5 similar events)
[2024-05-21 05:56:55] [INFO ] Invariant cache hit.
[2024-05-21 05:56:55] [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 15263 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
[2024-05-21 05:57:18] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 8 (OVERLAPS) 0/582 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 387 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 596 constraints, problems are : Problem set: 0 solved, 387 unsolved in 24603 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: 1/1 constraints]
After SMT, in 40049ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 40054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40264 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 15 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-21 05:57:35] [INFO ] Computed 3 invariants in 17 ms
[2024-05-21 05:57:35] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 05:57:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 05:57:36] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 05:57:36] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 05:57:36] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 513 ms.
[2024-05-21 05:57:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-21 05:57:36] [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-21 05:57:36] [INFO ] Flatten gal took : 54 ms
Total runtime 103451 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CloudReconfiguration-PT-315
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 199
TRANSITIONS: 388
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]
SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 645
MODEL NAME: /home/mcc/execution/406/model
199 places, 388 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-315-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716271065319
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ReachabilityFireability"
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 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 r091-tall-171624187300231"
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 '
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 ;