About the Execution of LTSMin+red for CloudDeployment-PT-2b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 500.380 | 26520.00 | 42512.00 | 200.30 | TTTTTTFFTFFTTF?F | 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.r476-tall-171620506100551.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 CloudDeployment-PT-2b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506100551
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K 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 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 166K 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 CloudDeployment-PT-2b-ReachabilityFireability-2024-00
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-01
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-02
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-03
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-04
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-05
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-06
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-07
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-08
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-09
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-10
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-11
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-12
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-13
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-14
FORMULA_NAME CloudDeployment-PT-2b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717207908083
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:11:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:11:49] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 02:11:49] [INFO ] Transformed 556 places.
[2024-06-01 02:11:49] [INFO ] Transformed 684 transitions.
[2024-06-01 02:11:49] [INFO ] Found NUPN structural information;
[2024-06-01 02:11:49] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (614 resets) in 1635 ms. (24 steps per ms) remains 11/16 properties
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (135 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (103 resets) in 351 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (146 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (129 resets) in 233 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (143 resets) in 696 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (108 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (129 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (164 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (155 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (148 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (146 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
// Phase 1: matrix 684 rows 556 cols
[2024-06-01 02:11:50] [INFO ] Computed 9 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 338/555 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-09 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 338/564 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/564 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 684/1239 variables, 555/1119 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 0/1119 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-06 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-07 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-10 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-13 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-15 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1/1240 variables, 1/1120 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1240 variables, 1/1121 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1240 variables, 0/1121 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1240 variables, 0/1121 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 1121 constraints, problems are : Problem set: 6 solved, 5 unsolved in 2179 ms.
Refiners :[Domain max(s): 556/556 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 556/556 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/103 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 453/555 variables, 8/111 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 453/564 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/564 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 684/1239 variables, 555/1119 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 5/1124 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1239 variables, 0/1124 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-02 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-2b-ReachabilityFireability-2024-05 is UNSAT
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1/1240 variables, 1/1125 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1240 variables, 1/1126 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1240 variables, 0/1126 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1240 variables, 0/1126 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 1126 constraints, problems are : Problem set: 8 solved, 3 unsolved in 2347 ms.
Refiners :[Domain max(s): 556/556 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 556/556 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 4745ms problems are : Problem set: 8 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA CloudDeployment-PT-2b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 99 ms.
Support contains 27 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 684/684 transitions.
Graph (trivial) has 509 edges and 556 vertex of which 109 / 556 are part of one of the 14 SCC in 4 ms
Free SCC test removed 95 places
Drop transitions (Empty/Sink Transition effects.) removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 992 edges and 461 vertex of which 445 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 205 rules applied. Total rules applied 207 place count 445 transition count 345
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 204 rules applied. Total rules applied 411 place count 246 transition count 340
Reduce places removed 2 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 17 rules applied. Total rules applied 428 place count 244 transition count 325
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 443 place count 229 transition count 325
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 443 place count 229 transition count 312
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 469 place count 216 transition count 312
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 524 place count 161 transition count 257
Iterating global reduction 4 with 55 rules applied. Total rules applied 579 place count 161 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 582 place count 161 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 582 place count 161 transition count 247
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 596 place count 154 transition count 247
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 662 place count 121 transition count 214
Performed 14 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 690 place count 107 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 702 place count 107 transition count 237
Free-agglomeration rule applied 14 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 716 place count 107 transition count 221
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 734 place count 93 transition count 217
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 736 place count 91 transition count 213
Iterating global reduction 6 with 2 rules applied. Total rules applied 738 place count 91 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 740 place count 91 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 757 place count 91 transition count 194
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 760 place count 91 transition count 194
Applied a total of 760 rules in 142 ms. Remains 91 /556 variables (removed 465) and now considering 194/684 (removed 490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 91/556 places, 194/684 transitions.
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2949776 steps, run timeout after 3001 ms. (steps per millisecond=982 ) properties seen :0 out of 1
Probabilistic random walk after 2949776 steps, saw 400079 distinct states, run finished after 3004 ms. (steps per millisecond=981 ) properties seen :0
[2024-06-01 02:11:59] [INFO ] Flow matrix only has 170 transitions (discarded 24 similar events)
// Phase 1: matrix 170 rows 91 cols
[2024-06-01 02:11:59] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:11:59] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/86 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/255 variables, 86/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 35/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/261 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/261 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/86 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:11:59] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/255 variables, 86/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/261 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/261 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 27 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 91/91 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 194/194 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-06-01 02:11:59] [INFO ] Flow matrix only has 170 transitions (discarded 24 similar events)
[2024-06-01 02:11:59] [INFO ] Invariant cache hit.
[2024-06-01 02:11:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 02:11:59] [INFO ] Flow matrix only has 170 transitions (discarded 24 similar events)
[2024-06-01 02:11:59] [INFO ] Invariant cache hit.
[2024-06-01 02:11:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 02:11:59] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-01 02:11:59] [INFO ] Redundant transitions in 96 ms returned []
Running 193 sub problems to find dead transitions.
[2024-06-01 02:11:59] [INFO ] Flow matrix only has 170 transitions (discarded 24 similar events)
[2024-06-01 02:11:59] [INFO ] Invariant cache hit.
[2024-06-01 02:11:59] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 170/261 variables, 91/97 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 40/137 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-01 02:12:02] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 138 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 170/261 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 40/138 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 193/331 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-01 02:12:08] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 332 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 2/2 constraints]
After SMT, in 14179ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 14183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14472 ms. Remains : 91/91 places, 194/194 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 29 edges and 91 vertex of which 7 / 91 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 33 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 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 160
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 84 transition count 158
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 82 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 82 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 81 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 80 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 80 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 78 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 19 place count 78 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 24 place count 78 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 78 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 77 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 28 place count 77 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 77 transition count 137
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 31 place count 77 transition count 137
Applied a total of 31 rules in 29 ms. Remains 77 /91 variables (removed 14) and now considering 137/194 (removed 57) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 77 cols
[2024-06-01 02:12:13] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:12:14] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 02:12:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:12:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 02:12:14] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 02:12:14] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 02:12:14] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 212 ms.
[2024-06-01 02:12:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 02:12:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 91 places, 194 transitions and 1043 arcs took 5 ms.
[2024-06-01 02:12:14] [INFO ] Flatten gal took : 51 ms
Total runtime 25154 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 : CloudDeployment-PT-2b-ReachabilityFireability-2024-14
BK_STOP 1717207934603
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name CloudDeployment-PT-2b-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/551/inv_0_
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="CloudDeployment-PT-2b"
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 CloudDeployment-PT-2b, 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 r476-tall-171620506100551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-2b.tgz
mv CloudDeployment-PT-2b 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 ;