About the Execution of LTSMin+red for CloudReconfiguration-PT-308
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
881.688 | 93550.00 | 130961.00 | 228.00 | FTTF??TFTTF??FTT | 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-171624188700175.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-308, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188700175
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 19:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 19:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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-308-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-308-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717180630801
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-308
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:37:12] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-31 18:37:12] [INFO ] Transformed 2585 places.
[2024-05-31 18:37:12] [INFO ] Transformed 3095 transitions.
[2024-05-31 18:37:12] [INFO ] Found NUPN structural information;
[2024-05-31 18:37:12] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (286 resets) in 1448 ms. (27 steps per ms) remains 14/16 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (74 resets) in 483 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 214 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (79 resets) in 1147 ms. (34 steps per ms) remains 13/14 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (78 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (81 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 124 ms. (320 steps per ms) remains 12/13 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (73 resets) in 140 ms. (283 steps per ms) remains 11/12 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (34 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (82 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (74 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (75 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (80 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-31 18:37:14] [INFO ] Computed 4 invariants in 50 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2401/2575 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2575 variables, 2401/2579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2575 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3087/5662 variables, 2575/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5662 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 6/5668 variables, 3/5157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5668 variables, 3/5160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5668/5680 variables, and 5160 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5060 ms.
Refiners :[Domain max(s): 2578/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2578/2585 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2401/2575 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2575 variables, 2401/2579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2575 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3087/5662 variables, 2575/5154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5662 variables, 10/5164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5662/5680 variables, and 5164 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5020 ms.
Refiners :[Domain max(s): 2575/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2575/2585 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 10360ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2519 edges and 2585 vertex of which 391 / 2585 are part of one of the 44 SCC in 12 ms
Free SCC test removed 347 places
Drop transitions (Empty/Sink Transition effects.) removed 426 transitions
Reduce isomorphic transitions removed 426 transitions.
Graph (complete) has 2949 edges and 2238 vertex of which 2227 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1178 transitions
Trivial Post-agglo rules discarded 1178 transitions
Performed 1178 trivial Post agglomeration. Transition count delta: 1178
Iterating post reduction 0 with 1181 rules applied. Total rules applied 1183 place count 2227 transition count 1482
Reduce places removed 1178 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 1257 rules applied. Total rules applied 2440 place count 1049 transition count 1403
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Iterating post reduction 2 with 175 rules applied. Total rules applied 2615 place count 1020 transition count 1257
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 3 with 175 rules applied. Total rules applied 2790 place count 876 transition count 1226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2796 place count 870 transition count 1226
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 2796 place count 870 transition count 1189
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 2870 place count 833 transition count 1189
Discarding 96 places :
Symmetric choice reduction at 5 with 96 rule applications. Total rules 2966 place count 737 transition count 1093
Iterating global reduction 5 with 96 rules applied. Total rules applied 3062 place count 737 transition count 1093
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 3066 place count 737 transition count 1089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3067 place count 736 transition count 1089
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 3067 place count 736 transition count 1083
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 3079 place count 730 transition count 1083
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 3130 place count 679 transition count 1032
Iterating global reduction 7 with 51 rules applied. Total rules applied 3181 place count 679 transition count 1032
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 7 with 19 rules applied. Total rules applied 3200 place count 679 transition count 1013
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 14 rules applied. Total rules applied 3214 place count 671 transition count 1007
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 5 rules applied. Total rules applied 3219 place count 668 transition count 1005
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3221 place count 666 transition count 1005
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3227 place count 660 transition count 995
Iterating global reduction 11 with 6 rules applied. Total rules applied 3233 place count 660 transition count 995
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3235 place count 658 transition count 991
Iterating global reduction 11 with 2 rules applied. Total rules applied 3237 place count 658 transition count 991
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3239 place count 656 transition count 987
Iterating global reduction 11 with 2 rules applied. Total rules applied 3241 place count 656 transition count 987
Performed 181 Post agglomeration using F-continuation condition with reduction of 51 identical transitions.
Deduced a syphon composed of 181 places in 1 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 11 with 362 rules applied. Total rules applied 3603 place count 475 transition count 755
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 3615 place count 475 transition count 743
Performed 67 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 12 with 134 rules applied. Total rules applied 3749 place count 408 transition count 777
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 12 with 34 rules applied. Total rules applied 3783 place count 408 transition count 743
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 3791 place count 400 transition count 727
Iterating global reduction 13 with 8 rules applied. Total rules applied 3799 place count 400 transition count 727
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 13 with 47 rules applied. Total rules applied 3846 place count 400 transition count 680
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 3847 place count 399 transition count 679
Iterating global reduction 13 with 1 rules applied. Total rules applied 3848 place count 399 transition count 679
Free-agglomeration rule applied 19 times.
Iterating global reduction 13 with 19 rules applied. Total rules applied 3867 place count 399 transition count 660
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 3886 place count 380 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 3889 place count 380 transition count 657
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 14 with 24 rules applied. Total rules applied 3913 place count 380 transition count 657
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 3916 place count 380 transition count 654
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 3917 place count 380 transition count 654
Applied a total of 3917 rules in 744 ms. Remains 380 /2585 variables (removed 2205) and now considering 654/3095 (removed 2441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 755 ms. Remains : 380/2585 places, 654/3095 transitions.
RANDOM walk for 40000 steps (1292 resets) in 507 ms. (78 steps per ms) remains 9/11 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (305 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (320 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (323 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (316 resets) in 81 ms. (487 steps per ms) remains 8/9 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (325 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (162 resets) in 36 ms. (1081 steps per ms) remains 7/8 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (248 resets) in 154 ms. (258 steps per ms) remains 6/7 properties
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (317 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
[2024-05-31 18:37:25] [INFO ] Flow matrix only has 649 transitions (discarded 5 similar events)
// Phase 1: matrix 649 rows 380 cols
[2024-05-31 18:37:25] [INFO ] Computed 1 invariants in 5 ms
[2024-05-31 18:37:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 61/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 627/856 variables, 229/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 169/1025 variables, 147/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/1029 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1029 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 385 constraints, problems are : Problem set: 0 solved, 6 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 380/380 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 61/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 627/856 variables, 229/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 169/1025 variables, 147/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/1029 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1029 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 391 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 380/380 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3158ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2139 ms.
Support contains 167 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 654/654 transitions.
Graph (trivial) has 20 edges and 380 vertex of which 2 / 380 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 3 place count 379 transition count 650
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 377 transition count 648
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 375 transition count 648
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 3 with 6 rules applied. Total rules applied 15 place count 372 transition count 645
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 372 transition count 641
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 372 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 25 place count 369 transition count 638
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 369 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 369 transition count 637
Applied a total of 27 rules in 117 ms. Remains 369 /380 variables (removed 11) and now considering 637/654 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 369/380 places, 637/654 transitions.
RANDOM walk for 40000 steps (1292 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (205 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (316 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (312 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (279 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (328 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 585676 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 5
Probabilistic random walk after 585676 steps, saw 123592 distinct states, run finished after 3007 ms. (steps per millisecond=194 ) properties seen :0
[2024-05-31 18:37:34] [INFO ] Flow matrix only has 631 transitions (discarded 6 similar events)
// Phase 1: matrix 631 rows 369 cols
[2024-05-31 18:37:34] [INFO ] Computed 1 invariants in 4 ms
[2024-05-31 18:37:34] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 620/845 variables, 225/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/845 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 154/999 variables, 143/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1000 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1000 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 374 constraints, problems are : Problem set: 0 solved, 5 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 58/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 620/845 variables, 225/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/845 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/845 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 154/999 variables, 143/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/1000 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1000 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 379 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2517ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA CloudReconfiguration-PT-308-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 876 ms.
Support contains 120 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 637/637 transitions.
Graph (trivial) has 143 edges and 369 vertex of which 22 / 369 are part of one of the 10 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 357 transition count 598
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 25 rules applied. Total rules applied 40 place count 343 transition count 587
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 50 place count 333 transition count 587
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 50 place count 333 transition count 576
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 72 place count 322 transition count 576
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 319 transition count 571
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 319 transition count 571
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 108 place count 304 transition count 555
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 115 place count 304 transition count 548
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 302 transition count 546
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 302 transition count 546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 302 transition count 544
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 137 place count 294 transition count 560
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 143 place count 294 transition count 554
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 145 place count 292 transition count 550
Iterating global reduction 6 with 2 rules applied. Total rules applied 147 place count 292 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 155 place count 292 transition count 542
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 162 place count 292 transition count 535
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 169 place count 285 transition count 535
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 285 transition count 534
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 188 place count 285 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 189 place count 285 transition count 533
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 190 place count 285 transition count 532
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 191 place count 285 transition count 532
Applied a total of 191 rules in 106 ms. Remains 285 /369 variables (removed 84) and now considering 532/637 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 285/369 places, 532/637 transitions.
RANDOM walk for 40000 steps (1495 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (361 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (358 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (301 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (358 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 778785 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 4
Probabilistic random walk after 778785 steps, saw 159156 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-05-31 18:37:41] [INFO ] Flow matrix only has 523 transitions (discarded 9 similar events)
// Phase 1: matrix 523 rows 285 cols
[2024-05-31 18:37:41] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 18:37:41] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 505/679 variables, 174/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 128/807 variables, 110/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/808 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/808 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/808 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 290 constraints, problems are : Problem set: 0 solved, 4 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 285/285 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 505/679 variables, 174/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/679 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 128/807 variables, 110/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/807 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/807 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/808 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/808 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/808 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 294 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 285/285 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1753ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 448 ms.
Support contains 120 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 532/532 transitions.
Applied a total of 0 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 285/285 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 532/532 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2024-05-31 18:37:43] [INFO ] Flow matrix only has 523 transitions (discarded 9 similar events)
[2024-05-31 18:37:43] [INFO ] Invariant cache hit.
[2024-05-31 18:37:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 18:37:43] [INFO ] Flow matrix only has 523 transitions (discarded 9 similar events)
[2024-05-31 18:37:43] [INFO ] Invariant cache hit.
[2024-05-31 18:37:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:37:43] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-31 18:37:43] [INFO ] Redundant transitions in 27 ms returned []
Running 531 sub problems to find dead transitions.
[2024-05-31 18:37:43] [INFO ] Flow matrix only has 523 transitions (discarded 9 similar events)
[2024-05-31 18:37:43] [INFO ] Invariant cache hit.
[2024-05-31 18:37:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 523/808 variables, 285/286 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 531 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 290 constraints, problems are : Problem set: 0 solved, 531 unsolved in 28533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 285/285 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 523/808 variables, 285/286 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 531/821 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-05-31 18:38:34] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 14 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/808 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 808/808 variables, and 822 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 285/285 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 1/1 constraints]
After SMT, in 58844ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 58851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59169 ms. Remains : 285/285 places, 532/532 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 285 transition count 523
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 282 transition count 520
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 282 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 282 transition count 519
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 282 transition count 518
Applied a total of 17 rules in 21 ms. Remains 282 /285 variables (removed 3) and now considering 518/532 (removed 14) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 518 rows 282 cols
[2024-05-31 18:38:42] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 18:38:42] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 18:38:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 18:38:43] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 18:38:43] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 18:38:43] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1063 ms.
[2024-05-31 18:38:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 18:38:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 285 places, 532 transitions and 1343 arcs took 7 ms.
[2024-05-31 18:38:44] [INFO ] Flatten gal took : 68 ms
Total runtime 91972 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : CloudReconfiguration-PT-308-ReachabilityFireability-2024-04
Could not compute solution for formula : CloudReconfiguration-PT-308-ReachabilityFireability-2024-05
Could not compute solution for formula : CloudReconfiguration-PT-308-ReachabilityFireability-2024-11
Could not compute solution for formula : CloudReconfiguration-PT-308-ReachabilityFireability-2024-12
BK_STOP 1717180724351
--------------------
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
mcc2024
rfs formula name CloudReconfiguration-PT-308-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/570/inv_0_
rfs formula name CloudReconfiguration-PT-308-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/570/inv_1_
rfs formula name CloudReconfiguration-PT-308-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/570/inv_2_
rfs formula name CloudReconfiguration-PT-308-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/570/inv_3_
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-308"
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-308, 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-171624188700175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-308.tgz
mv CloudReconfiguration-PT-308 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 ;