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-171640600800127.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-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.2M 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-18b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2023-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716426344175

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-18b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:05:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 01:05:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:05:45] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-23 01:05:45] [INFO ] Transformed 4370 places.
[2024-05-23 01:05:45] [INFO ] Transformed 5037 transitions.
[2024-05-23 01:05:45] [INFO ] Found NUPN structural information;
[2024-05-23 01:05:45] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (326 resets) in 1675 ms. (23 steps per ms) remains 14/16 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 242 ms. (164 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 226 ms. (176 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (23 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 572 ms. (69 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (24 resets) in 321 ms. (124 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (21 resets) in 189 ms. (210 steps per ms) remains 13/14 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (24 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (23 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (23 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (24 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (25 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (25 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
// Phase 1: matrix 5037 rows 4370 cols
[2024-05-23 01:05:47] [INFO ] Computed 20 invariants in 185 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 253/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem FlexibleBarrier-PT-18b-ReachabilityFireability-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 4117/4370 variables, 20/273 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4370 variables, 4117/4390 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4370 variables, 0/4390 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 5037/9407 variables, 4370/8760 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9407/9407 variables, and 8760 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5080 ms.
Refiners :[Domain max(s): 4370/4370 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 4370/4370 constraints, PredecessorRefiner: 13/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 236/236 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 4134/4370 variables, 20/256 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4370 variables, 4134/4390 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-23 01:05:57] [INFO ] Deduced a trap composed of 177 places in 3392 ms of which 221 ms to minimize.
[2024-05-23 01:06:00] [INFO ] Deduced a trap composed of 166 places in 2942 ms of which 24 ms to minimize.
SMT process timed out in 13201ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 236 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 2969 edges and 4370 vertex of which 18 / 4370 are part of one of the 3 SCC in 15 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 719 transitions
Trivial Post-agglo rules discarded 719 transitions
Performed 719 trivial Post agglomeration. Transition count delta: 719
Iterating post reduction 0 with 719 rules applied. Total rules applied 720 place count 4355 transition count 4300
Reduce places removed 719 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 748 rules applied. Total rules applied 1468 place count 3636 transition count 4271
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 1497 place count 3607 transition count 4271
Performed 527 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 527 Pre rules applied. Total rules applied 1497 place count 3607 transition count 3744
Deduced a syphon composed of 527 places in 3 ms
Reduce places removed 527 places and 0 transitions.
Iterating global reduction 3 with 1054 rules applied. Total rules applied 2551 place count 3080 transition count 3744
Discarding 1643 places :
Symmetric choice reduction at 3 with 1643 rule applications. Total rules 4194 place count 1437 transition count 2101
Iterating global reduction 3 with 1643 rules applied. Total rules applied 5837 place count 1437 transition count 2101
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 5839 place count 1437 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5840 place count 1436 transition count 2099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 5840 place count 1436 transition count 2098
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 5842 place count 1435 transition count 2098
Discarding 205 places :
Symmetric choice reduction at 5 with 205 rule applications. Total rules 6047 place count 1230 transition count 1893
Iterating global reduction 5 with 205 rules applied. Total rules applied 6252 place count 1230 transition count 1893
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 5 with 182 rules applied. Total rules applied 6434 place count 1230 transition count 1711
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 6 with 278 rules applied. Total rules applied 6712 place count 1091 transition count 1572
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 6740 place count 1077 transition count 1572
Free-agglomeration rule applied 113 times.
Iterating global reduction 6 with 113 rules applied. Total rules applied 6853 place count 1077 transition count 1459
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 6 with 113 rules applied. Total rules applied 6966 place count 964 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 6967 place count 963 transition count 1458
Iterating global reduction 7 with 1 rules applied. Total rules applied 6968 place count 963 transition count 1458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 6969 place count 963 transition count 1457
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 6985 place count 963 transition count 1441
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 7000 place count 963 transition count 1441
Applied a total of 7000 rules in 1631 ms. Remains 963 /4370 variables (removed 3407) and now considering 1441/5037 (removed 3596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 963/4370 places, 1441/5037 transitions.
RANDOM walk for 40000 steps (727 resets) in 968 ms. (41 steps per ms) remains 9/12 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (31 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (34 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (15 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 31 ms. (1250 steps per ms) remains 9/9 properties
[2024-05-23 01:06:02] [INFO ] Flow matrix only has 1424 transitions (discarded 17 similar events)
// Phase 1: matrix 1424 rows 963 cols
[2024-05-23 01:06:02] [INFO ] Computed 20 invariants in 37 ms
[2024-05-23 01:06:02] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 811/963 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/963 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1424/2387 variables, 963/983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2387 variables, 83/1066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2387 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/2387 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2387/2387 variables, and 1066 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 963/963 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 811/963 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 01:06:04] [INFO ] Deduced a trap composed of 80 places in 376 ms of which 6 ms to minimize.
[2024-05-23 01:06:05] [INFO ] Deduced a trap composed of 383 places in 356 ms of which 6 ms to minimize.
[2024-05-23 01:06:05] [INFO ] Deduced a trap composed of 421 places in 381 ms of which 6 ms to minimize.
[2024-05-23 01:06:05] [INFO ] Deduced a trap composed of 398 places in 327 ms of which 5 ms to minimize.
[2024-05-23 01:06:06] [INFO ] Deduced a trap composed of 375 places in 338 ms of which 6 ms to minimize.
[2024-05-23 01:06:06] [INFO ] Deduced a trap composed of 401 places in 323 ms of which 5 ms to minimize.
Problem FlexibleBarrier-PT-18b-ReachabilityFireability-2024-09 is UNSAT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/963 variables, 6/26 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/963 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1424/2387 variables, 963/989 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2387 variables, 83/1072 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2387 variables, 8/1080 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2387 variables, 0/1080 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2387 variables, 0/1080 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2387/2387 variables, and 1080 constraints, problems are : Problem set: 1 solved, 8 unsolved in 9152 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 963/963 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 10643ms problems are : Problem set: 1 solved, 8 unsolved
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 1473 ms.
Support contains 27 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 1441/1441 transitions.
Graph (trivial) has 469 edges and 963 vertex of which 29 / 963 are part of one of the 12 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 946 transition count 1376
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 910 transition count 1376
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 73 place count 910 transition count 1359
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 107 place count 893 transition count 1359
Discarding 124 places :
Symmetric choice reduction at 2 with 124 rule applications. Total rules 231 place count 769 transition count 1235
Iterating global reduction 2 with 124 rules applied. Total rules applied 355 place count 769 transition count 1235
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 368 place count 769 transition count 1222
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 374 place count 763 transition count 1216
Iterating global reduction 3 with 6 rules applied. Total rules applied 380 place count 763 transition count 1216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 385 place count 763 transition count 1211
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 459 place count 726 transition count 1173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 464 place count 726 transition count 1168
Discarding 53 places :
Symmetric choice reduction at 5 with 53 rule applications. Total rules 517 place count 673 transition count 1115
Iterating global reduction 5 with 53 rules applied. Total rules applied 570 place count 673 transition count 1115
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 623 place count 673 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 625 place count 672 transition count 1062
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 635 place count 672 transition count 1052
Free-agglomeration rule applied 189 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 189 rules applied. Total rules applied 824 place count 672 transition count 862
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 193 rules applied. Total rules applied 1017 place count 483 transition count 858
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 1066 place count 434 transition count 809
Iterating global reduction 7 with 49 rules applied. Total rules applied 1115 place count 434 transition count 809
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 1164 place count 434 transition count 760
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1166 place count 434 transition count 758
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1168 place count 434 transition count 758
Applied a total of 1168 rules in 493 ms. Remains 434 /963 variables (removed 529) and now considering 758/1441 (removed 683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 434/963 places, 758/1441 transitions.
RANDOM walk for 40000 steps (271 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (31 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 683631 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 1
Probabilistic random walk after 683631 steps, saw 162867 distinct states, run finished after 3005 ms. (steps per millisecond=227 ) properties seen :0
[2024-05-23 01:06:18] [INFO ] Flow matrix only has 727 transitions (discarded 31 similar events)
// Phase 1: matrix 727 rows 434 cols
[2024-05-23 01:06:18] [INFO ] Computed 20 invariants in 10 ms
[2024-05-23 01:06:18] [INFO ] State equation strengthened by 227 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 407/434 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 727/1161 variables, 434/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 227/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/1161 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 681 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 434/434 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 407/434 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 01:06:18] [INFO ] Deduced a trap composed of 250 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 727/1161 variables, 434/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 227/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1161 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1161 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1161 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 683 constraints, problems are : Problem set: 0 solved, 1 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 434/434 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 920ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 27 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 758/758 transitions.
Applied a total of 0 rules in 14 ms. Remains 434 /434 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 434/434 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 758/758 transitions.
Applied a total of 0 rules in 52 ms. Remains 434 /434 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-23 01:06:19] [INFO ] Flow matrix only has 727 transitions (discarded 31 similar events)
[2024-05-23 01:06:19] [INFO ] Invariant cache hit.
[2024-05-23 01:06:19] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-23 01:06:19] [INFO ] Flow matrix only has 727 transitions (discarded 31 similar events)
[2024-05-23 01:06:19] [INFO ] Invariant cache hit.
[2024-05-23 01:06:20] [INFO ] State equation strengthened by 227 read => feed constraints.
[2024-05-23 01:06:20] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-23 01:06:20] [INFO ] Redundant transitions in 40 ms returned []
Running 757 sub problems to find dead transitions.
[2024-05-23 01:06:20] [INFO ] Flow matrix only has 727 transitions (discarded 31 similar events)
[2024-05-23 01:06:20] [INFO ] Invariant cache hit.
[2024-05-23 01:06:20] [INFO ] State equation strengthened by 227 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-05-23 01:06:32] [INFO ] Deduced a trap composed of 249 places in 149 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 727/1161 variables, 434/455 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 227/682 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1161/1161 variables, and 682 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 434/434 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 727/1161 variables, 434/455 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 227/682 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1161 variables, 757/1439 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1439 constraints, problems are : Problem set: 0 solved, 757 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 434/434 constraints, ReadFeed: 227/227 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 1/1 constraints]
After SMT, in 61554ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 61564ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62742 ms. Remains : 434/434 places, 758/758 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 434 transition count 627
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 330 place count 334 transition count 528
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 424 place count 240 transition count 434
Iterating global reduction 2 with 94 rules applied. Total rules applied 518 place count 240 transition count 434
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 594 place count 240 transition count 358
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 595 place count 240 transition count 357
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 598 place count 240 transition count 357
Applied a total of 598 rules in 29 ms. Remains 240 /434 variables (removed 194) and now considering 357/758 (removed 401) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 357 rows 240 cols
[2024-05-23 01:07:22] [INFO ] Computed 20 invariants in 2 ms
[2024-05-23 01:07:22] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 01:07:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-05-23 01:07:22] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 01:07:22] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 01:07:22] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 511 ms.
[2024-05-23 01:07:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-23 01:07:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 758 transitions and 2889 arcs took 22 ms.
[2024-05-23 01:07:22] [INFO ] Flatten gal took : 97 ms
Total runtime 97608 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-18b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 434
TRANSITIONS: 758
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.008s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 621
MODEL NAME: /home/mcc/execution/408/model
434 places, 758 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 FlexibleBarrier-PT-18b-ReachabilityFireability-2023-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716426791551

--------------------
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-18b"
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-18b, 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-171640600800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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