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.r078-tall-171620515500373.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-5b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-171620515500373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 15:44 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 1.5M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716273370099

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 06:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-21 06:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:36:11] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-21 06:36:11] [INFO ] Transformed 1525 places.
[2024-05-21 06:36:11] [INFO ] Transformed 3132 transitions.
[2024-05-21 06:36:11] [INFO ] Found NUPN structural information;
[2024-05-21 06:36:11] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 351 ms.
Graph (trivial) has 1546 edges and 1525 vertex of which 420 / 1525 are part of one of the 40 SCC in 7 ms
Free SCC test removed 380 places
Structural test allowed to assert that 535 places are NOT stable. Took 42 ms.
Ensure Unique test removed 425 transitions
Reduce redundant transitions removed 425 transitions.
RANDOM walk for 40000 steps (292 resets) in 3102 ms. (12 steps per ms) remains 482/990 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 49 ms. (8 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 23 ms. (16 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 22 ms. (17 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 21 ms. (18 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 482/482 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 482/482 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 482/482 properties
[2024-05-21 06:36:13] [INFO ] Flow matrix only has 2668 transitions (discarded 39 similar events)
// Phase 1: matrix 2668 rows 1145 cols
[2024-05-21 06:36:13] [INFO ] Computed 21 invariants in 60 ms
[2024-05-21 06:36:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 482/482 constraints. Problems are: Problem set: 0 solved, 482 unsolved
SMT process timed out in 5569ms, After SMT, problems are : Problem set: 0 solved, 482 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 482 out of 1145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1145/1145 places, 2707/2707 transitions.
Graph (complete) has 3262 edges and 1145 vertex of which 1143 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 362 rules applied. Total rules applied 363 place count 1143 transition count 2344
Reduce places removed 321 places and 0 transitions.
Iterating post reduction 1 with 321 rules applied. Total rules applied 684 place count 822 transition count 2344
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 684 place count 822 transition count 2337
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 698 place count 815 transition count 2337
Discarding 133 places :
Symmetric choice reduction at 2 with 133 rule applications. Total rules 831 place count 682 transition count 2204
Iterating global reduction 2 with 133 rules applied. Total rules applied 964 place count 682 transition count 2204
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 984 place count 682 transition count 2184
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1076 place count 636 transition count 2138
Performed 30 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1136 place count 606 transition count 2203
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1137 place count 606 transition count 2202
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1157 place count 606 transition count 2182
Free-agglomeration rule applied 57 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 57 rules applied. Total rules applied 1214 place count 606 transition count 2105
Reduce places removed 57 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 137 rules applied. Total rules applied 1351 place count 549 transition count 2025
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1352 place count 549 transition count 2024
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1353 place count 549 transition count 2024
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1354 place count 549 transition count 2024
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1355 place count 548 transition count 2023
Applied a total of 1355 rules in 588 ms. Remains 548 /1145 variables (removed 597) and now considering 2023/2707 (removed 684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 598 ms. Remains : 548/1145 places, 2023/2707 transitions.
RANDOM walk for 4000000 steps (43561 resets) in 40667 ms. (98 steps per ms) remains 24/482 properties
BEST_FIRST walk for 400003 steps (520 resets) in 602 ms. (663 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (524 resets) in 522 ms. (764 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (540 resets) in 510 ms. (782 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (524 resets) in 503 ms. (793 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (524 resets) in 510 ms. (782 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (530 resets) in 500 ms. (798 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (525 resets) in 508 ms. (785 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (526 resets) in 511 ms. (781 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (526 resets) in 504 ms. (792 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (528 resets) in 508 ms. (785 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (531 resets) in 503 ms. (793 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (526 resets) in 506 ms. (788 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (523 resets) in 502 ms. (795 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (532 resets) in 510 ms. (782 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (537 resets) in 513 ms. (778 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (519 resets) in 635 ms. (628 steps per ms) remains 22/24 properties
BEST_FIRST walk for 400004 steps (518 resets) in 552 ms. (723 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (516 resets) in 528 ms. (756 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (532 resets) in 533 ms. (749 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (528 resets) in 541 ms. (738 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (523 resets) in 677 ms. (589 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (524 resets) in 838 ms. (476 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (518 resets) in 692 ms. (577 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (513 resets) in 710 ms. (562 steps per ms) remains 22/22 properties
// Phase 1: matrix 2023 rows 548 cols
[2024-05-21 06:36:33] [INFO ] Computed 21 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 470/492 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 56/548 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 2023/2571 variables, 548/569 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2571 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/2571 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2571/2571 variables, and 569 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2173 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 22/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 470/492 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 56/548 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 2023/2571 variables, 548/569 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2571 variables, 20/589 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2571 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/2571 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2571/2571 variables, and 589 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4910 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 22/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 7274ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 22 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 2023/2023 transitions.
Graph (complete) has 2203 edges and 548 vertex of which 540 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 540 transition count 1802
Reduce places removed 213 places and 0 transitions.
Iterating post reduction 1 with 213 rules applied. Total rules applied 431 place count 327 transition count 1802
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 431 place count 327 transition count 1778
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 479 place count 303 transition count 1778
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 559 place count 223 transition count 1681
Iterating global reduction 2 with 80 rules applied. Total rules applied 639 place count 223 transition count 1681
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 669 place count 223 transition count 1651
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 669 place count 223 transition count 1646
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 679 place count 218 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 682 place count 215 transition count 1643
Iterating global reduction 3 with 3 rules applied. Total rules applied 685 place count 215 transition count 1643
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 687 place count 213 transition count 1641
Iterating global reduction 3 with 2 rules applied. Total rules applied 689 place count 213 transition count 1641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 690 place count 212 transition count 1640
Iterating global reduction 3 with 1 rules applied. Total rules applied 691 place count 212 transition count 1640
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 789 place count 163 transition count 1591
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 799 place count 163 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 800 place count 162 transition count 1575
Iterating global reduction 4 with 1 rules applied. Total rules applied 801 place count 162 transition count 1575
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -167
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 841 place count 142 transition count 1742
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 860 place count 142 transition count 1723
Drop transitions (Redundant composition of simpler transitions.) removed 236 transitions
Redundant transition composition rules discarded 236 transitions
Iterating global reduction 5 with 236 rules applied. Total rules applied 1096 place count 142 transition count 1487
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1101 place count 142 transition count 1482
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1130 place count 137 transition count 1458
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1134 place count 133 transition count 1434
Iterating global reduction 6 with 4 rules applied. Total rules applied 1138 place count 133 transition count 1434
Applied a total of 1138 rules in 242 ms. Remains 133 /548 variables (removed 415) and now considering 1434/2023 (removed 589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 133/548 places, 1434/2023 transitions.
RANDOM walk for 4000000 steps (91484 resets) in 31743 ms. (126 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (1244 resets) in 532 ms. (750 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1219 resets) in 527 ms. (757 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1227 resets) in 534 ms. (747 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (1244 resets) in 529 ms. (754 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (1243 resets) in 526 ms. (759 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1231 resets) in 533 ms. (749 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (1211 resets) in 522 ms. (764 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1232 resets) in 529 ms. (754 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1236 resets) in 526 ms. (759 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1229 resets) in 541 ms. (738 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (1214 resets) in 516 ms. (773 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1225 resets) in 521 ms. (766 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (1232 resets) in 528 ms. (756 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (1246 resets) in 520 ms. (767 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1221 resets) in 523 ms. (763 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1252 resets) in 545 ms. (732 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1220 resets) in 528 ms. (756 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1246 resets) in 526 ms. (759 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1224 resets) in 527 ms. (757 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (1232 resets) in 524 ms. (761 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1226 resets) in 522 ms. (764 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (1243 resets) in 530 ms. (753 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 5293282 steps, run timeout after 36001 ms. (steps per millisecond=147 ) properties seen :0 out of 22
Probabilistic random walk after 5293282 steps, saw 659324 distinct states, run finished after 36008 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-21 06:37:30] [INFO ] Flow matrix only has 1239 transitions (discarded 195 similar events)
// Phase 1: matrix 1239 rows 133 cols
[2024-05-21 06:37:30] [INFO ] Computed 21 invariants in 18 ms
[2024-05-21 06:37:30] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 81/103 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 30/133 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1372 variables, 133/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1372 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1372 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/1372 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1372/1372 variables, and 159 constraints, problems are : Problem set: 0 solved, 22 unsolved in 785 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 133/133 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 22/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 81/103 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 30/133 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1372 variables, 133/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1372 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1372 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1372 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/1372 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1372/1372 variables, and 179 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2801 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 133/133 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 22/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 3731ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 6 different solutions.
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 22 properties in 125 ms.
Able to resolve query StableMarking after proving 992 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 82659 ms.
ITS solved all properties within timeout

BK_STOP 1716273453988

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -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-5b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-171620515500373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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