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

About the Execution of GreatSPN+red for CloudDeployment-PT-5a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
668.264 29757.00 47013.00 131.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r069-tall-171620504800589.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CloudDeployment-PT-5a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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 56K 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 3.6K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 230K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-5a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716468079168

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:41:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 12:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:41:20] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-23 12:41:20] [INFO ] Transformed 180 places.
[2024-05-23 12:41:20] [INFO ] Transformed 675 transitions.
[2024-05-23 12:41:20] [INFO ] Found NUPN structural information;
[2024-05-23 12:41:20] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 12:41:20] [INFO ] Flow matrix only has 301 transitions (discarded 294 similar events)
// Phase 1: matrix 301 rows 180 cols
[2024-05-23 12:41:20] [INFO ] Computed 30 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (137 resets) in 56 ms. (175 steps per ms)
FORMULA CloudDeployment-PT-5a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (9 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 12:41:20] [INFO ] Flow matrix only has 301 transitions (discarded 294 similar events)
[2024-05-23 12:41:20] [INFO ] Invariant cache hit.
[2024-05-23 12:41:20] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-23 12:41:21] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-23 12:41:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:41:21] [INFO ] [Real]Added 132 Read/Feed constraints in 26 ms returned sat
[2024-05-23 12:41:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:41:21] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 10 ms returned sat
[2024-05-23 12:41:21] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-23 12:41:21] [INFO ] [Nat]Added 132 Read/Feed constraints in 29 ms returned sat
[2024-05-23 12:41:21] [INFO ] Computed and/alt/rep : 221/586/221 causal constraints (skipped 79 transitions) in 45 ms.
[2024-05-23 12:41:21] [INFO ] Added : 95 causal constraints over 19 iterations in 510 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 180 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p115) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 594/594 transitions.
Graph (trivial) has 201 edges and 180 vertex of which 50 / 180 are part of one of the 15 SCC in 5 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 165 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 195 transitions.
Graph (complete) has 962 edges and 145 vertex of which 135 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 127 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 127 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 125 transition count 364
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 124 transition count 363
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 124 transition count 363
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 119 transition count 358
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 64 place count 104 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 144 place count 104 transition count 323
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 104 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 103 transition count 322
Applied a total of 146 rules in 165 ms. Remains 103 /180 variables (removed 77) and now considering 322/594 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 103/180 places, 322/594 transitions.
[2024-05-23 12:41:22] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
// Phase 1: matrix 147 rows 103 cols
[2024-05-23 12:41:22] [INFO ] Computed 21 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17774 resets) in 1600 ms. (624 steps per ms)
BEST_FIRST walk for 1000001 steps (2701 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 12:41:24] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2024-05-23 12:41:24] [INFO ] Invariant cache hit.
[2024-05-23 12:41:24] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2024-05-23 12:41:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-23 12:41:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 12:41:24] [INFO ] [Real]Added 7 Read/Feed constraints in 12 ms returned sat
[2024-05-23 12:41:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:41:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2024-05-23 12:41:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-23 12:41:24] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-23 12:41:24] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 6 ms to minimize.
[2024-05-23 12:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-23 12:41:24] [INFO ] Computed and/alt/rep : 109/197/109 causal constraints (skipped 13 transitions) in 15 ms.
[2024-05-23 12:41:24] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-23 12:41:25] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-23 12:41:25] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-23 12:41:25] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:41:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 308 ms
[2024-05-23 12:41:25] [INFO ] Added : 50 causal constraints over 11 iterations in 430 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 322/322 transitions.
Applied a total of 0 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 103/103 places, 322/322 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 322/322 transitions.
Applied a total of 0 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-23 12:41:25] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2024-05-23 12:41:25] [INFO ] Invariant cache hit.
[2024-05-23 12:41:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-23 12:41:25] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2024-05-23 12:41:25] [INFO ] Invariant cache hit.
[2024-05-23 12:41:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 12:41:25] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-23 12:41:25] [INFO ] Redundant transitions in 24 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-23 12:41:25] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2024-05-23 12:41:25] [INFO ] Invariant cache hit.
[2024-05-23 12:41:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-23 12:41:28] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 147/250 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 132 constraints, problems are : Problem set: 0 solved, 297 unsolved in 8268 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 103/103 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 6/103 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 147/250 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 7/132 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 297/429 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 429 constraints, problems are : Problem set: 0 solved, 297 unsolved in 11016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 103/103 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
After SMT, in 19632ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 19645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19960 ms. Remains : 103/103 places, 322/322 transitions.
RANDOM walk for 40000 steps (700 resets) in 697 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (110 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (104 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 901051 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 2
Probabilistic random walk after 901051 steps, saw 156416 distinct states, run finished after 3006 ms. (steps per millisecond=299 ) properties seen :0
[2024-05-23 12:41:48] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2024-05-23 12:41:48] [INFO ] Invariant cache hit.
[2024-05-23 12:41:48] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 77/120 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/180 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 40/220 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/250 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/250 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 131 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 103/103 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 77/120 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 60/180 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/220 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/250 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 133 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 103/103 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 6 ms.
FORMULA CloudDeployment-PT-5a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 28493 ms.
ITS solved all properties within timeout

BK_STOP 1716468108925

--------------------
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 UpperBounds -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="CloudDeployment-PT-5a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudDeployment-PT-5a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504800589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5a.tgz
mv CloudDeployment-PT-5a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;