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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
796.972 17555.00 33112.00 61.10 TTFFTTFFTTTTFTTF 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-171624188800215.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-313, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188800215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 19:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 19:50 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-313-ReachabilityFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-313-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717183512903

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-313
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:25:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:25:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:25:14] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-31 19:25:14] [INFO ] Transformed 2585 places.
[2024-05-31 19:25:14] [INFO ] Transformed 3095 transitions.
[2024-05-31 19:25:14] [INFO ] Found NUPN structural information;
[2024-05-31 19:25:14] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (282 resets) in 2144 ms. (18 steps per ms) remains 13/16 properties
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (74 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (78 resets) in 377 ms. (105 steps per ms) remains 12/13 properties
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (80 resets) in 565 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (77 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (81 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (76 resets) in 818 ms. (48 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (73 resets) in 214 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (79 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (77 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (80 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (89 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (66 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-31 19:25:16] [INFO ] Computed 4 invariants in 48 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2395/2575 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2575 variables, 2395/2579 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2575 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3087/5662 variables, 2575/5154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5662 variables, 0/5154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/5665 variables, 2/5156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5665 variables, 2/5158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5665/5680 variables, and 5158 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5093 ms.
Refiners :[Domain max(s): 2577/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2577/2585 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2395/2575 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2575 variables, 2395/2579 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2575 variables, 0/2579 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3087/5662 variables, 2575/5154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5662 variables, 11/5165 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5662/5680 variables, and 5165 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5026 ms.
Refiners :[Domain max(s): 2575/2585 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 2575/2585 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 10366ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 180 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2515 edges and 2585 vertex of which 422 / 2585 are part of one of the 41 SCC in 12 ms
Free SCC test removed 381 places
Drop transitions (Empty/Sink Transition effects.) removed 466 transitions
Reduce isomorphic transitions removed 466 transitions.
Graph (complete) has 2909 edges and 2204 vertex of which 2192 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Discarding 12 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1127 transitions
Trivial Post-agglo rules discarded 1127 transitions
Performed 1127 trivial Post agglomeration. Transition count delta: 1127
Iterating post reduction 0 with 1133 rules applied. Total rules applied 1135 place count 2192 transition count 1489
Reduce places removed 1127 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 1190 rules applied. Total rules applied 2325 place count 1065 transition count 1426
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 28 rules applied. Total rules applied 2353 place count 1044 transition count 1419
Reduce places removed 2 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 4 rules applied. Total rules applied 2357 place count 1042 transition count 1417
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 4 with 3 rules applied. Total rules applied 2360 place count 1041 transition count 1415
Reduce places removed 1 places and 0 transitions.
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Iterating post reduction 5 with 158 rules applied. Total rules applied 2518 place count 1040 transition count 1258
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 6 with 178 rules applied. Total rules applied 2696 place count 883 transition count 1237
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2702 place count 877 transition count 1237
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 36 Pre rules applied. Total rules applied 2702 place count 877 transition count 1201
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 2774 place count 841 transition count 1201
Discarding 101 places :
Symmetric choice reduction at 8 with 101 rule applications. Total rules 2875 place count 740 transition count 1100
Iterating global reduction 8 with 101 rules applied. Total rules applied 2976 place count 740 transition count 1100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 5 rules applied. Total rules applied 2981 place count 740 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2982 place count 739 transition count 1095
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 2982 place count 739 transition count 1088
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 2996 place count 732 transition count 1088
Discarding 49 places :
Symmetric choice reduction at 10 with 49 rule applications. Total rules 3045 place count 683 transition count 1039
Iterating global reduction 10 with 49 rules applied. Total rules applied 3094 place count 683 transition count 1039
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 14 rules applied. Total rules applied 3108 place count 683 transition count 1025
Reduce places removed 6 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 11 with 8 rules applied. Total rules applied 3116 place count 677 transition count 1023
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 3118 place count 676 transition count 1022
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3119 place count 675 transition count 1022
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3125 place count 669 transition count 1012
Iterating global reduction 14 with 6 rules applied. Total rules applied 3131 place count 669 transition count 1012
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3132 place count 669 transition count 1011
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 3135 place count 666 transition count 1005
Iterating global reduction 15 with 3 rules applied. Total rules applied 3138 place count 666 transition count 1005
Performed 182 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 15 with 364 rules applied. Total rules applied 3502 place count 484 transition count 787
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 15 with 23 rules applied. Total rules applied 3525 place count 484 transition count 764
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 3533 place count 480 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 3534 place count 480 transition count 759
Performed 59 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 17 with 118 rules applied. Total rules applied 3652 place count 421 transition count 810
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 17 with 26 rules applied. Total rules applied 3678 place count 421 transition count 784
Discarding 6 places :
Symmetric choice reduction at 18 with 6 rule applications. Total rules 3684 place count 415 transition count 772
Iterating global reduction 18 with 6 rules applied. Total rules applied 3690 place count 415 transition count 772
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 18 with 48 rules applied. Total rules applied 3738 place count 415 transition count 724
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3739 place count 414 transition count 723
Iterating global reduction 18 with 1 rules applied. Total rules applied 3740 place count 414 transition count 723
Free-agglomeration rule applied 44 times.
Iterating global reduction 18 with 44 rules applied. Total rules applied 3784 place count 414 transition count 679
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 18 with 44 rules applied. Total rules applied 3828 place count 370 transition count 679
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 19 with 6 rules applied. Total rules applied 3834 place count 370 transition count 673
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 3855 place count 370 transition count 673
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3857 place count 370 transition count 671
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3858 place count 370 transition count 670
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 3860 place count 369 transition count 669
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3862 place count 369 transition count 669
Applied a total of 3862 rules in 622 ms. Remains 369 /2585 variables (removed 2216) and now considering 669/3095 (removed 2426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 635 ms. Remains : 369/2585 places, 669/3095 transitions.
RANDOM walk for 40000 steps (1189 resets) in 852 ms. (46 steps per ms) remains 7/12 properties
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (266 resets) in 100 ms. (396 steps per ms) remains 6/7 properties
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (261 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (262 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (273 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (261 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
[2024-05-31 19:25:28] [INFO ] Flow matrix only has 662 transitions (discarded 7 similar events)
// Phase 1: matrix 662 rows 369 cols
[2024-05-31 19:25:28] [INFO ] Computed 1 invariants in 9 ms
[2024-05-31 19:25:28] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CloudReconfiguration-PT-313-ReachabilityFireability-2024-15 is UNSAT
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 73/205 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 544/749 variables, 205/206 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 237/986 variables, 128/335 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 3/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 41/1027 variables, 32/370 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem CloudReconfiguration-PT-313-ReachabilityFireability-2024-12 is UNSAT
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 4/1031 variables, 4/374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1031 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1031 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 374 constraints, problems are : Problem set: 2 solved, 4 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/161 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 429/590 variables, 161/162 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 1/163 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 285/875 variables, 112/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/875 variables, 3/278 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/875 variables, 4/282 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/875 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 123/998 variables, 70/352 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 0/352 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 28/1026 variables, 22/374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1026 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/1031 variables, 4/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1031 variables, 0/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1031 variables, 0/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1031/1031 variables, and 378 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1950ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 14947 steps, including 392 resets, run visited all 1 properties in 59 ms. (steps per millisecond=253 )
FORMULA CloudReconfiguration-PT-313-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 275 ms.
All properties solved without resorting to model-checking.
Total runtime 16142 ms.
ITS solved all properties within timeout

BK_STOP 1717183530458

--------------------
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-313"
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-313, 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-171624188800215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-313.tgz
mv CloudReconfiguration-PT-313 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;