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-171620506200621.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-7a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200621
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:04 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 420K 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-7a-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-7a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717209762235

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:42:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 02:42:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:42:43] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-01 02:42:43] [INFO ] Transformed 264 places.
[2024-06-01 02:42:43] [INFO ] Transformed 1174 transitions.
[2024-06-01 02:42:43] [INFO ] Found NUPN structural information;
[2024-06-01 02:42:43] [INFO ] Parsed PT model containing 264 places and 1174 transitions and 7331 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 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-06-01 02:42:43] [INFO ] Flow matrix only has 475 transitions (discarded 545 similar events)
// Phase 1: matrix 475 rows 264 cols
[2024-06-01 02:42:43] [INFO ] Computed 42 invariants in 19 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 (92 resets) in 65 ms. (151 steps per ms)
FORMULA CloudDeployment-PT-7a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (17 resets) in 26 ms. (740 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 02:42:43] [INFO ] Flow matrix only has 475 transitions (discarded 545 similar events)
[2024-06-01 02:42:43] [INFO ] Invariant cache hit.
[2024-06-01 02:42:43] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 11 ms returned sat
[2024-06-01 02:42:44] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-06-01 02:42:44] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 02:42:44] [INFO ] [Real]Added 240 Read/Feed constraints in 33 ms returned sat
[2024-06-01 02:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:42:44] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 11 ms returned sat
[2024-06-01 02:42:44] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-01 02:42:44] [INFO ] [Nat]Added 240 Read/Feed constraints in 48 ms returned sat
[2024-06-01 02:42:44] [INFO ] Computed and/alt/rep : 337/960/337 causal constraints (skipped 137 transitions) in 63 ms.
[2024-06-01 02:42:45] [INFO ] Added : 198 causal constraints over 40 iterations in 1352 ms. Result :sat
Minimization took 440 ms.
[2024-06-01 02:42:46] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 12 ms returned sat
[2024-06-01 02:42:46] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-01 02:42:46] [INFO ] [Real]Added 240 Read/Feed constraints in 34 ms returned sat
[2024-06-01 02:42:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:42:46] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 12 ms returned sat
[2024-06-01 02:42:46] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-01 02:42:46] [INFO ] [Nat]Added 240 Read/Feed constraints in 53 ms returned sat
[2024-06-01 02:42:46] [INFO ] Computed and/alt/rep : 337/960/337 causal constraints (skipped 137 transitions) in 41 ms.
[2024-06-01 02:42:47] [INFO ] Added : 148 causal constraints over 30 iterations in 891 ms. Result :sat
Minimization took 420 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1020/1020 transitions.
Graph (trivial) has 281 edges and 264 vertex of which 70 / 264 are part of one of the 21 SCC in 4 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 252 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 308 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 202 transition count 712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 26 place count 190 transition count 651
Iterating global reduction 1 with 12 rules applied. Total rules applied 38 place count 190 transition count 651
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 186 transition count 647
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 186 transition count 647
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 183 transition count 644
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 183 transition count 644
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 181 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 181 transition count 642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 180 transition count 641
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 180 transition count 641
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 100 place count 159 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 140 transitions
Redundant transition composition rules discarded 140 transitions
Iterating global reduction 1 with 140 rules applied. Total rules applied 240 place count 159 transition count 592
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 247 place count 159 transition count 712
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 254 place count 152 transition count 712
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 152 transition count 712
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 151 transition count 711
Applied a total of 256 rules in 220 ms. Remains 151 /264 variables (removed 113) and now considering 711/1020 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 151/264 places, 711/1020 transitions.
[2024-06-01 02:42:48] [INFO ] Flow matrix only has 368 transitions (discarded 343 similar events)
// Phase 1: matrix 368 rows 151 cols
[2024-06-01 02:42:48] [INFO ] Computed 29 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (13341 resets) in 2637 ms. (379 steps per ms)
BEST_FIRST walk for 2000002 steps (2991 resets) in 1283 ms. (1557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 02:42:52] [INFO ] Flow matrix only has 368 transitions (discarded 343 similar events)
[2024-06-01 02:42:52] [INFO ] Invariant cache hit.
[2024-06-01 02:42:52] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 6 ms returned sat
[2024-06-01 02:42:52] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 02:42:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 02:42:52] [INFO ] [Real]Added 9 Read/Feed constraints in 12 ms returned sat
[2024-06-01 02:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:42:52] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 7 ms returned sat
[2024-06-01 02:42:52] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 02:42:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 14 ms returned sat
[2024-06-01 02:42:52] [INFO ] Computed and/alt/rep : 174/326/174 causal constraints (skipped 145 transitions) in 28 ms.
[2024-06-01 02:42:52] [INFO ] Added : 51 causal constraints over 11 iterations in 212 ms. Result :sat
Minimization took 99 ms.
[2024-06-01 02:42:53] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 6 ms returned sat
[2024-06-01 02:42:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 02:42:53] [INFO ] [Real]Added 9 Read/Feed constraints in 13 ms returned sat
[2024-06-01 02:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:42:53] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 6 ms returned sat
[2024-06-01 02:42:53] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 02:42:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 13 ms returned sat
[2024-06-01 02:42:53] [INFO ] Computed and/alt/rep : 174/326/174 causal constraints (skipped 145 transitions) in 27 ms.
[2024-06-01 02:42:53] [INFO ] Added : 59 causal constraints over 12 iterations in 245 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 711/711 transitions.
Applied a total of 0 rules in 15 ms. Remains 151 /151 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 151/151 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 711/711 transitions.
Applied a total of 0 rules in 14 ms. Remains 151 /151 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2024-06-01 02:42:53] [INFO ] Flow matrix only has 368 transitions (discarded 343 similar events)
[2024-06-01 02:42:53] [INFO ] Invariant cache hit.
[2024-06-01 02:42:53] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 02:42:53] [INFO ] Flow matrix only has 368 transitions (discarded 343 similar events)
[2024-06-01 02:42:53] [INFO ] Invariant cache hit.
[2024-06-01 02:42:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 02:42:54] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-06-01 02:42:54] [INFO ] Redundant transitions in 39 ms returned []
Running 662 sub problems to find dead transitions.
[2024-06-01 02:42:54] [INFO ] Flow matrix only has 368 transitions (discarded 343 similar events)
[2024-06-01 02:42:54] [INFO ] Invariant cache hit.
[2024-06-01 02:42:54] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (OVERLAPS) 7/151 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 4 (OVERLAPS) 368/519 variables, 151/180 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 7 (OVERLAPS) 0/519 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 662 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 189 constraints, problems are : Problem set: 0 solved, 662 unsolved in 27120 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 151/151 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 662 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (OVERLAPS) 7/151 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 4 (OVERLAPS) 368/519 variables, 151/180 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 662/851 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 851 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 151/151 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 0/0 constraints]
After SMT, in 58675ms problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 58698ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59222 ms. Remains : 151/151 places, 711/711 transitions.
RANDOM walk for 40000 steps (529 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (60 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (58 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (59 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 484299 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 4
Probabilistic random walk after 484299 steps, saw 94402 distinct states, run finished after 3004 ms. (steps per millisecond=161 ) properties seen :0
[2024-06-01 02:43:56] [INFO ] Flow matrix only has 368 transitions (discarded 343 similar events)
[2024-06-01 02:43:56] [INFO ] Invariant cache hit.
[2024-06-01 02:43:56] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/151 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/519 variables, 151/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/519 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 189 constraints, problems are : Problem set: 0 solved, 4 unsolved in 214 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 151/151 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 135/151 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/519 variables, 151/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/519 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 193 constraints, problems are : Problem set: 0 solved, 4 unsolved in 353 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 151/151 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 4 properties in 12 ms.
FORMULA CloudDeployment-PT-7a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA CloudDeployment-PT-7a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 73692 ms.
ITS solved all properties within timeout

BK_STOP 1717209837065

--------------------
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-7a"
export BK_EXAMINATION="UpperBounds"
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-7a, 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 r476-tall-171620506200621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7a.tgz
mv CloudDeployment-PT-7a 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 ;