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

About the Execution of Smart+red for CloudDeployment-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
311.779 39076.00 62223.00 715.20 TTFTTTFTTFFTFTTF 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.r075-smll-167814401000390.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 smartxred
Input is CloudDeployment-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-smll-167814401000390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 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 308K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678341244886

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 05:54:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 05:54:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:54:09] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-09 05:54:09] [INFO ] Transformed 859 places.
[2023-03-09 05:54:09] [INFO ] Transformed 1152 transitions.
[2023-03-09 05:54:09] [INFO ] Found NUPN structural information;
[2023-03-09 05:54:09] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 93 resets, run finished after 851 ms. (steps per millisecond=11 ) properties (out of 15) seen :7
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :1
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1152 rows 859 cols
[2023-03-09 05:54:10] [INFO ] Computed 13 place invariants in 43 ms
[2023-03-09 05:54:11] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 05:54:12] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 24 ms returned sat
[2023-03-09 05:54:13] [INFO ] After 1041ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-09 05:54:14] [INFO ] After 1853ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 595 ms.
[2023-03-09 05:54:15] [INFO ] After 3356ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 132 ms.
Support contains 26 out of 859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Graph (trivial) has 834 edges and 859 vertex of which 226 / 859 are part of one of the 22 SCC in 7 ms
Free SCC test removed 204 places
Drop transitions removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 1602 edges and 655 vertex of which 650 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 649 transition count 574
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 295 rules applied. Total rules applied 593 place count 356 transition count 572
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 607 place count 355 transition count 559
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 620 place count 342 transition count 559
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 620 place count 342 transition count 546
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 646 place count 329 transition count 546
Discarding 108 places :
Symmetric choice reduction at 4 with 108 rule applications. Total rules 754 place count 221 transition count 412
Iterating global reduction 4 with 108 rules applied. Total rules applied 862 place count 221 transition count 412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 866 place count 221 transition count 408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 866 place count 221 transition count 401
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 880 place count 214 transition count 401
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 881 place count 213 transition count 400
Iterating global reduction 5 with 1 rules applied. Total rules applied 882 place count 213 transition count 400
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 980 place count 164 transition count 351
Performed 23 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 1026 place count 141 transition count 426
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1030 place count 141 transition count 422
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 1086 place count 141 transition count 366
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1087 place count 140 transition count 361
Iterating global reduction 6 with 1 rules applied. Total rules applied 1088 place count 140 transition count 361
Free-agglomeration rule applied 32 times with reduction of 4 identical transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1120 place count 140 transition count 325
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 25 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 6 with 69 rules applied. Total rules applied 1189 place count 108 transition count 288
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1219 place count 108 transition count 258
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1220 place count 108 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1221 place count 107 transition count 257
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1224 place count 107 transition count 257
Applied a total of 1224 rules in 274 ms. Remains 107 /859 variables (removed 752) and now considering 257/1152 (removed 895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 107/859 places, 257/1152 transitions.
Incomplete random walk after 10000 steps, including 547 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 830684 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 830684 steps, saw 133657 distinct states, run finished after 3002 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 05:54:19] [INFO ] Flow matrix only has 199 transitions (discarded 58 similar events)
// Phase 1: matrix 199 rows 107 cols
[2023-03-09 05:54:19] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 05:54:19] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 05:54:19] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-09 05:54:19] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 05:54:19] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-09 05:54:19] [INFO ] After 66ms SMT Verify possible using 119 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 05:54:19] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-09 05:54:19] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 26 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 107 /107 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 107/107 places, 257/257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 107 /107 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-09 05:54:19] [INFO ] Flow matrix only has 199 transitions (discarded 58 similar events)
[2023-03-09 05:54:19] [INFO ] Invariant cache hit.
[2023-03-09 05:54:19] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-09 05:54:19] [INFO ] Flow matrix only has 199 transitions (discarded 58 similar events)
[2023-03-09 05:54:19] [INFO ] Invariant cache hit.
[2023-03-09 05:54:19] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-09 05:54:20] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-09 05:54:20] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-09 05:54:20] [INFO ] Flow matrix only has 199 transitions (discarded 58 similar events)
[2023-03-09 05:54:20] [INFO ] Invariant cache hit.
[2023-03-09 05:54:20] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 107/107 places, 257/257 transitions.
Graph (trivial) has 63 edges and 107 vertex of which 11 / 107 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 15 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 73 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 98 transition count 178
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 92 transition count 175
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 89 transition count 175
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 89 transition count 172
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 86 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 84 transition count 170
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 84 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 82 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 82 transition count 164
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 51 place count 82 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 59 place count 78 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 77 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 63 place count 77 transition count 140
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 72 place count 77 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 77 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 place count 75 transition count 129
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 78 place count 75 transition count 129
Applied a total of 78 rules in 69 ms. Remains 75 /107 variables (removed 32) and now considering 129/257 (removed 128) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 129 rows 75 cols
[2023-03-09 05:54:20] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-09 05:54:20] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 05:54:20] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 05:54:20] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 05:54:20] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-09 05:54:20] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-09 05:54:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-09 05:54:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 257 transitions and 1652 arcs took 5 ms.
[2023-03-09 05:54:21] [INFO ] Flatten gal took : 103 ms
Total runtime 12709 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CloudDeployment (PT), instance 3b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 107 places, 257 transitions, 1652 arcs.
Final Score: 2022.699
Took : 20 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CloudDeployment-PT-3b-ReachabilityCardinality-00 (reachable & potential(( ( ( ( (tk(P3)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P3)) ) ) & ( ( ( (tk(P49)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P49)) ) ) & ( ( (tk(P69)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P69)) ) ) ) ) & ( ( ( ( (tk(P78)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P78)) ) ) & ( ( ( (tk(P47)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P47)) ) ) | ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P12)) ) ) ) ) & ( ( ( ( ( (tk(P83)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P83)) ) ) | ( ( (tk(P94)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P94)) ) ) ) | ( ( ( (tk(P42)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P42)) ) ) | ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) | ( ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) & ( ( ( (tk(P65)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P65)) ) ) & ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) | ( ( (tk(P14)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P14)) ) ) ) ) ) ) ) ) & ( ( ( (tk(P81)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P81)) ) ) | ( ( ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) & ( ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) & ( ( (tk(P20)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P20)) ) ) ) ) | ( ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) & ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) ) & ( ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) & ( ( ( ( (tk(P59)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P59)) ) ) & ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) ) | ( ( ( (tk(P1)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1)) ) ) & ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: CloudDeployment-PT-3b-ReachabilityCardinality-03 (reachable & potential(( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) )))
PROPERTY: CloudDeployment-PT-3b-ReachabilityCardinality-15 (reachable &!potential( ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) )))
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CloudDeployment-PT-3b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678341283962

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-3b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is CloudDeployment-PT-3b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-smll-167814401000390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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