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.r069-tall-171620503700031.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 CANConstruction-PT-030, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 18:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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.4M 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 CANConstruction-PT-030-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716363773103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:42:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:42:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:42:54] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-22 07:42:54] [INFO ] Transformed 2162 places.
[2024-05-22 07:42:54] [INFO ] Transformed 3840 transitions.
[2024-05-22 07:42:54] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (75 resets) in 2325 ms. (17 steps per ms) remains 4/16 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1092 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
// Phase 1: matrix 3840 rows 2162 cols
[2024-05-22 07:42:55] [INFO ] Computed 61 invariants in 69 ms
[2024-05-22 07:42:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2071/2130 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2130 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2130 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/2132 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2132 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 29/2161 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3840/6001 variables, 2161/2222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6001 variables, 1770/3992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6001 variables, 0/3992 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/6002 variables, 1/3993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6002/6002 variables, and 3993 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3641 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 2162/2162 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2071/2130 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2130 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 69 places in 371 ms of which 47 ms to minimize.
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 5 ms to minimize.
[2024-05-22 07:43:00] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 4 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 4 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 4 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 5 ms to minimize.
[2024-05-22 07:43:01] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 5 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 5 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 4 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 4 ms to minimize.
[2024-05-22 07:43:02] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 4 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 4 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2130 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:43:03] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 4 ms to minimize.
[2024-05-22 07:43:04] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 3 ms to minimize.
[2024-05-22 07:43:04] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:43:04] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2130/6002 variables, and 48 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 29/31 constraints, Generalized P Invariants (flows): 1/30 constraints, State Equation: 0/2162 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 8879ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 2162 transition count 3676
Reduce places removed 164 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 168 rules applied. Total rules applied 332 place count 1998 transition count 3672
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 336 place count 1994 transition count 3672
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 336 place count 1994 transition count 3665
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 350 place count 1987 transition count 3665
Discarding 814 places :
Symmetric choice reduction at 3 with 814 rule applications. Total rules 1164 place count 1173 transition count 2037
Iterating global reduction 3 with 814 rules applied. Total rules applied 1978 place count 1173 transition count 2037
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2022 place count 1151 transition count 2015
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 2045 place count 1151 transition count 1992
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 2068 place count 1128 transition count 1992
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 4 with 30 rules applied. Total rules applied 2098 place count 1128 transition count 1962
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2128 place count 1098 transition count 1962
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 2170 place count 1098 transition count 1962
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2172 place count 1098 transition count 1962
Applied a total of 2172 rules in 882 ms. Remains 1098 /2162 variables (removed 1064) and now considering 1962/3840 (removed 1878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 893 ms. Remains : 1098/2162 places, 1962/3840 transitions.
RANDOM walk for 40000 steps (176 resets) in 706 ms. (56 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
// Phase 1: matrix 1962 rows 1098 cols
[2024-05-22 07:43:05] [INFO ] Computed 61 invariants in 8 ms
[2024-05-22 07:43:05] [INFO ] State equation strengthened by 1811 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1030/1053 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/1067 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1067 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/1097 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1962/3059 variables, 1097/1158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3059 variables, 1811/2969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3059 variables, 0/2969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/3060 variables, 1/2970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3060 variables, 0/2970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3060 variables, 0/2970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3060/3060 variables, and 2970 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1098/1098 constraints, ReadFeed: 1811/1811 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1030/1053 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/1067 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1067 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/1097 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1097 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1962/3059 variables, 1097/1158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3059 variables, 1811/2969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3059 variables, 3/2972 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3059 variables, 0/2972 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/3060 variables, 1/2973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3060 variables, 0/2973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3060 variables, 0/2973 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3060/3060 variables, and 2973 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1098/1098 constraints, ReadFeed: 1811/1811 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3049ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 23 out of 1098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1098/1098 places, 1962/1962 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1098 transition count 1961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1097 transition count 1961
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1095 transition count 1957
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1095 transition count 1957
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 50 place count 1073 transition count 1935
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 1071 transition count 1935
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1071 transition count 1934
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 1070 transition count 1934
Applied a total of 56 rules in 411 ms. Remains 1070 /1098 variables (removed 28) and now considering 1934/1962 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 1070/1098 places, 1934/1962 transitions.
RANDOM walk for 40000 steps (193 resets) in 783 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 223870 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 3
Probabilistic random walk after 223870 steps, saw 79042 distinct states, run finished after 3005 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1934 rows 1070 cols
[2024-05-22 07:43:12] [INFO ] Computed 61 invariants in 8 ms
[2024-05-22 07:43:12] [INFO ] State equation strengthened by 1834 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1002/1025 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/1039 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/1069 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1934/3003 variables, 1069/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3003 variables, 1834/2964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3003 variables, 0/2964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/3004 variables, 1/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3004 variables, 0/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3004 variables, 0/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3004/3004 variables, and 2965 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1070/1070 constraints, ReadFeed: 1834/1834 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1002/1025 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/1039 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:43:14] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 30/1069 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1069 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1934/3003 variables, 1069/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3003 variables, 1834/2967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3003 variables, 3/2970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3003 variables, 0/2970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/3004 variables, 1/2971 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3004 variables, 0/2971 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3004 variables, 0/2971 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3004/3004 variables, and 2971 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1070/1070 constraints, ReadFeed: 1834/1834 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 3354ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 138 ms.
Support contains 4 out of 1070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1070/1070 places, 1934/1934 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1070 transition count 1933
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1069 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1068 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1068 transition count 1931
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 1061 transition count 1924
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 2 with 2 rules applied. Total rules applied 20 place count 1060 transition count 1924
Applied a total of 20 rules in 260 ms. Remains 1060 /1070 variables (removed 10) and now considering 1924/1934 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 1060/1070 places, 1924/1934 transitions.
RANDOM walk for 40000 steps (195 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 275050 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 275050 steps, saw 87392 distinct states, run finished after 3003 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 1924 rows 1060 cols
[2024-05-22 07:43:19] [INFO ] Computed 61 invariants in 12 ms
[2024-05-22 07:43:19] [INFO ] State equation strengthened by 1842 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 999/1003 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:43:20] [INFO ] Deduced a trap composed of 2 places in 425 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 26/1029 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:43:20] [INFO ] Deduced a trap composed of 33 places in 541 ms of which 6 ms to minimize.
[2024-05-22 07:43:21] [INFO ] Deduced a trap composed of 33 places in 537 ms of which 7 ms to minimize.
[2024-05-22 07:43:22] [INFO ] Deduced a trap composed of 33 places in 536 ms of which 6 ms to minimize.
[2024-05-22 07:43:22] [INFO ] Deduced a trap composed of 33 places in 532 ms of which 7 ms to minimize.
[2024-05-22 07:43:23] [INFO ] Deduced a trap composed of 33 places in 539 ms of which 6 ms to minimize.
[2024-05-22 07:43:23] [INFO ] Deduced a trap composed of 33 places in 523 ms of which 6 ms to minimize.
[2024-05-22 07:43:24] [INFO ] Deduced a trap composed of 33 places in 525 ms of which 7 ms to minimize.
[2024-05-22 07:43:24] [INFO ] Deduced a trap composed of 33 places in 502 ms of which 7 ms to minimize.
[2024-05-22 07:43:25] [INFO ] Deduced a trap composed of 33 places in 503 ms of which 7 ms to minimize.
[2024-05-22 07:43:25] [INFO ] Deduced a trap composed of 33 places in 524 ms of which 7 ms to minimize.
[2024-05-22 07:43:26] [INFO ] Deduced a trap composed of 33 places in 520 ms of which 6 ms to minimize.
[2024-05-22 07:43:26] [INFO ] Deduced a trap composed of 33 places in 528 ms of which 6 ms to minimize.
[2024-05-22 07:43:27] [INFO ] Deduced a trap composed of 33 places in 530 ms of which 6 ms to minimize.
[2024-05-22 07:43:28] [INFO ] Deduced a trap composed of 33 places in 529 ms of which 7 ms to minimize.
[2024-05-22 07:43:28] [INFO ] Deduced a trap composed of 33 places in 506 ms of which 6 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 33 places in 515 ms of which 6 ms to minimize.
[2024-05-22 07:43:29] [INFO ] Deduced a trap composed of 33 places in 524 ms of which 7 ms to minimize.
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 33 places in 532 ms of which 7 ms to minimize.
[2024-05-22 07:43:30] [INFO ] Deduced a trap composed of 33 places in 528 ms of which 7 ms to minimize.
[2024-05-22 07:43:31] [INFO ] Deduced a trap composed of 33 places in 551 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:43:31] [INFO ] Deduced a trap composed of 33 places in 512 ms of which 8 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 33 places in 530 ms of which 7 ms to minimize.
[2024-05-22 07:43:32] [INFO ] Deduced a trap composed of 33 places in 500 ms of which 7 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 33 places in 495 ms of which 6 ms to minimize.
[2024-05-22 07:43:33] [INFO ] Deduced a trap composed of 34 places in 515 ms of which 7 ms to minimize.
[2024-05-22 07:43:34] [INFO ] Deduced a trap composed of 33 places in 494 ms of which 7 ms to minimize.
[2024-05-22 07:43:34] [INFO ] Deduced a trap composed of 33 places in 485 ms of which 6 ms to minimize.
[2024-05-22 07:43:35] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 7 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 7 ms to minimize.
[2024-05-22 07:43:36] [INFO ] Deduced a trap composed of 36 places in 491 ms of which 6 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 33 places in 483 ms of which 7 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 37 places in 452 ms of which 6 ms to minimize.
[2024-05-22 07:43:37] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 6 ms to minimize.
[2024-05-22 07:43:38] [INFO ] Deduced a trap composed of 41 places in 475 ms of which 7 ms to minimize.
[2024-05-22 07:43:38] [INFO ] Deduced a trap composed of 33 places in 474 ms of which 8 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 7 ms to minimize.
[2024-05-22 07:43:39] [INFO ] Deduced a trap composed of 39 places in 459 ms of which 6 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 36 places in 452 ms of which 7 ms to minimize.
[2024-05-22 07:43:40] [INFO ] Deduced a trap composed of 36 places in 471 ms of which 6 ms to minimize.
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 33 places in 465 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:43:41] [INFO ] Deduced a trap composed of 33 places in 465 ms of which 6 ms to minimize.
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 7 ms to minimize.
[2024-05-22 07:43:42] [INFO ] Deduced a trap composed of 39 places in 453 ms of which 8 ms to minimize.
[2024-05-22 07:43:43] [INFO ] Deduced a trap composed of 35 places in 447 ms of which 6 ms to minimize.
[2024-05-22 07:43:43] [INFO ] Deduced a trap composed of 33 places in 441 ms of which 7 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 37 places in 428 ms of which 6 ms to minimize.
[2024-05-22 07:43:44] [INFO ] Deduced a trap composed of 38 places in 410 ms of which 6 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 6 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 6 ms to minimize.
[2024-05-22 07:43:45] [INFO ] Deduced a trap composed of 40 places in 397 ms of which 6 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 5 ms to minimize.
[2024-05-22 07:43:46] [INFO ] Deduced a trap composed of 36 places in 387 ms of which 6 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 6 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 33 places in 412 ms of which 6 ms to minimize.
[2024-05-22 07:43:47] [INFO ] Deduced a trap composed of 33 places in 457 ms of which 6 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 33 places in 449 ms of which 6 ms to minimize.
[2024-05-22 07:43:48] [INFO ] Deduced a trap composed of 33 places in 470 ms of which 7 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 33 places in 469 ms of which 7 ms to minimize.
[2024-05-22 07:43:49] [INFO ] Deduced a trap composed of 33 places in 466 ms of which 6 ms to minimize.
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:43:50] [INFO ] Deduced a trap composed of 33 places in 466 ms of which 6 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 33 places in 463 ms of which 7 ms to minimize.
[2024-05-22 07:43:51] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 7 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 42 places in 449 ms of which 6 ms to minimize.
[2024-05-22 07:43:52] [INFO ] Deduced a trap composed of 43 places in 449 ms of which 8 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 41 places in 449 ms of which 6 ms to minimize.
[2024-05-22 07:43:53] [INFO ] Deduced a trap composed of 47 places in 447 ms of which 7 ms to minimize.
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 6 ms to minimize.
[2024-05-22 07:43:54] [INFO ] Deduced a trap composed of 33 places in 437 ms of which 6 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 6 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 6 ms to minimize.
[2024-05-22 07:43:55] [INFO ] Deduced a trap composed of 33 places in 439 ms of which 7 ms to minimize.
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 6 ms to minimize.
[2024-05-22 07:43:56] [INFO ] Deduced a trap composed of 33 places in 423 ms of which 6 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 6 ms to minimize.
[2024-05-22 07:43:57] [INFO ] Deduced a trap composed of 37 places in 420 ms of which 6 ms to minimize.
[2024-05-22 07:43:58] [INFO ] Deduced a trap composed of 37 places in 425 ms of which 6 ms to minimize.
[2024-05-22 07:43:58] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 6 ms to minimize.
[2024-05-22 07:43:59] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 6 ms to minimize.
[2024-05-22 07:43:59] [INFO ] Deduced a trap composed of 38 places in 423 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1029 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:43:59] [INFO ] Deduced a trap composed of 38 places in 411 ms of which 6 ms to minimize.
[2024-05-22 07:44:00] [INFO ] Deduced a trap composed of 39 places in 422 ms of which 6 ms to minimize.
[2024-05-22 07:44:00] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 6 ms to minimize.
[2024-05-22 07:44:01] [INFO ] Deduced a trap composed of 39 places in 419 ms of which 6 ms to minimize.
[2024-05-22 07:44:01] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 6 ms to minimize.
[2024-05-22 07:44:02] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 10 ms to minimize.
[2024-05-22 07:44:02] [INFO ] Deduced a trap composed of 35 places in 410 ms of which 6 ms to minimize.
[2024-05-22 07:44:02] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 6 ms to minimize.
[2024-05-22 07:44:03] [INFO ] Deduced a trap composed of 36 places in 407 ms of which 6 ms to minimize.
[2024-05-22 07:44:03] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 6 ms to minimize.
[2024-05-22 07:44:04] [INFO ] Deduced a trap composed of 36 places in 398 ms of which 6 ms to minimize.
[2024-05-22 07:44:04] [INFO ] Deduced a trap composed of 33 places in 403 ms of which 6 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1029 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1059 variables, 30/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1059 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1924/2983 variables, 1059/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2983 variables, 1842/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2983 variables, 0/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2984 variables, 1/3056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2984 variables, 0/3056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2984 variables, 0/3056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2984/2984 variables, and 3056 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45685 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1060/1060 constraints, ReadFeed: 1842/1842 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 999/1003 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 26/1029 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 92/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:06] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 6 ms to minimize.
[2024-05-22 07:44:06] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 6 ms to minimize.
[2024-05-22 07:44:06] [INFO ] Deduced a trap composed of 34 places in 419 ms of which 6 ms to minimize.
[2024-05-22 07:44:07] [INFO ] Deduced a trap composed of 34 places in 412 ms of which 6 ms to minimize.
[2024-05-22 07:44:07] [INFO ] Deduced a trap composed of 33 places in 416 ms of which 6 ms to minimize.
[2024-05-22 07:44:08] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 6 ms to minimize.
[2024-05-22 07:44:08] [INFO ] Deduced a trap composed of 33 places in 392 ms of which 6 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 7 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 6 ms to minimize.
[2024-05-22 07:44:09] [INFO ] Deduced a trap composed of 39 places in 387 ms of which 6 ms to minimize.
[2024-05-22 07:44:10] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 6 ms to minimize.
[2024-05-22 07:44:10] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 6 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 7 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 33 places in 373 ms of which 6 ms to minimize.
[2024-05-22 07:44:11] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 6 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 33 places in 375 ms of which 6 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 6 ms to minimize.
[2024-05-22 07:44:12] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 6 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 5 ms to minimize.
[2024-05-22 07:44:13] [INFO ] Deduced a trap composed of 35 places in 326 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 6 ms to minimize.
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 5 ms to minimize.
[2024-05-22 07:44:14] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 6 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 6 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 6 ms to minimize.
[2024-05-22 07:44:15] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 6 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 5 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 5 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 7 ms to minimize.
[2024-05-22 07:44:16] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 10/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1029 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1059 variables, 30/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1924/2983 variables, 1059/1243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2983 variables, 1842/3085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2983 variables, 1/3086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2983 variables, 0/3086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2984 variables, 1/3087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2984 variables, 0/3087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2984 variables, 0/3087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2984/2984 variables, and 3087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13098 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1060/1060 constraints, ReadFeed: 1842/1842 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 123/123 constraints]
After SMT, in 58832ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1440 steps, including 139 resets, run visited all 1 properties in 10 ms. (steps per millisecond=144 )
FORMULA CANConstruction-PT-030-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 22 ms.
All properties solved without resorting to model-checking.
Total runtime 84361 ms.
ITS solved all properties within timeout

BK_STOP 1716363858594

--------------------
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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r069-tall-171620503700031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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