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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 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 374K 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-10b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716418460096

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-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:54:21] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-22 22:54:21] [INFO ] Transformed 1402 places.
[2024-05-22 22:54:21] [INFO ] Transformed 1613 transitions.
[2024-05-22 22:54:21] [INFO ] Found NUPN structural information;
[2024-05-22 22:54:21] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 249 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 (530 resets) in 1417 ms. (28 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (58 resets) in 366 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (61 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (51 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (59 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (60 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (24 resets) in 325 ms. (122 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (60 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (58 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
// Phase 1: matrix 1613 rows 1402 cols
[2024-05-22 22:54:22] [INFO ] Computed 12 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1187/1402 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1187/1414 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1613/3015 variables, 1402/2816 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3015/3015 variables, and 2816 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2941 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1187/1402 variables, 12/227 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1187/1414 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-22 22:54:27] [INFO ] Deduced a trap composed of 444 places in 529 ms of which 76 ms to minimize.
[2024-05-22 22:54:27] [INFO ] Deduced a trap composed of 448 places in 301 ms of which 6 ms to minimize.
[2024-05-22 22:54:27] [INFO ] Deduced a trap composed of 448 places in 268 ms of which 4 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 22:54:28] [INFO ] Deduced a trap composed of 454 places in 302 ms of which 5 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-22 22:54:28] [INFO ] Deduced a trap composed of 97 places in 316 ms of which 5 ms to minimize.
[2024-05-22 22:54:29] [INFO ] Deduced a trap composed of 184 places in 342 ms of which 6 ms to minimize.
[2024-05-22 22:54:29] [INFO ] Deduced a trap composed of 512 places in 321 ms of which 6 ms to minimize.
[2024-05-22 22:54:29] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 4 ms to minimize.
[2024-05-22 22:54:29] [INFO ] Deduced a trap composed of 197 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 9/1423 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-22 22:54:30] [INFO ] Deduced a trap composed of 483 places in 430 ms of which 7 ms to minimize.
[2024-05-22 22:54:30] [INFO ] Deduced a trap composed of 476 places in 470 ms of which 8 ms to minimize.
[2024-05-22 22:54:31] [INFO ] Deduced a trap composed of 478 places in 455 ms of which 7 ms to minimize.
SMT process timed out in 8488ms, After SMT, problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 845 edges and 1402 vertex of which 8 / 1402 are part of one of the 1 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 207 place count 1395 transition count 1398
Reduce places removed 206 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 241 rules applied. Total rules applied 448 place count 1189 transition count 1363
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 483 place count 1154 transition count 1363
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 483 place count 1154 transition count 1224
Deduced a syphon composed of 139 places in 3 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 761 place count 1015 transition count 1224
Discarding 429 places :
Symmetric choice reduction at 3 with 429 rule applications. Total rules 1190 place count 586 transition count 795
Iterating global reduction 3 with 429 rules applied. Total rules applied 1619 place count 586 transition count 795
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1619 place count 586 transition count 793
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1623 place count 584 transition count 793
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1663 place count 544 transition count 753
Iterating global reduction 3 with 40 rules applied. Total rules applied 1703 place count 544 transition count 753
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 1731 place count 544 transition count 725
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1859 place count 480 transition count 661
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1873 place count 473 transition count 661
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1887 place count 473 transition count 647
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1901 place count 459 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1903 place count 459 transition count 645
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1913 place count 459 transition count 645
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1914 place count 459 transition count 645
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1915 place count 458 transition count 644
Applied a total of 1915 rules in 391 ms. Remains 458 /1402 variables (removed 944) and now considering 644/1613 (removed 969) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 458/1402 places, 644/1613 transitions.
RANDOM walk for 40000 steps (1169 resets) in 1436 ms. (27 steps per ms) remains 7/9 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (92 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (91 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (92 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (87 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (96 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (96 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
[2024-05-22 22:54:32] [INFO ] Flow matrix only has 639 transitions (discarded 5 similar events)
// Phase 1: matrix 639 rows 458 cols
[2024-05-22 22:54:32] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 22:54:32] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 313/458 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 639/1097 variables, 458/470 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1097 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1097 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 479 constraints, problems are : Problem set: 0 solved, 7 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 458/458 constraints, ReadFeed: 9/9 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/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 313/458 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 22:54:33] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:54:33] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 3 ms to minimize.
[2024-05-22 22:54:33] [INFO ] Deduced a trap composed of 151 places in 129 ms of which 2 ms to minimize.
[2024-05-22 22:54:33] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 2 ms to minimize.
[2024-05-22 22:54:33] [INFO ] Deduced a trap composed of 147 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 22:54:33] [INFO ] Deduced a trap composed of 157 places in 144 ms of which 2 ms to minimize.
[2024-05-22 22:54:34] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:54:34] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 2 ms to minimize.
[2024-05-22 22:54:34] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 3 ms to minimize.
[2024-05-22 22:54:34] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 639/1097 variables, 458/480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 9/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1097 variables, 7/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1097 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 496 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3313 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 458/458 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 4002ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2549 ms.
Support contains 141 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 644/644 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 458 transition count 639
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 453 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 452 transition count 638
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 452 transition count 637
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 451 transition count 637
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 21 place count 444 transition count 630
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 444 transition count 630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 444 transition count 629
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 51 place count 433 transition count 618
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 431 transition count 616
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 431 transition count 616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 431 transition count 614
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 5 with 2 rules applied. Total rules applied 59 place count 430 transition count 614
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 430 transition count 613
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 72 place count 430 transition count 601
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 84 place count 418 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 85 place count 418 transition count 600
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 87 place count 418 transition count 600
Applied a total of 87 rules in 113 ms. Remains 418 /458 variables (removed 40) and now considering 600/644 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 418/458 places, 600/644 transitions.
RANDOM walk for 40000 steps (1187 resets) in 211 ms. (188 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (99 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (99 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (95 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
[2024-05-22 22:54:39] [INFO ] Flow matrix only has 594 transitions (discarded 6 similar events)
// Phase 1: matrix 594 rows 418 cols
[2024-05-22 22:54:39] [INFO ] Computed 12 invariants in 4 ms
[2024-05-22 22:54:39] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 277/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 594/1012 variables, 418/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 9/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/1012 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 439 constraints, problems are : Problem set: 0 solved, 3 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 418/418 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 277/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:54:39] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-22 22:54:39] [INFO ] Deduced a trap composed of 145 places in 111 ms of which 2 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 2 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 3 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 2 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 139 places in 114 ms of which 2 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:54:40] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 2 ms to minimize.
[2024-05-22 22:54:41] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 3 ms to minimize.
[2024-05-22 22:54:41] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 3 ms to minimize.
[2024-05-22 22:54:41] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 594/1012 variables, 418/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 9/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1012 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1012 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1012 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2878 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 418/418 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 821 ms.
Support contains 141 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 600/600 transitions.
Applied a total of 0 rules in 13 ms. Remains 418 /418 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 418/418 places, 600/600 transitions.
RANDOM walk for 40000 steps (1185 resets) in 835 ms. (47 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (96 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
[2024-05-22 22:54:43] [INFO ] Flow matrix only has 594 transitions (discarded 6 similar events)
[2024-05-22 22:54:43] [INFO ] Invariant cache hit.
[2024-05-22 22:54:43] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 317/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 594/1012 variables, 418/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 9/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1012 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 439 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 418/418 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 317/418 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:54:44] [INFO ] Deduced a trap composed of 149 places in 132 ms of which 3 ms to minimize.
[2024-05-22 22:54:44] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 2 ms to minimize.
[2024-05-22 22:54:44] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:54:44] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 3 ms to minimize.
[2024-05-22 22:54:44] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 594/1012 variables, 418/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 9/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1012 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1012 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1012 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 418/418 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1803ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 281 ms.
Support contains 101 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 600/600 transitions.
Graph (trivial) has 89 edges and 418 vertex of which 7 / 418 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 414 transition count 585
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 406 transition count 585
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 406 transition count 584
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 405 transition count 584
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 33 place count 391 transition count 570
Iterating global reduction 2 with 14 rules applied. Total rules applied 47 place count 391 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 391 transition count 569
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 390 transition count 568
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 390 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 390 transition count 567
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 81 place count 375 transition count 552
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 87 place count 369 transition count 546
Iterating global reduction 4 with 6 rules applied. Total rules applied 93 place count 369 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 99 place count 369 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 103 place count 369 transition count 536
Free-agglomeration rule applied 36 times.
Iterating global reduction 5 with 36 rules applied. Total rules applied 139 place count 369 transition count 500
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 37 rules applied. Total rules applied 176 place count 333 transition count 499
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 180 place count 333 transition count 495
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 333 transition count 495
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 331 transition count 493
Applied a total of 183 rules in 101 ms. Remains 331 /418 variables (removed 87) and now considering 493/600 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 331/418 places, 493/600 transitions.
RANDOM walk for 40000 steps (1157 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (112 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (111 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 734512 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 2
Probabilistic random walk after 734512 steps, saw 169728 distinct states, run finished after 3005 ms. (steps per millisecond=244 ) properties seen :0
[2024-05-22 22:54:48] [INFO ] Flow matrix only has 484 transitions (discarded 9 similar events)
// Phase 1: matrix 484 rows 331 cols
[2024-05-22 22:54:49] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 22:54:49] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/331 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 484/815 variables, 331/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 331/331 constraints, ReadFeed: 8/8 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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/331 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:54:49] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:54:49] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:54:49] [INFO ] Deduced a trap composed of 118 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:54:49] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:54:49] [INFO ] Deduced a trap composed of 133 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 484/815 variables, 331/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:54:50] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:54:50] [INFO ] Deduced a trap composed of 134 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/815 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 360 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 331/331 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1801ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 101 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 493/493 transitions.
Applied a total of 0 rules in 10 ms. Remains 331 /331 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 331/331 places, 493/493 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 493/493 transitions.
Applied a total of 0 rules in 10 ms. Remains 331 /331 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-22 22:54:50] [INFO ] Flow matrix only has 484 transitions (discarded 9 similar events)
[2024-05-22 22:54:50] [INFO ] Invariant cache hit.
[2024-05-22 22:54:51] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 22:54:51] [INFO ] Flow matrix only has 484 transitions (discarded 9 similar events)
[2024-05-22 22:54:51] [INFO ] Invariant cache hit.
[2024-05-22 22:54:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 22:54:51] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-22 22:54:51] [INFO ] Redundant transitions in 26 ms returned []
Running 482 sub problems to find dead transitions.
[2024-05-22 22:54:51] [INFO ] Flow matrix only has 484 transitions (discarded 9 similar events)
[2024-05-22 22:54:51] [INFO ] Invariant cache hit.
[2024-05-22 22:54:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 4/331 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 22:54:57] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:54:58] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 2 ms to minimize.
[2024-05-22 22:54:58] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:54:58] [INFO ] Deduced a trap composed of 134 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 133 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 9 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 2 ms to minimize.
[2024-05-22 22:54:59] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (OVERLAPS) 484/815 variables, 331/354 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 22:55:17] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/815 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/815 variables, and 363 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 331/331 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 4/331 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 22:55:26] [INFO ] Deduced a trap composed of 125 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 484/815 variables, 331/356 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/815 variables, 482/846 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-22 22:55:34] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/815 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 847 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 331/331 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 14/14 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60841 ms. Remains : 331/331 places, 493/493 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 331 transition count 484
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 23 place count 317 transition count 470
Iterating global reduction 1 with 14 rules applied. Total rules applied 37 place count 317 transition count 470
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 317 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 316 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 316 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 48 place count 315 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 314 transition count 460
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 314 transition count 460
Applied a total of 50 rules in 21 ms. Remains 314 /331 variables (removed 17) and now considering 460/493 (removed 33) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 460 rows 314 cols
[2024-05-22 22:55:51] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 22:55:51] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 22:55:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 22:55:52] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 22:55:52] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 22:55:52] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 878 ms.
[2024-05-22 22:55:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-22 22:55:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 331 places, 493 transitions and 1643 arcs took 6 ms.
[2024-05-22 22:55:52] [INFO ] Flatten gal took : 62 ms
Total runtime 91659 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-10b

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/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: 793
MODEL NAME: /home/mcc/execution/415/model
331 places, 493 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-10b-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2024-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716419121176

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

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

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

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