Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620504900615.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CloudDeployment-PT-6b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504900615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716472100156

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 13:48:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 13:48:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:48:21] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2024-05-23 13:48:21] [INFO ] Transformed 1888 places.
[2024-05-23 13:48:21] [INFO ] Transformed 6804 transitions.
[2024-05-23 13:48:21] [INFO ] Found NUPN structural information;
[2024-05-23 13:48:21] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 584 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (201 resets) in 2177 ms. (18 steps per ms) remains 13/16 properties
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (14 resets) in 677 ms. (59 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 501 ms. (79 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (22 resets) in 867 ms. (46 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (28 resets) in 386 ms. (103 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (21 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (22 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (14 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 248 ms. (160 steps per ms) remains 13/13 properties
// Phase 1: matrix 6804 rows 1888 cols
[2024-05-23 13:48:24] [INFO ] Computed 25 invariants in 167 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1744/1887 variables, 24/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1887 variables, 1744/1912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1887 variables, 0/1912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 6804/8691 variables, 1887/3799 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8691/8692 variables, and 3799 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5057 ms.
Refiners :[Domain max(s): 1887/1888 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1887/1888 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1744/1887 variables, 24/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1887 variables, 1744/1912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1887 variables, 0/1912 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8691/8692 variables, and 3799 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5028 ms.
Refiners :[Domain max(s): 1887/1888 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 1887/1888 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 12035ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 143 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1662 edges and 1888 vertex of which 273 / 1888 are part of one of the 33 SCC in 13 ms
Free SCC test removed 240 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Graph (complete) has 4566 edges and 1648 vertex of which 1637 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.22 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 671 transitions
Trivial Post-agglo rules discarded 671 transitions
Performed 671 trivial Post agglomeration. Transition count delta: 671
Iterating post reduction 0 with 676 rules applied. Total rules applied 678 place count 1637 transition count 5829
Reduce places removed 671 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 688 rules applied. Total rules applied 1366 place count 966 transition count 5812
Reduce places removed 6 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 2 with 70 rules applied. Total rules applied 1436 place count 960 transition count 5748
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 67 rules applied. Total rules applied 1503 place count 896 transition count 5745
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1503 place count 896 transition count 5697
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1599 place count 848 transition count 5697
Discarding 302 places :
Symmetric choice reduction at 4 with 302 rule applications. Total rules 1901 place count 546 transition count 5395
Iterating global reduction 4 with 302 rules applied. Total rules applied 2203 place count 546 transition count 5395
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 2228 place count 546 transition count 5370
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 2228 place count 546 transition count 5357
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 2254 place count 533 transition count 5357
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2258 place count 529 transition count 5353
Iterating global reduction 5 with 4 rules applied. Total rules applied 2262 place count 529 transition count 5353
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2264 place count 527 transition count 5351
Iterating global reduction 5 with 2 rules applied. Total rules applied 2266 place count 527 transition count 5351
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2268 place count 525 transition count 5349
Iterating global reduction 5 with 2 rules applied. Total rules applied 2270 place count 525 transition count 5349
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2271 place count 524 transition count 5348
Iterating global reduction 5 with 1 rules applied. Total rules applied 2272 place count 524 transition count 5348
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 2476 place count 422 transition count 5246
Performed 48 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 2572 place count 374 transition count 5517
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2583 place count 374 transition count 5506
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 2593 place count 369 transition count 5556
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 2624 place count 369 transition count 5525
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 2647 place count 369 transition count 5502
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 2688 place count 346 transition count 5484
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 2695 place count 346 transition count 5477
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 2711 place count 346 transition count 5477
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 2715 place count 346 transition count 5473
Applied a total of 2715 rules in 1152 ms. Remains 346 /1888 variables (removed 1542) and now considering 5473/6804 (removed 1331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1165 ms. Remains : 346/1888 places, 5473/6804 transitions.
RANDOM walk for 40000 steps (551 resets) in 1967 ms. (20 steps per ms) remains 12/13 properties
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 387 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (70 resets) in 626 ms. (63 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (68 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (67 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (69 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (62 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (63 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (65 resets) in 383 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (49 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (34 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (71 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 150704 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 12
Probabilistic random walk after 150704 steps, saw 31345 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-23 13:48:41] [INFO ] Flow matrix only has 5278 transitions (discarded 195 similar events)
// Phase 1: matrix 5278 rows 346 cols
[2024-05-23 13:48:41] [INFO ] Computed 24 invariants in 65 ms
[2024-05-23 13:48:41] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 195/327 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 5273/5600 variables, 327/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5600 variables, 85/436 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5600 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-01 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-05 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-15 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 24/5624 variables, 19/455 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5624 variables, 7/462 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5624 variables, 0/462 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/5624 variables, 0/462 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5624/5624 variables, and 462 constraints, problems are : Problem set: 3 solved, 9 unsolved in 8514 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 346/346 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 227/320 variables, 23/24 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5258/5578 variables, 320/344 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5578 variables, 85/429 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5578 variables, 0/429 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-03 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-04 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-06 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-07 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-09 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem CloudDeployment-PT-6b-ReachabilityFireability-2024-13 is UNSAT
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 36/5614 variables, 20/449 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5614 variables, 1/450 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5614 variables, 0/450 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/5621 variables, 4/454 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5621 variables, 6/460 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5621 variables, 0/460 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/5624 variables, 2/462 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5624 variables, 0/462 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/5624 variables, 0/462 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5624/5624 variables, and 462 constraints, problems are : Problem set: 9 solved, 3 unsolved in 4176 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 346/346 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13952ms problems are : Problem set: 9 solved, 3 unsolved
Parikh walk visited 0 properties in 846 ms.
Support contains 71 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 5473/5473 transitions.
Graph (trivial) has 176 edges and 346 vertex of which 36 / 346 are part of one of the 15 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 2571 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 324 transition count 5416
Reduce places removed 12 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 312 transition count 5411
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 307 transition count 5411
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 37 place count 307 transition count 5397
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 65 place count 293 transition count 5397
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 290 transition count 5394
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 290 transition count 5394
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 121 place count 265 transition count 5369
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 265 transition count 5367
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 133 place count 260 transition count 5412
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 141 place count 260 transition count 5404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 259 transition count 5417
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 151 place count 259 transition count 5409
Drop transitions (Redundant composition of simpler transitions.) removed 156 transitions
Redundant transition composition rules discarded 156 transitions
Iterating global reduction 6 with 156 rules applied. Total rules applied 307 place count 259 transition count 5253
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 324 place count 259 transition count 5236
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 57 rules applied. Total rules applied 381 place count 242 transition count 5196
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 382 place count 241 transition count 5188
Iterating global reduction 7 with 1 rules applied. Total rules applied 383 place count 241 transition count 5188
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 405 place count 241 transition count 5166
Applied a total of 405 rules in 485 ms. Remains 241 /346 variables (removed 105) and now considering 5166/5473 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 241/346 places, 5166/5473 transitions.
RANDOM walk for 40000 steps (571 resets) in 1715 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (30 resets) in 368 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 246674 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 246674 steps, saw 42525 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-23 13:49:00] [INFO ] Flow matrix only has 4889 transitions (discarded 277 similar events)
// Phase 1: matrix 4889 rows 241 cols
[2024-05-23 13:49:00] [INFO ] Computed 25 invariants in 55 ms
[2024-05-23 13:49:00] [INFO ] State equation strengthened by 175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 169/240 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4889/5129 variables, 240/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5129 variables, 175/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5129 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/5130 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5130 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/5130 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5130/5130 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2368 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/241 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 169/240 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4889/5129 variables, 240/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5129 variables, 175/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5129 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/5130 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5130 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/5130 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5130/5130 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2162 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 241/241 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4963ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 441 ms.
Support contains 71 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 5166/5166 transitions.
Applied a total of 0 rules in 46 ms. Remains 241 /241 variables (removed 0) and now considering 5166/5166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 241/241 places, 5166/5166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 5166/5166 transitions.
Applied a total of 0 rules in 46 ms. Remains 241 /241 variables (removed 0) and now considering 5166/5166 (removed 0) transitions.
[2024-05-23 13:49:06] [INFO ] Flow matrix only has 4889 transitions (discarded 277 similar events)
[2024-05-23 13:49:06] [INFO ] Invariant cache hit.
[2024-05-23 13:49:06] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-23 13:49:06] [INFO ] Flow matrix only has 4889 transitions (discarded 277 similar events)
[2024-05-23 13:49:06] [INFO ] Invariant cache hit.
[2024-05-23 13:49:07] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-23 13:49:07] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2024-05-23 13:49:08] [INFO ] Redundant transitions in 1266 ms returned []
Running 5165 sub problems to find dead transitions.
[2024-05-23 13:49:08] [INFO ] Flow matrix only has 4889 transitions (discarded 277 similar events)
[2024-05-23 13:49:08] [INFO ] Invariant cache hit.
[2024-05-23 13:49:08] [INFO ] State equation strengthened by 175 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 5165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/5130 variables, and 25 constraints, problems are : Problem set: 0 solved, 5165 unsolved in 30095 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/241 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 5165/1069 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 5165 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/5130 variables, and 25 constraints, problems are : Problem set: 0 solved, 5165 unsolved in 30065 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/241 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 4096/1069 constraints, Known Traps: 0/0 constraints]
After SMT, in 142477ms problems are : Problem set: 0 solved, 5165 unsolved
Search for dead transitions found 0 dead transitions in 142545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145400 ms. Remains : 241/241 places, 5166/5166 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 91 edges and 241 vertex of which 9 / 241 are part of one of the 1 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 283 transitions
Reduce isomorphic transitions removed 296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 233 transition count 4867
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 230 transition count 4866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 229 transition count 4866
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 9 place count 229 transition count 4858
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 25 place count 221 transition count 4858
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 220 transition count 4857
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 220 transition count 4857
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 35 place count 216 transition count 4853
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 72 place count 216 transition count 4816
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 216 transition count 4815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 215 transition count 4815
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 76 place count 213 transition count 4801
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 213 transition count 4801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 212 transition count 4811
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 87 place count 212 transition count 4804
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 94 place count 205 transition count 4804
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 108 place count 205 transition count 4804
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 109 place count 205 transition count 4803
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 205 transition count 4803
Applied a total of 110 rules in 565 ms. Remains 205 /241 variables (removed 36) and now considering 4803/5166 (removed 363) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4803 rows 205 cols
[2024-05-23 13:51:32] [INFO ] Computed 25 invariants in 42 ms
[2024-05-23 13:51:32] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 13:51:32] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 6 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-23 13:51:33] [INFO ] After 1106ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :3
[2024-05-23 13:51:33] [INFO ] After 1181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2170 ms.
[2024-05-23 13:51:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2024-05-23 13:51:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 241 places, 5166 transitions and 89705 arcs took 67 ms.
[2024-05-23 13:51:35] [INFO ] Flatten gal took : 1280 ms
Total runtime 193956 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-6b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/400/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 241
TRANSITIONS: 5166
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.396s, Sys 0.020s]


SAVING FILE /home/mcc/execution/400/model (.net / .def) ...
EXPORT TIME: [User 0.031s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 586
MODEL NAME: /home/mcc/execution/400/model
241 places, 5166 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-6b-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716472604550

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudDeployment-PT-6b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504900615"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;