fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r073-smll-167814399500437
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CloudDeployment-PT-6b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
916.628 133816.00 178207.00 694.20 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/mcc2023-input.r073-smll-167814399500437.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-6b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399500437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:49 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 4.8M 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-6b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678487959667

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-6b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 22:39:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 22:39:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:39:22] [INFO ] Load time of PNML (sax parser for PT used): 674 ms
[2023-03-10 22:39:22] [INFO ] Transformed 1888 places.
[2023-03-10 22:39:22] [INFO ] Transformed 6804 transitions.
[2023-03-10 22:39:22] [INFO ] Found NUPN structural information;
[2023-03-10 22:39:22] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 847 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 6804 rows 1888 cols
[2023-03-10 22:39:23] [INFO ] Computed 25 place invariants in 241 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 16) seen :5
FORMULA CloudDeployment-PT-6b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 22:39:23] [INFO ] Invariant cache hit.
[2023-03-10 22:39:24] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-10 22:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:28] [INFO ] [Real]Absence check using state equation in 3774 ms returned sat
[2023-03-10 22:39:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:39:29] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 72 ms returned sat
[2023-03-10 22:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:32] [INFO ] [Nat]Absence check using state equation in 2850 ms returned sat
[2023-03-10 22:39:35] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2910 ms.
[2023-03-10 22:39:35] [INFO ] Added : 0 causal constraints over 0 iterations in 2912 ms. Result :unknown
[2023-03-10 22:39:36] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-10 22:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:39] [INFO ] [Real]Absence check using state equation in 3028 ms returned sat
[2023-03-10 22:39:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:39:39] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-10 22:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:42] [INFO ] [Nat]Absence check using state equation in 2716 ms returned sat
[2023-03-10 22:39:45] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2807 ms.
[2023-03-10 22:39:45] [INFO ] Added : 0 causal constraints over 0 iterations in 2809 ms. Result :unknown
[2023-03-10 22:39:46] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-10 22:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:49] [INFO ] [Real]Absence check using state equation in 3020 ms returned sat
[2023-03-10 22:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:39:49] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-10 22:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:52] [INFO ] [Nat]Absence check using state equation in 2959 ms returned sat
[2023-03-10 22:39:55] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2129 ms.
[2023-03-10 22:39:55] [INFO ] Added : 0 causal constraints over 0 iterations in 2135 ms. Result :unknown
[2023-03-10 22:39:55] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-10 22:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:39:58] [INFO ] [Real]Absence check using state equation in 3366 ms returned sat
[2023-03-10 22:39:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:39:59] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 68 ms returned sat
[2023-03-10 22:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:02] [INFO ] [Nat]Absence check using state equation in 2582 ms returned sat
[2023-03-10 22:40:05] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2673 ms.
[2023-03-10 22:40:05] [INFO ] Added : 0 causal constraints over 0 iterations in 2674 ms. Result :unknown
[2023-03-10 22:40:05] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-10 22:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:08] [INFO ] [Real]Absence check using state equation in 2718 ms returned sat
[2023-03-10 22:40:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:40:08] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-10 22:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:11] [INFO ] [Nat]Absence check using state equation in 2718 ms returned sat
[2023-03-10 22:40:14] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2405 ms.
[2023-03-10 22:40:14] [INFO ] Added : 0 causal constraints over 0 iterations in 2406 ms. Result :unknown
[2023-03-10 22:40:14] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-10 22:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:17] [INFO ] [Real]Absence check using state equation in 3174 ms returned sat
[2023-03-10 22:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:40:18] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-10 22:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:21] [INFO ] [Nat]Absence check using state equation in 2755 ms returned sat
[2023-03-10 22:40:23] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2428 ms.
[2023-03-10 22:40:23] [INFO ] Added : 0 causal constraints over 0 iterations in 2429 ms. Result :unknown
[2023-03-10 22:40:24] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-10 22:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:28] [INFO ] [Real]Absence check using state equation in 4139 ms returned sat
[2023-03-10 22:40:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:40:29] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-10 22:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:32] [INFO ] [Nat]Absence check using state equation in 3676 ms returned sat
[2023-03-10 22:40:35] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2472 ms.
[2023-03-10 22:40:35] [INFO ] Added : 0 causal constraints over 0 iterations in 2474 ms. Result :unknown
[2023-03-10 22:40:35] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-10 22:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:38] [INFO ] [Real]Absence check using state equation in 2891 ms returned sat
[2023-03-10 22:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:40:39] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 68 ms returned sat
[2023-03-10 22:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:42] [INFO ] [Nat]Absence check using state equation in 2650 ms returned sat
[2023-03-10 22:40:44] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2423 ms.
[2023-03-10 22:40:44] [INFO ] Added : 0 causal constraints over 0 iterations in 2425 ms. Result :unknown
[2023-03-10 22:40:45] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-10 22:40:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:48] [INFO ] [Real]Absence check using state equation in 3401 ms returned sat
[2023-03-10 22:40:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:40:49] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-10 22:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:40:52] [INFO ] [Nat]Absence check using state equation in 2889 ms returned sat
[2023-03-10 22:40:54] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2413 ms.
[2023-03-10 22:40:54] [INFO ] Added : 0 causal constraints over 0 iterations in 2414 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-6b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1900 edges and 1888 vertex of which 504 / 1888 are part of one of the 48 SCC in 16 ms
Free SCC test removed 456 places
Drop transitions removed 2606 transitions
Reduce isomorphic transitions removed 2606 transitions.
Graph (complete) has 4302 edges and 1432 vertex of which 1419 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.23 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 671 transitions
Trivial Post-agglo rules discarded 671 transitions
Performed 671 trivial Post agglomeration. Transition count delta: 671
Iterating post reduction 0 with 680 rules applied. Total rules applied 682 place count 1417 transition count 3514
Reduce places removed 671 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 672 rules applied. Total rules applied 1354 place count 746 transition count 3513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1355 place count 745 transition count 3513
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1355 place count 745 transition count 3490
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1401 place count 722 transition count 3490
Discarding 325 places :
Symmetric choice reduction at 3 with 325 rule applications. Total rules 1726 place count 397 transition count 1129
Iterating global reduction 3 with 325 rules applied. Total rules applied 2051 place count 397 transition count 1129
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2081 place count 397 transition count 1099
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 2081 place count 397 transition count 1076
Deduced a syphon composed of 23 places in 6 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 2127 place count 374 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2131 place count 370 transition count 1072
Iterating global reduction 4 with 4 rules applied. Total rules applied 2135 place count 370 transition count 1072
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2138 place count 367 transition count 1069
Iterating global reduction 4 with 3 rules applied. Total rules applied 2141 place count 367 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2143 place count 365 transition count 1067
Iterating global reduction 4 with 2 rules applied. Total rules applied 2145 place count 365 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2146 place count 364 transition count 1066
Iterating global reduction 4 with 1 rules applied. Total rules applied 2147 place count 364 transition count 1066
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 2331 place count 272 transition count 974
Performed 37 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 2405 place count 235 transition count 1144
Drop transitions removed 13 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 2424 place count 235 transition count 1125
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2436 place count 229 transition count 1185
Drop transitions removed 169 transitions
Redundant transition composition rules discarded 169 transitions
Iterating global reduction 5 with 169 rules applied. Total rules applied 2605 place count 229 transition count 1016
Free-agglomeration rule applied 65 times with reduction of 30 identical transitions.
Iterating global reduction 5 with 65 rules applied. Total rules applied 2670 place count 229 transition count 921
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 143 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 215 transitions.
Iterating post reduction 5 with 280 rules applied. Total rules applied 2950 place count 164 transition count 706
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2956 place count 158 transition count 664
Iterating global reduction 6 with 6 rules applied. Total rules applied 2962 place count 158 transition count 664
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 3070 place count 158 transition count 556
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 3075 place count 158 transition count 577
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3080 place count 153 transition count 577
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 3081 place count 153 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3082 place count 152 transition count 576
Applied a total of 3082 rules in 1011 ms. Remains 152 /1888 variables (removed 1736) and now considering 576/6804 (removed 6228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 152/1888 places, 576/6804 transitions.
Normalized transition count is 300 out of 576 initially.
// Phase 1: matrix 300 rows 152 cols
[2023-03-10 22:40:57] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 34282 resets, run finished after 2741 ms. (steps per millisecond=364 ) properties (out of 5) seen :3
FORMULA CloudDeployment-PT-6b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2790 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2780 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 2) seen :0
[2023-03-10 22:41:01] [INFO ] Flow matrix only has 300 transitions (discarded 276 similar events)
// Phase 1: matrix 300 rows 152 cols
[2023-03-10 22:41:01] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-10 22:41:01] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:01] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-10 22:41:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:01] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:01] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-10 22:41:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-10 22:41:01] [INFO ] Computed and/alt/rep : 193/693/193 causal constraints (skipped 60 transitions) in 27 ms.
[2023-03-10 22:41:02] [INFO ] Added : 68 causal constraints over 14 iterations in 481 ms. Result :sat
Minimization took 67 ms.
[2023-03-10 22:41:02] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:02] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-10 22:41:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:02] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:02] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-10 22:41:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-10 22:41:02] [INFO ] Computed and/alt/rep : 193/693/193 causal constraints (skipped 60 transitions) in 25 ms.
[2023-03-10 22:41:02] [INFO ] Added : 67 causal constraints over 14 iterations in 335 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 576/576 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 574
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 150 transition count 574
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 150 transition count 572
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 148 transition count 572
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 147 transition count 571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 146 transition count 585
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 146 transition count 567
Applied a total of 30 rules in 60 ms. Remains 146 /152 variables (removed 6) and now considering 567/576 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 146/152 places, 567/576 transitions.
Normalized transition count is 285 out of 567 initially.
// Phase 1: matrix 285 rows 146 cols
[2023-03-10 22:41:02] [INFO ] Computed 24 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 34347 resets, run finished after 2706 ms. (steps per millisecond=369 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2795 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2780 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 2) seen :0
[2023-03-10 22:41:07] [INFO ] Flow matrix only has 285 transitions (discarded 282 similar events)
// Phase 1: matrix 285 rows 146 cols
[2023-03-10 22:41:07] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-10 22:41:07] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:07] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-10 22:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:07] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:07] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-10 22:41:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-10 22:41:07] [INFO ] Computed and/alt/rep : 178/640/178 causal constraints (skipped 60 transitions) in 25 ms.
[2023-03-10 22:41:07] [INFO ] Added : 61 causal constraints over 13 iterations in 294 ms. Result :sat
Minimization took 64 ms.
[2023-03-10 22:41:07] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:07] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-10 22:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:07] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:08] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-10 22:41:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-10 22:41:08] [INFO ] Computed and/alt/rep : 178/640/178 causal constraints (skipped 60 transitions) in 24 ms.
[2023-03-10 22:41:08] [INFO ] Added : 48 causal constraints over 10 iterations in 230 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 567/567 transitions.
Applied a total of 0 rules in 16 ms. Remains 146 /146 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 146/146 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 567/567 transitions.
Applied a total of 0 rules in 18 ms. Remains 146 /146 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-10 22:41:08] [INFO ] Flow matrix only has 285 transitions (discarded 282 similar events)
[2023-03-10 22:41:08] [INFO ] Invariant cache hit.
[2023-03-10 22:41:09] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-10 22:41:09] [INFO ] Flow matrix only has 285 transitions (discarded 282 similar events)
[2023-03-10 22:41:09] [INFO ] Invariant cache hit.
[2023-03-10 22:41:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:10] [INFO ] Implicit Places using invariants and state equation in 976 ms returned [1, 3, 18, 20, 36, 38, 53, 55, 72, 86, 89]
Discarding 11 places :
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 1576 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/146 places, 556/567 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1610 ms. Remains : 135/146 places, 556/567 transitions.
Normalized transition count is 274 out of 556 initially.
// Phase 1: matrix 274 rows 135 cols
[2023-03-10 22:41:10] [INFO ] Computed 24 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12658 resets, run finished after 2672 ms. (steps per millisecond=374 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1685 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1714 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 2) seen :0
[2023-03-10 22:41:14] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
// Phase 1: matrix 274 rows 135 cols
[2023-03-10 22:41:14] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-10 22:41:14] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:14] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-10 22:41:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:14] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-10 22:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:14] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-10 22:41:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-10 22:41:14] [INFO ] Computed and/alt/rep : 178/640/178 causal constraints (skipped 60 transitions) in 24 ms.
[2023-03-10 22:41:14] [INFO ] Added : 56 causal constraints over 14 iterations in 299 ms. Result :sat
Minimization took 55 ms.
[2023-03-10 22:41:14] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:15] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-10 22:41:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:15] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:15] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-10 22:41:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-10 22:41:15] [INFO ] Computed and/alt/rep : 178/640/178 causal constraints (skipped 60 transitions) in 22 ms.
[2023-03-10 22:41:15] [INFO ] Added : 46 causal constraints over 10 iterations in 212 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 556/556 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 135/135 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 556/556 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2023-03-10 22:41:15] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-10 22:41:15] [INFO ] Invariant cache hit.
[2023-03-10 22:41:15] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-10 22:41:15] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-10 22:41:15] [INFO ] Invariant cache hit.
[2023-03-10 22:41:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:16] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-10 22:41:16] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-10 22:41:16] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
[2023-03-10 22:41:16] [INFO ] Invariant cache hit.
[2023-03-10 22:41:16] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 983 ms. Remains : 135/135 places, 556/556 transitions.
Starting property specific reduction for CloudDeployment-PT-6b-UpperBounds-08
Normalized transition count is 274 out of 556 initially.
// Phase 1: matrix 274 rows 135 cols
[2023-03-10 22:41:16] [INFO ] Computed 24 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 127 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 22:41:16] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
// Phase 1: matrix 274 rows 135 cols
[2023-03-10 22:41:16] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-10 22:41:16] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:16] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-10 22:41:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:16] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-10 22:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:16] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-10 22:41:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-10 22:41:16] [INFO ] Computed and/alt/rep : 178/640/178 causal constraints (skipped 60 transitions) in 22 ms.
[2023-03-10 22:41:17] [INFO ] Added : 56 causal constraints over 14 iterations in 279 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 556/556 transitions.
Graph (complete) has 1062 edges and 135 vertex of which 133 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 133 transition count 522
Applied a total of 35 rules in 14 ms. Remains 133 /135 variables (removed 2) and now considering 522/556 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 133/135 places, 522/556 transitions.
Normalized transition count is 240 out of 522 initially.
// Phase 1: matrix 240 rows 133 cols
[2023-03-10 22:41:17] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 12227 resets, run finished after 2415 ms. (steps per millisecond=414 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1622 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 1) seen :0
[2023-03-10 22:41:20] [INFO ] Flow matrix only has 240 transitions (discarded 282 similar events)
// Phase 1: matrix 240 rows 133 cols
[2023-03-10 22:41:20] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-10 22:41:20] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 22:41:20] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 22:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:20] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-10 22:41:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 22:41:20] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 22:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:20] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-10 22:41:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-10 22:41:20] [INFO ] Computed and/alt/rep : 177/639/177 causal constraints (skipped 27 transitions) in 19 ms.
[2023-03-10 22:41:21] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 6 ms to minimize.
[2023-03-10 22:41:21] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-10 22:41:21] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2023-03-10 22:41:21] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 3 ms to minimize.
[2023-03-10 22:41:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 615 ms
[2023-03-10 22:41:21] [INFO ] Added : 57 causal constraints over 12 iterations in 853 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 522/522 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 133/133 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 522/522 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2023-03-10 22:41:21] [INFO ] Flow matrix only has 240 transitions (discarded 282 similar events)
[2023-03-10 22:41:21] [INFO ] Invariant cache hit.
[2023-03-10 22:41:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-10 22:41:21] [INFO ] Flow matrix only has 240 transitions (discarded 282 similar events)
[2023-03-10 22:41:21] [INFO ] Invariant cache hit.
[2023-03-10 22:41:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:22] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-10 22:41:22] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 22:41:22] [INFO ] Flow matrix only has 240 transitions (discarded 282 similar events)
[2023-03-10 22:41:22] [INFO ] Invariant cache hit.
[2023-03-10 22:41:22] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 133/133 places, 522/522 transitions.
Ending property specific reduction for CloudDeployment-PT-6b-UpperBounds-08 in 6039 ms.
Starting property specific reduction for CloudDeployment-PT-6b-UpperBounds-12
Normalized transition count is 274 out of 556 initially.
// Phase 1: matrix 274 rows 135 cols
[2023-03-10 22:41:22] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 122 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 22:41:22] [INFO ] Flow matrix only has 274 transitions (discarded 282 similar events)
// Phase 1: matrix 274 rows 135 cols
[2023-03-10 22:41:22] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-10 22:41:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:22] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-10 22:41:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:22] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:22] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-10 22:41:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2023-03-10 22:41:22] [INFO ] Computed and/alt/rep : 178/640/178 causal constraints (skipped 60 transitions) in 24 ms.
[2023-03-10 22:41:23] [INFO ] Added : 46 causal constraints over 10 iterations in 219 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 556/556 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 134 transition count 555
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 133 transition count 554
Applied a total of 4 rules in 19 ms. Remains 133 /135 variables (removed 2) and now considering 554/556 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 133/135 places, 554/556 transitions.
Normalized transition count is 272 out of 554 initially.
// Phase 1: matrix 272 rows 133 cols
[2023-03-10 22:41:23] [INFO ] Computed 24 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12705 resets, run finished after 2610 ms. (steps per millisecond=383 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1692 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 1) seen :0
[2023-03-10 22:41:26] [INFO ] Flow matrix only has 272 transitions (discarded 282 similar events)
// Phase 1: matrix 272 rows 133 cols
[2023-03-10 22:41:26] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-10 22:41:26] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-10 22:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:26] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-10 22:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:41:26] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-10 22:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:41:26] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-10 22:41:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-10 22:41:26] [INFO ] Computed and/alt/rep : 180/673/180 causal constraints (skipped 56 transitions) in 24 ms.
[2023-03-10 22:41:27] [INFO ] Added : 59 causal constraints over 13 iterations in 273 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 554/554 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 133/133 places, 554/554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 554/554 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 554/554 (removed 0) transitions.
[2023-03-10 22:41:27] [INFO ] Flow matrix only has 272 transitions (discarded 282 similar events)
[2023-03-10 22:41:27] [INFO ] Invariant cache hit.
[2023-03-10 22:41:27] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-10 22:41:27] [INFO ] Flow matrix only has 272 transitions (discarded 282 similar events)
[2023-03-10 22:41:27] [INFO ] Invariant cache hit.
[2023-03-10 22:41:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 22:41:27] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2023-03-10 22:41:27] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 22:41:27] [INFO ] Flow matrix only has 272 transitions (discarded 282 similar events)
[2023-03-10 22:41:27] [INFO ] Invariant cache hit.
[2023-03-10 22:41:28] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 133/133 places, 554/554 transitions.
Ending property specific reduction for CloudDeployment-PT-6b-UpperBounds-12 in 5713 ms.
[2023-03-10 22:41:28] [INFO ] Flatten gal took : 143 ms
[2023-03-10 22:41:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-10 22:41:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 556 transitions and 4509 arcs took 7 ms.
Total runtime 126581 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/654/ub_0_ --maxsum=/tmp/654/ub_1_
FORMULA CloudDeployment-PT-6b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CloudDeployment-PT-6b-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678488093483

--------------------
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-6b-UpperBounds-08
ub formula formula --maxsum=/tmp/654/ub_0_
ub formula name CloudDeployment-PT-6b-UpperBounds-12
ub formula formula --maxsum=/tmp/654/ub_1_
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 135 places, 556 transitions and 4509 arcs
pnml2lts-sym: Petri net CloudDeployment_PT_6b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 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: 556->502 groups
pnml2lts-sym: Regrouping took 0.240 real 0.240 user 0.000 sys
pnml2lts-sym: state vector length is 135; there are 502 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
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 358040 group checks and 0 next state calls
pnml2lts-sym: reachability took 3.050 real 12.170 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 168824812 states, 20062 nodes
pnml2lts-sym: Maximum sum of /tmp/654/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/654/ub_1_ is: 1
pnml2lts-sym: group_next: 7107 nodes total
pnml2lts-sym: group_explored: 8861 nodes, 7897 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-6b"
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-6b, 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-167814399500437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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