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-171620503800094.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 CANInsertWithFailure-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K 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 Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 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 202K 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 CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716384801193

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 13:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 13:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:33:22] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-22 13:33:22] [INFO ] Transformed 114 places.
[2024-05-22 13:33:22] [INFO ] Transformed 180 transitions.
[2024-05-22 13:33:22] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (401 resets) in 1810 ms. (22 steps per ms) remains 14/16 properties
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (109 resets) in 295 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (116 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (93 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (94 resets) in 464 ms. (86 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (99 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (98 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (52 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (95 resets) in 646 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (104 resets) in 235 ms. (169 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (89 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (103 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (106 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
// Phase 1: matrix 180 rows 114 cols
[2024-05-22 13:33:24] [INFO ] Computed 8 invariants in 17 ms
[2024-05-22 13:33:24] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-01 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 11/112 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/119 constraints. Problems are: Problem set: 5 solved, 9 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/164 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/164 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/294 variables, 2/166 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/167 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/167 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/294 variables, 0/167 constraints. Problems are: Problem set: 6 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 167 constraints, problems are : Problem set: 6 solved, 8 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 8 unsolved
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 15/112 variables, 4/6 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 8 unsolved
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:33:25] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 180/292 variables, 112/126 constraints. Problems are: Problem set: 7 solved, 7 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 45/171 constraints. Problems are: Problem set: 8 solved, 6 unsolved
Problem CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-13 is UNSAT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/172 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/172 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/294 variables, 2/174 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 1/175 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 5/180 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/294 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/294 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 180 constraints, problems are : Problem set: 9 solved, 5 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 1987ms problems are : Problem set: 9 solved, 5 unsolved
Parikh walk visited 0 properties in 442 ms.
Support contains 90 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 112 transition count 179
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 112 transition count 179
Applied a total of 7 rules in 74 ms. Remains 112 /114 variables (removed 2) and now considering 179/180 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 112/114 places, 179/180 transitions.
RANDOM walk for 40000 steps (410 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (99 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (96 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (93 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 861697 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 5
Probabilistic random walk after 861697 steps, saw 164744 distinct states, run finished after 3017 ms. (steps per millisecond=285 ) properties seen :0
// Phase 1: matrix 179 rows 112 cols
[2024-05-22 13:33:30] [INFO ] Computed 7 invariants in 5 ms
[2024-05-22 13:33:30] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 179/290 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/291 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 164 constraints, problems are : Problem set: 0 solved, 5 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:33:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 179/290 variables, 111/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/291 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 5 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1287ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 527 ms.
Support contains 90 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 179/179 transitions.
Applied a total of 0 rules in 15 ms. Remains 112 /112 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 112/112 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-22 13:33:31] [INFO ] Invariant cache hit.
[2024-05-22 13:33:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 13:33:31] [INFO ] Invariant cache hit.
[2024-05-22 13:33:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 13:33:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-22 13:33:32] [INFO ] Redundant transitions in 4 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 13:33:32] [INFO ] Invariant cache hit.
[2024-05-22 13:33:32] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 13:33:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:33:32] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 2 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-22 13:33:34] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 13:33:34] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:33:34] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-22 13:33:34] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 13:33:35] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:33:35] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 13:33:35] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 179/290 variables, 111/136 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 45/181 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 1/291 variables, 1/182 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/291 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 182 constraints, problems are : Problem set: 2 solved, 172 unsolved in 10717 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 2 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 18/25 constraints. Problems are: Problem set: 2 solved, 172 unsolved
[2024-05-22 13:33:43] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 172 unsolved
[2024-05-22 13:33:43] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:33:43] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:33:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 3/29 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 179/290 variables, 111/140 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 45/185 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 172/357 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 1/291 variables, 1/358 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/358 constraints. Problems are: Problem set: 2 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/358 constraints. Problems are: Problem set: 2 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 358 constraints, problems are : Problem set: 2 solved, 172 unsolved in 9064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 172/174 constraints, Known Traps: 22/22 constraints]
After SMT, in 19830ms problems are : Problem set: 2 solved, 172 unsolved
Search for dead transitions found 2 dead transitions in 19835ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/112 places, 177/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-22 13:33:51] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20046 ms. Remains : 112/112 places, 177/179 transitions.
RANDOM walk for 40000 steps (389 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (105 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (89 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (32 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (96 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 926136 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 5
Probabilistic random walk after 926136 steps, saw 174296 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 177 rows 112 cols
[2024-05-22 13:33:55] [INFO ] Computed 7 invariants in 5 ms
[2024-05-22 13:33:55] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 177/288 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/289 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 164 constraints, problems are : Problem set: 0 solved, 5 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 13:33:55] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:33:55] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-22 13:33:55] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:33:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:33:55] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 2 ms to minimize.
[2024-05-22 13:33:55] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 177/288 variables, 111/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/289 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 175 constraints, problems are : Problem set: 0 solved, 5 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1212ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 90 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 112/112 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-22 13:33:56] [INFO ] Invariant cache hit.
[2024-05-22 13:33:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 13:33:56] [INFO ] Invariant cache hit.
[2024-05-22 13:33:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 13:33:56] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-22 13:33:56] [INFO ] Redundant transitions in 3 ms returned []
Running 172 sub problems to find dead transitions.
[2024-05-22 13:33:56] [INFO ] Invariant cache hit.
[2024-05-22 13:33:56] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 177/288 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 1/289 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 164 constraints, problems are : Problem set: 0 solved, 172 unsolved in 5826 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 13:34:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:34:02] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:34:02] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:34:03] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:34:03] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 13:34:03] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:34:03] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:34:03] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:34:04] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:34:05] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 13:34:05] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 177/288 variables, 111/136 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 45/181 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 172/353 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 1/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 172 unsolved in 10247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 18/18 constraints]
After SMT, in 16104ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 16109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16260 ms. Remains : 112/112 places, 177/177 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 218 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 110 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 110 transition count 163
Applied a total of 16 rules in 9 ms. Remains 110 /112 variables (removed 2) and now considering 163/177 (removed 14) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 163 rows 110 cols
[2024-05-22 13:34:12] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 13:34:12] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 13:34:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:34:13] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 13:34:13] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 13:34:13] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 538 ms.
[2024-05-22 13:34:13] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 13:34:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 177 transitions and 487 arcs took 4 ms.
[2024-05-22 13:34:13] [INFO ] Flatten gal took : 32 ms
Total runtime 51354 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-005

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 112
TRANSITIONS: 177
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 777
MODEL NAME: /home/mcc/execution/413/model
112 places, 177 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 CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716384858433

--------------------
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 ReachabilityCardinality -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="CANInsertWithFailure-PT-005"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANInsertWithFailure-PT-005, examination is ReachabilityCardinality"
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-171620503800094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-005.tgz
mv CANInsertWithFailure-PT-005 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;