fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620504900622
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CloudDeployment-PT-7a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1174.560 92736.00 138804.00 358.50 TFFFFTTTFFFTTTFF normal

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-171620504900622.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-7a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504900622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:04 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 420K 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-7a-ReachabilityCardinality-2024-00
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-01
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-02
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-03
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-04
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-05
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-06
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-07
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-08
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-09
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-10
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-11
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-12
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-13
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-14
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716473433110

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:10:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 14:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:10:34] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-23 14:10:34] [INFO ] Transformed 264 places.
[2024-05-23 14:10:34] [INFO ] Transformed 1174 transitions.
[2024-05-23 14:10:34] [INFO ] Found NUPN structural information;
[2024-05-23 14:10:34] [INFO ] Parsed PT model containing 264 places and 1174 transitions and 7331 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 transitions.
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (390 resets) in 1785 ms. (22 steps per ms) remains 3/9 properties
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 512 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (35 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (39 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
[2024-05-23 14:10:35] [INFO ] Flow matrix only has 475 transitions (discarded 545 similar events)
// Phase 1: matrix 475 rows 264 cols
[2024-05-23 14:10:35] [INFO ] Computed 42 invariants in 22 ms
[2024-05-23 14:10:35] [INFO ] State equation strengthened by 240 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem CloudDeployment-PT-7a-ReachabilityCardinality-2024-09 is UNSAT
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 216/252 variables, 31/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 216/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/263 variables, 11/294 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 11/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 474/737 variables, 263/568 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 239/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/737 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/738 variables, 1/808 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 1/809 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 0/809 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/739 variables, 1/810 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/739 variables, 0/810 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/739 variables, 0/810 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 810 constraints, problems are : Problem set: 1 solved, 2 unsolved in 711 ms.
Refiners :[Domain max(s): 264/264 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 264/264 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 173/190 variables, 15/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 173/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 73/263 variables, 27/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 73/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 474/737 variables, 263/568 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 239/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/737 variables, 2/809 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 0/809 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/738 variables, 1/810 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 1/811 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/738 variables, 0/811 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/739 variables, 1/812 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/739 variables, 0/812 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/739 variables, 0/812 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 812 constraints, problems are : Problem set: 1 solved, 2 unsolved in 716 ms.
Refiners :[Domain max(s): 264/264 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 264/264 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1565ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 17 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1020/1020 transitions.
Graph (trivial) has 254 edges and 264 vertex of which 57 / 264 are part of one of the 18 SCC in 3 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 232 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 279 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 213 transition count 741
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 24 place count 202 transition count 688
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 202 transition count 688
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 198 transition count 684
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 198 transition count 684
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 195 transition count 681
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 195 transition count 681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 193 transition count 679
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 193 transition count 679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 192 transition count 678
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 192 transition count 678
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 95 place count 172 transition count 768
Drop transitions (Redundant composition of simpler transitions.) removed 141 transitions
Redundant transition composition rules discarded 141 transitions
Iterating global reduction 1 with 141 rules applied. Total rules applied 236 place count 172 transition count 627
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 172 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 238 place count 171 transition count 626
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 246 place count 171 transition count 691
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 254 place count 163 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 270 place count 163 transition count 675
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 163 transition count 675
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 162 transition count 674
Applied a total of 272 rules in 270 ms. Remains 162 /264 variables (removed 102) and now considering 674/1020 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 162/264 places, 674/1020 transitions.
RANDOM walk for 40000 steps (474 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (54 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (50 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 517685 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 517685 steps, saw 100110 distinct states, run finished after 3007 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-23 14:10:40] [INFO ] Flow matrix only has 324 transitions (discarded 350 similar events)
// Phase 1: matrix 324 rows 162 cols
[2024-05-23 14:10:40] [INFO ] Computed 30 invariants in 5 ms
[2024-05-23 14:10:40] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/136 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/162 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/486 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 201 constraints, problems are : Problem set: 0 solved, 2 unsolved in 168 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 162/162 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/136 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/162 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/486 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 162/162 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 17 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 674/674 transitions.
Applied a total of 0 rules in 14 ms. Remains 162 /162 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 162/162 places, 674/674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 674/674 transitions.
Applied a total of 0 rules in 13 ms. Remains 162 /162 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-05-23 14:10:41] [INFO ] Flow matrix only has 324 transitions (discarded 350 similar events)
[2024-05-23 14:10:41] [INFO ] Invariant cache hit.
[2024-05-23 14:10:41] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-23 14:10:41] [INFO ] Flow matrix only has 324 transitions (discarded 350 similar events)
[2024-05-23 14:10:41] [INFO ] Invariant cache hit.
[2024-05-23 14:10:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 14:10:41] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-23 14:10:41] [INFO ] Redundant transitions in 36 ms returned []
Running 625 sub problems to find dead transitions.
[2024-05-23 14:10:41] [INFO ] Flow matrix only has 324 transitions (discarded 350 similar events)
[2024-05-23 14:10:41] [INFO ] Invariant cache hit.
[2024-05-23 14:10:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 7/162 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (OVERLAPS) 324/486 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 625 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 201 constraints, problems are : Problem set: 0 solved, 625 unsolved in 25953 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 162/162 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 7/162 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (OVERLAPS) 324/486 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 625/826 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 826 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 162/162 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 0/0 constraints]
After SMT, in 57198ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 57210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57714 ms. Remains : 162/162 places, 674/674 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 162 vertex of which 33 / 162 are part of one of the 6 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 387 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 122 transition count 259
Reduce places removed 28 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 32 rules applied. Total rules applied 74 place count 94 transition count 255
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 90 transition count 255
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 78 place count 90 transition count 244
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 100 place count 79 transition count 244
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 76 transition count 241
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 76 transition count 241
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 73 transition count 220
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 73 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 73 transition count 217
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 123 place count 69 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 137 place count 69 transition count 199
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 69 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 141 place count 67 transition count 197
Free-agglomeration rule applied 6 times with reduction of 16 identical transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 147 place count 67 transition count 175
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 185 place count 61 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 61 transition count 142
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 61 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 188 place count 61 transition count 141
Applied a total of 188 rules in 72 ms. Remains 61 /162 variables (removed 101) and now considering 141/674 (removed 533) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 141 rows 61 cols
[2024-05-23 14:11:39] [INFO ] Computed 17 invariants in 2 ms
[2024-05-23 14:11:39] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 14:11:39] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 14:11:39] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 14:11:39] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 14:11:39] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 252 ms.
[2024-05-23 14:11:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-23 14:11:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 162 places, 674 transitions and 5554 arcs took 10 ms.
[2024-05-23 14:11:39] [INFO ] Flatten gal took : 108 ms
Total runtime 65233 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-7a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 162
TRANSITIONS: 674
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
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: 571
MODEL NAME: /home/mcc/execution/410/model
162 places, 674 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-7a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716473525846

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-7a"
export BK_EXAMINATION="ReachabilityCardinality"
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-7a, 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 r069-tall-171620504900622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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