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

About the Execution of Marcie+red for CloudDeployment-PT-7b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7950.451 3600000.00 3660594.00 12137.00 FTFF?TFFT??F?FTF 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.r074-smll-167814400300454.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 marciexred
Input is CloudDeployment-PT-7b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400300454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:47 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 4.0K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 14:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 20M 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-7b-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678516632284

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 06:37:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:37:17] [INFO ] Load time of PNML (sax parser for PT used): 1736 ms
[2023-03-11 06:37:17] [INFO ] Transformed 2271 places.
[2023-03-11 06:37:17] [INFO ] Transformed 19752 transitions.
[2023-03-11 06:37:17] [INFO ] Found NUPN structural information;
[2023-03-11 06:37:17] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 2036 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 43 resets, run finished after 1271 ms. (steps per millisecond=7 ) properties (out of 14) seen :4
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 19752 rows 2271 cols
[2023-03-11 06:37:21] [INFO ] Computed 29 place invariants in 998 ms
[2023-03-11 06:37:22] [INFO ] After 1486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 06:37:24] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 65 ms returned sat
[2023-03-11 06:37:47] [INFO ] After 23220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 06:37:47] [INFO ] After 23296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 06:37:47] [INFO ] After 25141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 5 different solutions.
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 283 ms.
Support contains 60 out of 2271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Graph (trivial) has 2182 edges and 2271 vertex of which 517 / 2271 are part of one of the 50 SCC in 26 ms
Free SCC test removed 467 places
Drop transitions removed 8763 transitions
Reduce isomorphic transitions removed 8763 transitions.
Graph (complete) has 5552 edges and 1804 vertex of which 1790 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.72 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 1 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 780 transitions
Trivial Post-agglo rules discarded 780 transitions
Performed 780 trivial Post agglomeration. Transition count delta: 780
Iterating post reduction 0 with 787 rules applied. Total rules applied 789 place count 1789 transition count 10197
Reduce places removed 780 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 784 rules applied. Total rules applied 1573 place count 1009 transition count 10193
Reduce places removed 1 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 25 rules applied. Total rules applied 1598 place count 1008 transition count 10169
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1622 place count 984 transition count 10169
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1622 place count 984 transition count 10140
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1680 place count 955 transition count 10140
Discarding 403 places :
Symmetric choice reduction at 4 with 403 rule applications. Total rules 2083 place count 552 transition count 1559
Iterating global reduction 4 with 403 rules applied. Total rules applied 2486 place count 552 transition count 1559
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 2524 place count 552 transition count 1521
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 2524 place count 552 transition count 1510
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2546 place count 541 transition count 1510
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2550 place count 537 transition count 1506
Iterating global reduction 5 with 4 rules applied. Total rules applied 2554 place count 537 transition count 1506
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2557 place count 534 transition count 1503
Iterating global reduction 5 with 3 rules applied. Total rules applied 2560 place count 534 transition count 1503
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2563 place count 531 transition count 1500
Iterating global reduction 5 with 3 rules applied. Total rules applied 2566 place count 531 transition count 1500
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2568 place count 529 transition count 1498
Iterating global reduction 5 with 2 rules applied. Total rules applied 2570 place count 529 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2571 place count 528 transition count 1497
Iterating global reduction 5 with 1 rules applied. Total rules applied 2572 place count 528 transition count 1497
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 2 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 2818 place count 405 transition count 1374
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -205
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 2900 place count 364 transition count 1579
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 2915 place count 364 transition count 1564
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 2929 place count 357 transition count 1648
Drop transitions removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 6 with 133 rules applied. Total rules applied 3062 place count 357 transition count 1515
Free-agglomeration rule applied 81 times with reduction of 24 identical transitions.
Iterating global reduction 6 with 81 rules applied. Total rules applied 3143 place count 357 transition count 1410
Reduce places removed 81 places and 0 transitions.
Drop transitions removed 147 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 6 with 291 rules applied. Total rules applied 3434 place count 276 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3435 place count 275 transition count 1192
Iterating global reduction 7 with 1 rules applied. Total rules applied 3436 place count 275 transition count 1192
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 7 with 162 rules applied. Total rules applied 3598 place count 275 transition count 1030
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 3603 place count 275 transition count 1051
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3608 place count 270 transition count 1051
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 3613 place count 270 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3614 place count 269 transition count 1050
Applied a total of 3614 rules in 3522 ms. Remains 269 /2271 variables (removed 2002) and now considering 1050/19752 (removed 18702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3527 ms. Remains : 269/2271 places, 1050/19752 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 7) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
[2023-03-11 06:37:52] [INFO ] Flow matrix only has 652 transitions (discarded 398 similar events)
// Phase 1: matrix 652 rows 269 cols
[2023-03-11 06:37:52] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-11 06:37:52] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:37:52] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-11 06:37:52] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:37:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 06:37:53] [INFO ] After 220ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:37:53] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-11 06:37:53] [INFO ] After 1300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 28 ms.
Support contains 40 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 1050/1050 transitions.
Graph (trivial) has 114 edges and 269 vertex of which 14 / 269 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 14 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 21 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 261 transition count 1023
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 255 transition count 1023
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 255 transition count 1021
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 17 place count 253 transition count 1021
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 250 transition count 1004
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 250 transition count 1004
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 241 transition count 995
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 241 transition count 993
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 240 transition count 985
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 240 transition count 985
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 240 transition count 981
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 240 transition count 975
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 42 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 110 place count 234 transition count 926
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 233 transition count 918
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 233 transition count 918
Applied a total of 112 rules in 169 ms. Remains 233 /269 variables (removed 36) and now considering 918/1050 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 233/269 places, 918/1050 transitions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 308788 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308788 steps, saw 55869 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:37:57] [INFO ] Flow matrix only has 572 transitions (discarded 346 similar events)
// Phase 1: matrix 572 rows 233 cols
[2023-03-11 06:37:57] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-11 06:37:57] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:37:57] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-11 06:37:58] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:37:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 06:37:58] [INFO ] After 203ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:37:58] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-11 06:37:58] [INFO ] After 1271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 38 ms.
Support contains 40 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 918/918 transitions.
Applied a total of 0 rules in 44 ms. Remains 233 /233 variables (removed 0) and now considering 918/918 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 233/233 places, 918/918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 918/918 transitions.
Applied a total of 0 rules in 40 ms. Remains 233 /233 variables (removed 0) and now considering 918/918 (removed 0) transitions.
[2023-03-11 06:37:58] [INFO ] Flow matrix only has 572 transitions (discarded 346 similar events)
[2023-03-11 06:37:58] [INFO ] Invariant cache hit.
[2023-03-11 06:37:59] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-11 06:37:59] [INFO ] Flow matrix only has 572 transitions (discarded 346 similar events)
[2023-03-11 06:37:59] [INFO ] Invariant cache hit.
[2023-03-11 06:37:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 06:37:59] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2023-03-11 06:38:00] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-11 06:38:00] [INFO ] Flow matrix only has 572 transitions (discarded 346 similar events)
[2023-03-11 06:38:00] [INFO ] Invariant cache hit.
[2023-03-11 06:38:01] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2367 ms. Remains : 233/233 places, 918/918 transitions.
Graph (trivial) has 177 edges and 233 vertex of which 32 / 233 are part of one of the 5 SCC in 1 ms
Free SCC test removed 27 places
Drop transitions removed 42 transitions
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 390 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 206 transition count 498
Reduce places removed 30 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 32 rules applied. Total rules applied 63 place count 176 transition count 496
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 175 transition count 494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 173 transition count 494
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 68 place count 173 transition count 485
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 86 place count 164 transition count 485
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 91 place count 159 transition count 480
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 159 transition count 480
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 101 place count 154 transition count 445
Iterating global reduction 4 with 5 rules applied. Total rules applied 106 place count 154 transition count 445
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 4 with 104 rules applied. Total rules applied 210 place count 154 transition count 341
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 226 place count 146 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 146 transition count 332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 231 place count 144 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 235 place count 144 transition count 352
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 267 place count 144 transition count 320
Free-agglomeration rule applied 10 times with reduction of 8 identical transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 277 place count 144 transition count 302
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 295 place count 134 transition count 294
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 298 place count 134 transition count 291
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 303 place count 134 transition count 291
Applied a total of 303 rules in 61 ms. Remains 134 /233 variables (removed 99) and now considering 291/918 (removed 627) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 291 rows 134 cols
[2023-03-11 06:38:01] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-11 06:38:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:38:01] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-11 06:38:01] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:38:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:38:01] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:38:01] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-11 06:38:01] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:38:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-11 06:38:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 918 transitions and 7497 arcs took 12 ms.
[2023-03-11 06:38:02] [INFO ] Flatten gal took : 335 ms
Total runtime 47026 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: CloudDeployment_PT_7b
(NrP: 233 NrTr: 918 NrArc: 7497)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.089sec

net check time: 0m 0.001sec

init dd package: 0m 3.418sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8175636 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16078736 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

20116 114139 325700 383332 389203 781442 815548

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-7b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CloudDeployment-PT-7b, 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 r074-smll-167814400300454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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