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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K 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 53K 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.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 08:28 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.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

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

=== Now, execution of the tool begins

BK_START 1716427911244

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-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:31:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 01:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:31:52] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2024-05-23 01:31:52] [INFO ] Transformed 5372 places.
[2024-05-23 01:31:52] [INFO ] Transformed 6193 transitions.
[2024-05-23 01:31:52] [INFO ] Found NUPN structural information;
[2024-05-23 01:31:52] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (297 resets) in 1756 ms. (22 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (21 resets) in 360 ms. (110 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (21 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (23 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (19 resets) in 103 ms. (384 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (20 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (19 resets) in 62 ms. (634 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 96 ms. (412 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (21 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 843 ms. (47 steps per ms) remains 10/10 properties
// Phase 1: matrix 6193 rows 5372 cols
[2024-05-23 01:31:54] [INFO ] Computed 22 invariants in 228 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2024-12 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5265/5372 variables, 22/129 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5372 variables, 5265/5394 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5372 variables, 0/5394 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6193/11565 variables, 5372/10766 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11565/11565 variables, and 10766 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5061 ms.
Refiners :[Domain max(s): 5372/5372 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 5372/5372 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2024-14 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5094/5192 variables, 21/119 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5192 variables, 5094/5213 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 01:32:04] [INFO ] Deduced a trap composed of 2009 places in 3684 ms of which 192 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 1942 places in 3223 ms of which 28 ms to minimize.
SMT process timed out in 13688ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4318 edges and 5372 vertex of which 92 / 5372 are part of one of the 15 SCC in 20 ms
Free SCC test removed 77 places
Drop transitions (Empty/Sink Transition effects.) removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 931 transitions
Trivial Post-agglo rules discarded 931 transitions
Performed 931 trivial Post agglomeration. Transition count delta: 931
Iterating post reduction 0 with 931 rules applied. Total rules applied 932 place count 5295 transition count 5169
Reduce places removed 931 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 939 rules applied. Total rules applied 1871 place count 4364 transition count 5161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1879 place count 4356 transition count 5161
Performed 712 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 712 Pre rules applied. Total rules applied 1879 place count 4356 transition count 4449
Deduced a syphon composed of 712 places in 4 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 3 with 1424 rules applied. Total rules applied 3303 place count 3644 transition count 4449
Discarding 2176 places :
Symmetric choice reduction at 3 with 2176 rule applications. Total rules 5479 place count 1468 transition count 2273
Iterating global reduction 3 with 2176 rules applied. Total rules applied 7655 place count 1468 transition count 2273
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 7655 place count 1468 transition count 2256
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7689 place count 1451 transition count 2256
Discarding 344 places :
Symmetric choice reduction at 3 with 344 rule applications. Total rules 8033 place count 1107 transition count 1912
Iterating global reduction 3 with 344 rules applied. Total rules applied 8377 place count 1107 transition count 1912
Ensure Unique test removed 327 transitions
Reduce isomorphic transitions removed 327 transitions.
Iterating post reduction 3 with 327 rules applied. Total rules applied 8704 place count 1107 transition count 1585
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 8936 place count 991 transition count 1469
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 8955 place count 991 transition count 1450
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 8974 place count 972 transition count 1431
Iterating global reduction 5 with 19 rules applied. Total rules applied 8993 place count 972 transition count 1431
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 9003 place count 967 transition count 1431
Free-agglomeration rule applied 319 times.
Iterating global reduction 5 with 319 rules applied. Total rules applied 9322 place count 967 transition count 1112
Reduce places removed 319 places and 0 transitions.
Iterating post reduction 5 with 319 rules applied. Total rules applied 9641 place count 648 transition count 1112
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 9669 place count 620 transition count 1084
Iterating global reduction 6 with 28 rules applied. Total rules applied 9697 place count 620 transition count 1084
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 9725 place count 620 transition count 1056
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 9742 place count 620 transition count 1039
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 9747 place count 620 transition count 1039
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 9748 place count 620 transition count 1039
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 9749 place count 619 transition count 1038
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 101 edges and 618 vertex of which 30 / 618 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
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 7 with 3 rules applied. Total rules applied 9752 place count 603 transition count 1037
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 9783 place count 602 transition count 1007
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 19 Pre rules applied. Total rules applied 9783 place count 602 transition count 988
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 9821 place count 583 transition count 988
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 9869 place count 559 transition count 964
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 9879 place count 554 transition count 964
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 9889 place count 554 transition count 954
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 9904 place count 554 transition count 939
Free-agglomeration rule applied 16 times.
Iterating global reduction 10 with 16 rules applied. Total rules applied 9920 place count 554 transition count 923
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 10 with 39 rules applied. Total rules applied 9959 place count 535 transition count 903
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 9966 place count 531 transition count 900
Discarding 38 places :
Symmetric choice reduction at 12 with 38 rule applications. Total rules 10004 place count 493 transition count 862
Iterating global reduction 12 with 38 rules applied. Total rules applied 10042 place count 493 transition count 862
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 38 rules applied. Total rules applied 10080 place count 493 transition count 824
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 13 with 16 rules applied. Total rules applied 10096 place count 493 transition count 808
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 10097 place count 493 transition count 808
Applied a total of 10097 rules in 1518 ms. Remains 493 /5372 variables (removed 4879) and now considering 808/6193 (removed 5385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1528 ms. Remains : 493/5372 places, 808/6193 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
// Phase 1: matrix 808 rows 493 cols
[2024-05-23 01:32:09] [INFO ] Computed 18 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 441/491 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 807/1298 variables, 491/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1298 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/1301 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1301 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1301 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 511 constraints, problems are : Problem set: 0 solved, 7 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 441/491 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:32:10] [INFO ] Deduced a trap composed of 359 places in 171 ms of which 4 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 320 places in 149 ms of which 2 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 337 places in 172 ms of which 3 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 360 places in 156 ms of which 3 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 3 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 342 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 317 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 807/1298 variables, 491/515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3/1301 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1301 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 342 places in 176 ms of which 3 ms to minimize.
[2024-05-23 01:32:13] [INFO ] Deduced a trap composed of 337 places in 170 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1301 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1301 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1301 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 527 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3275 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 3990ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 1550 ms.
Support contains 45 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 808/808 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 493 transition count 805
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 490 transition count 803
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 488 transition count 801
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 488 transition count 799
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 486 transition count 799
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 25 place count 477 transition count 790
Iterating global reduction 3 with 9 rules applied. Total rules applied 34 place count 477 transition count 790
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 3 with 10 rules applied. Total rules applied 44 place count 472 transition count 785
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 51 place count 465 transition count 778
Iterating global reduction 3 with 7 rules applied. Total rules applied 58 place count 465 transition count 778
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 65 place count 465 transition count 771
Free-agglomeration rule applied 5 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 70 place count 465 transition count 765
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 4 with 13 rules applied. Total rules applied 83 place count 458 transition count 759
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 93 place count 453 transition count 754
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 135 place count 411 transition count 712
Iterating global reduction 6 with 42 rules applied. Total rules applied 177 place count 411 transition count 712
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 219 place count 411 transition count 670
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 411 transition count 669
Applied a total of 220 rules in 102 ms. Remains 411 /493 variables (removed 82) and now considering 669/808 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 411/493 places, 669/808 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 479984 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 2
Probabilistic random walk after 479984 steps, saw 332878 distinct states, run finished after 3007 ms. (steps per millisecond=159 ) properties seen :0
// Phase 1: matrix 669 rows 411 cols
[2024-05-23 01:32:18] [INFO ] Computed 16 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 366/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 669/1080 variables, 411/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1080 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 427 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 366/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 01:32:19] [INFO ] Deduced a trap composed of 275 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 669/1080 variables, 411/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1080 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1080 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 430 constraints, problems are : Problem set: 0 solved, 2 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1122ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 2996 steps, including 156 resets, run visited all 1 properties in 11 ms. (steps per millisecond=272 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 48 ms.
All properties solved without resorting to model-checking.
Total runtime 27549 ms.
ITS solved all properties within timeout

BK_STOP 1716427939987

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

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