Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399500413.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r073-smll-167814399500413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 230K Mar 5 18:22 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 1678475011464

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-5a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 19:03:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 19:03:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:03:34] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-10 19:03:34] [INFO ] Transformed 180 places.
[2023-03-10 19:03:34] [INFO ] Transformed 675 transitions.
[2023-03-10 19:03:34] [INFO ] Found NUPN structural information;
[2023-03-10 19:03:34] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
Normalized transition count is 301 out of 595 initially.
// Phase 1: matrix 301 rows 180 cols
[2023-03-10 19:03:34] [INFO ] Computed 30 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 133 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :13
FORMULA CloudDeployment-PT-5a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
FORMULA CloudDeployment-PT-5a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-5a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 19:03:34] [INFO ] Flow matrix only has 301 transitions (discarded 294 similar events)
// Phase 1: matrix 301 rows 180 cols
[2023-03-10 19:03:34] [INFO ] Computed 30 place invariants in 7 ms
[2023-03-10 19:03:34] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 22 ms returned sat
[2023-03-10 19:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:34] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-10 19:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:03:34] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 13 ms returned sat
[2023-03-10 19:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:35] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-10 19:03:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-03-10 19:03:35] [INFO ] [Nat]Added 132 Read/Feed constraints in 60 ms returned sat
[2023-03-10 19:03:35] [INFO ] Computed and/alt/rep : 221/586/221 causal constraints (skipped 79 transitions) in 53 ms.
[2023-03-10 19:03:36] [INFO ] Added : 116 causal constraints over 24 iterations in 799 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 180 places. Attempting structural reductions.
Drop transitions 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 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 2 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 0 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 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 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 168 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 169 ms. Remains : 103/180 places, 322/594 transitions.
Normalized transition count is 147 out of 322 initially.
// Phase 1: matrix 147 rows 103 cols
[2023-03-10 19:03:36] [INFO ] Computed 21 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 17709 resets, run finished after 2048 ms. (steps per millisecond=488 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2695 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 1) seen :0
[2023-03-10 19:03:39] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
// Phase 1: matrix 147 rows 103 cols
[2023-03-10 19:03:39] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-10 19:03:39] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-10 19:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:39] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-10 19:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:03:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-10 19:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:39] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-10 19:03:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:03:39] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2023-03-10 19:03:39] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 7 ms to minimize.
[2023-03-10 19:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-10 19:03:39] [INFO ] Computed and/alt/rep : 109/197/109 causal constraints (skipped 13 transitions) in 30 ms.
[2023-03-10 19:03:39] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-10 19:03:39] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-10 19:03:39] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 3 ms to minimize.
[2023-03-10 19:03:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2023-03-10 19:03:40] [INFO ] Added : 42 causal constraints over 10 iterations in 531 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 18 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 19 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 14 ms. Remains 103 /103 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-03-10 19:03:40] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2023-03-10 19:03:40] [INFO ] Invariant cache hit.
[2023-03-10 19:03:40] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-10 19:03:40] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2023-03-10 19:03:40] [INFO ] Invariant cache hit.
[2023-03-10 19:03:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:03:40] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-10 19:03:40] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-10 19:03:40] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2023-03-10 19:03:40] [INFO ] Invariant cache hit.
[2023-03-10 19:03:40] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 705 ms. Remains : 103/103 places, 322/322 transitions.
Starting property specific reduction for CloudDeployment-PT-5a-UpperBounds-10
Normalized transition count is 147 out of 322 initially.
// Phase 1: matrix 147 rows 103 cols
[2023-03-10 19:03:40] [INFO ] Computed 21 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 175 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 19:03:40] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
// Phase 1: matrix 147 rows 103 cols
[2023-03-10 19:03:40] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-10 19:03:40] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-10 19:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:40] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-10 19:03:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:03:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-10 19:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:41] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-10 19:03:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:03:41] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2023-03-10 19:03:41] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2023-03-10 19:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-10 19:03:41] [INFO ] Computed and/alt/rep : 109/197/109 causal constraints (skipped 13 transitions) in 18 ms.
[2023-03-10 19:03:41] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-10 19:03:41] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-03-10 19:03:41] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2023-03-10 19:03:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2023-03-10 19:03:41] [INFO ] Added : 42 causal constraints over 10 iterations in 456 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 9 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 9 ms. Remains : 103/103 places, 322/322 transitions.
Normalized transition count is 147 out of 322 initially.
// Phase 1: matrix 147 rows 103 cols
[2023-03-10 19:03:41] [INFO ] Computed 21 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 17705 resets, run finished after 1981 ms. (steps per millisecond=504 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2706 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 1) seen :0
[2023-03-10 19:03:44] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
// Phase 1: matrix 147 rows 103 cols
[2023-03-10 19:03:44] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-10 19:03:44] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-10 19:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-10 19:03:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:03:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-10 19:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:44] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-10 19:03:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:03:44] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2023-03-10 19:03:44] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-03-10 19:03:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-10 19:03:44] [INFO ] Computed and/alt/rep : 109/197/109 causal constraints (skipped 13 transitions) in 16 ms.
[2023-03-10 19:03:44] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-10 19:03:45] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-03-10 19:03:45] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2023-03-10 19:03:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-10 19:03:45] [INFO ] Added : 42 causal constraints over 10 iterations in 443 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
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 10 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 10 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.
[2023-03-10 19:03:45] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2023-03-10 19:03:45] [INFO ] Invariant cache hit.
[2023-03-10 19:03:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-10 19:03:45] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2023-03-10 19:03:45] [INFO ] Invariant cache hit.
[2023-03-10 19:03:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:03:45] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-10 19:03:45] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-10 19:03:45] [INFO ] Flow matrix only has 147 transitions (discarded 175 similar events)
[2023-03-10 19:03:45] [INFO ] Invariant cache hit.
[2023-03-10 19:03:45] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 103/103 places, 322/322 transitions.
Ending property specific reduction for CloudDeployment-PT-5a-UpperBounds-10 in 5046 ms.
[2023-03-10 19:03:46] [INFO ] Flatten gal took : 105 ms
[2023-03-10 19:03:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-10 19:03:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 322 transitions and 2538 arcs took 5 ms.
Total runtime 12415 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/545/ub_0_
FORMULA CloudDeployment-PT-5a-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678475027628

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name CloudDeployment-PT-5a-UpperBounds-10
ub formula formula --maxsum=/tmp/545/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 103 places, 322 transitions and 2538 arcs
pnml2lts-sym: Petri net CloudDeployment_PT_5a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 322->312 groups
pnml2lts-sym: Regrouping took 0.080 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 103; there are 312 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 6781 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.100 real 0.390 user 0.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 6071942 states, 1018 nodes
pnml2lts-sym: Maximum sum of /tmp/545/ub_0_ is: 1
pnml2lts-sym: group_next: 4118 nodes total
pnml2lts-sym: group_explored: 4949 nodes, 3199 short vectors total
pnml2lts-sym: max token count: 1

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="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-5348"
echo " Executing tool ltsminxred"
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 r073-smll-167814399500413"
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 ;