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

About the Execution of GreatSPN+red for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
489.023 15172.00 32594.00 116.40 TTTTTTTTTTTFTTTF 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.r179-tall-171640600700079.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 FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600700079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K 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 FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716420520176

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:28:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:28:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:28:41] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-22 23:28:41] [INFO ] Transformed 1988 places.
[2024-05-22 23:28:41] [INFO ] Transformed 2289 transitions.
[2024-05-22 23:28:41] [INFO ] Found NUPN structural information;
[2024-05-22 23:28:41] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (463 resets) in 1077 ms. (37 steps per ms) remains 11/16 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 635 ms. (62 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (46 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (43 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
// Phase 1: matrix 2289 rows 1988 cols
[2024-05-22 23:28:42] [INFO ] Computed 14 invariants in 54 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1894/1988 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1894/2002 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1988 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2289/4277 variables, 1988/3990 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4277/4277 variables, and 3990 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2974 ms.
Refiners :[Domain max(s): 1988/1988 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 1988/1988 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1894/1988 variables, 14/108 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1894/2002 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-22 23:28:47] [INFO ] Deduced a trap composed of 287 places in 852 ms of which 81 ms to minimize.
[2024-05-22 23:28:48] [INFO ] Deduced a trap composed of 670 places in 748 ms of which 10 ms to minimize.
[2024-05-22 23:28:48] [INFO ] Deduced a trap composed of 72 places in 768 ms of which 10 ms to minimize.
[2024-05-22 23:28:49] [INFO ] Deduced a trap composed of 643 places in 666 ms of which 9 ms to minimize.
[2024-05-22 23:28:49] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 3 ms to minimize.
[2024-05-22 23:28:50] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 2 ms to minimize.
[2024-05-22 23:28:50] [INFO ] Deduced a trap composed of 118 places in 675 ms of which 8 ms to minimize.
[2024-05-22 23:28:51] [INFO ] Deduced a trap composed of 649 places in 696 ms of which 9 ms to minimize.
SMT process timed out in 8867ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1458 edges and 1988 vertex of which 24 / 1988 are part of one of the 4 SCC in 7 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 331 place count 1968 transition count 1935
Reduce places removed 330 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 344 rules applied. Total rules applied 675 place count 1638 transition count 1921
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 689 place count 1624 transition count 1921
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 689 place count 1624 transition count 1661
Deduced a syphon composed of 260 places in 3 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 3 with 520 rules applied. Total rules applied 1209 place count 1364 transition count 1661
Discarding 706 places :
Symmetric choice reduction at 3 with 706 rule applications. Total rules 1915 place count 658 transition count 955
Iterating global reduction 3 with 706 rules applied. Total rules applied 2621 place count 658 transition count 955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 2623 place count 658 transition count 953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2624 place count 657 transition count 953
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 2624 place count 657 transition count 947
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2636 place count 651 transition count 947
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 2737 place count 550 transition count 846
Iterating global reduction 5 with 101 rules applied. Total rules applied 2838 place count 550 transition count 846
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 5 with 85 rules applied. Total rules applied 2923 place count 550 transition count 761
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 160 rules applied. Total rules applied 3083 place count 470 transition count 681
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 3099 place count 462 transition count 695
Free-agglomeration rule applied 86 times.
Iterating global reduction 6 with 86 rules applied. Total rules applied 3185 place count 462 transition count 609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 6 with 86 rules applied. Total rules applied 3271 place count 376 transition count 609
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 3282 place count 376 transition count 598
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 3289 place count 376 transition count 598
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3290 place count 375 transition count 597
Applied a total of 3290 rules in 474 ms. Remains 375 /1988 variables (removed 1613) and now considering 597/2289 (removed 1692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 375/1988 places, 597/2289 transitions.
RANDOM walk for 40000 steps (756 resets) in 657 ms. (60 steps per ms) remains 7/9 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (64 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (63 resets) in 76 ms. (519 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (64 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (68 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
[2024-05-22 23:28:52] [INFO ] Flow matrix only has 583 transitions (discarded 14 similar events)
// Phase 1: matrix 583 rows 375 cols
[2024-05-22 23:28:52] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 23:28:52] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 329/375 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 583/958 variables, 375/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/958 variables, 62/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/958 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/958 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 958/958 variables, and 451 constraints, problems are : Problem set: 0 solved, 6 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 375/375 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 329/375 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 23:28:53] [INFO ] Deduced a trap composed of 146 places in 120 ms of which 3 ms to minimize.
[2024-05-22 23:28:53] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-22 23:28:53] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 2 ms to minimize.
[2024-05-22 23:28:53] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 2 ms to minimize.
[2024-05-22 23:28:53] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 583/958 variables, 375/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/958 variables, 62/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/958 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 958/958 variables, and 462 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 375/375 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 2014ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 653 ms.
Support contains 3 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 597/597 transitions.
Graph (trivial) has 305 edges and 375 vertex of which 19 / 375 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 364 transition count 563
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 349 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 349 transition count 562
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 348 transition count 562
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 45 place count 348 transition count 550
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 92 place count 301 transition count 502
Iterating global reduction 3 with 47 rules applied. Total rules applied 139 place count 301 transition count 502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 143 place count 301 transition count 498
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 143 place count 301 transition count 497
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 300 transition count 497
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 156 place count 300 transition count 486
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 298 transition count 484
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 298 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 162 place count 298 transition count 482
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 198 place count 280 transition count 464
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 203 place count 280 transition count 459
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 218 place count 265 transition count 443
Iterating global reduction 7 with 15 rules applied. Total rules applied 233 place count 265 transition count 443
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 248 place count 265 transition count 428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 250 place count 264 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 269 place count 264 transition count 409
Free-agglomeration rule applied 195 times with reduction of 1 identical transitions.
Iterating global reduction 8 with 195 rules applied. Total rules applied 464 place count 264 transition count 213
Discarding 36 places :
Also discarding 37 output transitions
Drop transitions (Output transitions of discarded places.) removed 37 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t1977.t1058.t1059.t1037.t1038 and 36 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 8 / 32 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 134 rules applied. Total rules applied 598 place count 28 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 606 place count 28 transition count 36
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 606 place count 28 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 618 place count 22 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 623 place count 22 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 623 place count 22 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 625 place count 21 transition count 24
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 635 place count 16 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 636 place count 16 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 637 place count 16 transition count 17
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 641 place count 16 transition count 13
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 649 place count 12 transition count 9
Ensure Unique test removed 1 places
Iterating post reduction 13 with 1 rules applied. Total rules applied 650 place count 11 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 651 place count 10 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 653 place count 8 transition count 8
Applied a total of 653 rules in 142 ms. Remains 8 /375 variables (removed 367) and now considering 8/597 (removed 589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 8/375 places, 8/597 transitions.
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13970 ms.
ITS solved all properties within timeout

BK_STOP 1716420535348

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640600700079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;