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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 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 22M 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-060-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716400507347

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-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:55:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 17:55:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:55:09] [INFO ] Load time of PNML (sax parser for PT used): 669 ms
[2024-05-22 17:55:09] [INFO ] Transformed 7924 places.
[2024-05-22 17:55:09] [INFO ] Transformed 21960 transitions.
[2024-05-22 17:55:09] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 855 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 3203 ms. (12 steps per ms) remains 13/16 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1371 ms. (29 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
// Phase 1: matrix 21960 rows 7924 cols
[2024-05-22 17:55:14] [INFO ] Computed 63 invariants in 2543 ms
[2024-05-22 17:55:14] [INFO ] State equation strengthened by 7140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 7448/7849 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7849 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 70/7919 variables, 35/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7919 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/7921 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7921/29884 variables, and 62 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 60/61 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/7924 constraints, ReadFeed: 0/7140 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 7448/7849 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 17:55:21] [INFO ] Deduced a trap composed of 5 places in 489 ms of which 46 ms to minimize.
[2024-05-22 17:55:22] [INFO ] Deduced a trap composed of 5 places in 454 ms of which 6 ms to minimize.
[2024-05-22 17:55:22] [INFO ] Deduced a trap composed of 5 places in 405 ms of which 5 ms to minimize.
[2024-05-22 17:55:23] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 5 ms to minimize.
[2024-05-22 17:55:23] [INFO ] Deduced a trap composed of 5 places in 441 ms of which 5 ms to minimize.
[2024-05-22 17:55:24] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 5 ms to minimize.
[2024-05-22 17:55:24] [INFO ] Deduced a trap composed of 5 places in 494 ms of which 6 ms to minimize.
SMT process timed out in 13248ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 401 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 364 transitions
Trivial Post-agglo rules discarded 364 transitions
Performed 364 trivial Post agglomeration. Transition count delta: 364
Iterating post reduction 0 with 364 rules applied. Total rules applied 365 place count 7923 transition count 21596
Reduce places removed 364 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 379 rules applied. Total rules applied 744 place count 7559 transition count 21581
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 759 place count 7544 transition count 21581
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 759 place count 7544 transition count 21573
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 775 place count 7536 transition count 21573
Performed 2968 Post agglomeration using F-continuation condition.Transition count delta: 2968
Deduced a syphon composed of 2968 places in 20 ms
Reduce places removed 2968 places and 0 transitions.
Iterating global reduction 3 with 5936 rules applied. Total rules applied 6711 place count 4568 transition count 18605
Drop transitions (Redundant composition of simpler transitions.) removed 2873 transitions
Redundant transition composition rules discarded 2873 transitions
Iterating global reduction 3 with 2873 rules applied. Total rules applied 9584 place count 4568 transition count 15732
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 9594 place count 4568 transition count 15722
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 9604 place count 4558 transition count 15722
Partial Free-agglomeration rule applied 4178 times.
Drop transitions (Partial Free agglomeration) removed 4178 transitions
Iterating global reduction 4 with 4178 rules applied. Total rules applied 13782 place count 4558 transition count 15722
Partial Free-agglomeration rule applied 699 times.
Drop transitions (Partial Free agglomeration) removed 699 transitions
Iterating global reduction 4 with 699 rules applied. Total rules applied 14481 place count 4558 transition count 15722
Applied a total of 14481 rules in 7031 ms. Remains 4558 /7924 variables (removed 3366) and now considering 15722/21960 (removed 6238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7053 ms. Remains : 4558/7924 places, 15722/21960 transitions.
RANDOM walk for 40000 steps (106 resets) in 1153 ms. (34 steps per ms) remains 10/13 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
// Phase 1: matrix 15722 rows 4558 cols
[2024-05-22 17:55:33] [INFO ] Computed 62 invariants in 824 ms
[2024-05-22 17:55:33] [INFO ] State equation strengthened by 12989 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4176/4478 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4478 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 76/4554 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4554 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/4556 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4556 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 15722/20278 variables, 4556/4618 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20278 variables, 12989/17607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20278 variables, 0/17607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/20280 variables, 2/17609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/20280 variables, 0/17609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/20280 variables, 0/17609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20280/20280 variables, and 17609 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45053 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4558/4558 constraints, ReadFeed: 12989/12989 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4176/4478 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:56:19] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/4478 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4478 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 76/4554 variables, 38/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4554 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/4556 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:56:28] [INFO ] Deduced a trap composed of 97 places in 4945 ms of which 26 ms to minimize.
[2024-05-22 17:56:33] [INFO ] Deduced a trap composed of 76 places in 4870 ms of which 25 ms to minimize.
[2024-05-22 17:56:33] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 4 ms to minimize.
[2024-05-22 17:56:33] [INFO ] Deduced a trap composed of 71 places in 224 ms of which 3 ms to minimize.
[2024-05-22 17:56:34] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 2 ms to minimize.
[2024-05-22 17:56:34] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 3 ms to minimize.
[2024-05-22 17:56:34] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/4556 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4556 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 15722/20278 variables, 4556/4626 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20278 variables, 12989/17615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20278/20280 variables, and 17625 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45143 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4556/4558 constraints, ReadFeed: 12989/12989 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 8/8 constraints]
After SMT, in 91323ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 302 out of 4558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4558/4558 places, 15722/15722 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 4558 transition count 15721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4557 transition count 15721
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 106 place count 4505 transition count 15669
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 4505 transition count 15666
Partial Free-agglomeration rule applied 218 times.
Drop transitions (Partial Free agglomeration) removed 218 transitions
Iterating global reduction 2 with 218 rules applied. Total rules applied 327 place count 4505 transition count 15666
Applied a total of 327 rules in 2620 ms. Remains 4505 /4558 variables (removed 53) and now considering 15666/15722 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2620 ms. Remains : 4505/4558 places, 15666/15722 transitions.
RANDOM walk for 40000 steps (111 resets) in 1565 ms. (25 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 64297 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 10
Probabilistic random walk after 64297 steps, saw 46952 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 15666 rows 4505 cols
[2024-05-22 17:57:11] [INFO ] Computed 62 invariants in 757 ms
[2024-05-22 17:57:11] [INFO ] State equation strengthened by 13413 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4123/4425 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4425 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 76/4501 variables, 38/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4501 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/4503 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4503 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 15666/20169 variables, 4503/4565 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20169 variables, 13413/17978 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20169 variables, 0/17978 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/20171 variables, 2/17980 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/20171 variables, 0/17980 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/20171 variables, 0/17980 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20171/20171 variables, and 17980 constraints, problems are : Problem set: 0 solved, 10 unsolved in 53317 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4505/4505 constraints, ReadFeed: 13413/13413 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4123/4425 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:58:06] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/4425 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4425 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 76/4501 variables, 38/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4501 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/4503 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 17:58:14] [INFO ] Deduced a trap composed of 78 places in 5321 ms of which 26 ms to minimize.
[2024-05-22 17:58:19] [INFO ] Deduced a trap composed of 82 places in 4984 ms of which 23 ms to minimize.
[2024-05-22 17:58:25] [INFO ] Deduced a trap composed of 75 places in 5142 ms of which 25 ms to minimize.
[2024-05-22 17:58:30] [INFO ] Deduced a trap composed of 79 places in 4976 ms of which 25 ms to minimize.
[2024-05-22 17:58:35] [INFO ] Deduced a trap composed of 76 places in 4948 ms of which 26 ms to minimize.
[2024-05-22 17:58:39] [INFO ] Deduced a trap composed of 85 places in 4754 ms of which 24 ms to minimize.
[2024-05-22 17:58:44] [INFO ] Deduced a trap composed of 83 places in 4436 ms of which 22 ms to minimize.
[2024-05-22 17:58:49] [INFO ] Deduced a trap composed of 88 places in 4740 ms of which 20 ms to minimize.
[2024-05-22 17:58:54] [INFO ] Deduced a trap composed of 65 places in 4805 ms of which 25 ms to minimize.
[2024-05-22 17:58:58] [INFO ] Deduced a trap composed of 73 places in 4511 ms of which 22 ms to minimize.
[2024-05-22 17:59:03] [INFO ] Deduced a trap composed of 86 places in 4475 ms of which 24 ms to minimize.
[2024-05-22 17:59:07] [INFO ] Deduced a trap composed of 87 places in 4400 ms of which 23 ms to minimize.
[2024-05-22 17:59:11] [INFO ] Deduced a trap composed of 88 places in 4330 ms of which 23 ms to minimize.
[2024-05-22 17:59:16] [INFO ] Deduced a trap composed of 79 places in 4287 ms of which 23 ms to minimize.
[2024-05-22 17:59:20] [INFO ] Deduced a trap composed of 78 places in 4194 ms of which 21 ms to minimize.
SMT process timed out in 129794ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 302 out of 4505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4505/4505 places, 15666/15666 transitions.
Applied a total of 0 rules in 712 ms. Remains 4505 /4505 variables (removed 0) and now considering 15666/15666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 712 ms. Remains : 4505/4505 places, 15666/15666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4505/4505 places, 15666/15666 transitions.
Applied a total of 0 rules in 671 ms. Remains 4505 /4505 variables (removed 0) and now considering 15666/15666 (removed 0) transitions.
[2024-05-22 17:59:21] [INFO ] Invariant cache hit.
[2024-05-22 17:59:29] [INFO ] Implicit Places using invariants in 7103 ms returned []
Implicit Place search using SMT only with invariants took 7110 ms to find 0 implicit places.
Running 15606 sub problems to find dead transitions.
[2024-05-22 17:59:29] [INFO ] Invariant cache hit.
[2024-05-22 17:59:29] [INFO ] State equation strengthened by 13413 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
(s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s35 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/4504 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 15606 unsolved
SMT process timed out in 61496ms, After SMT, problems are : Problem set: 0 solved, 15606 unsolved
Search for dead transitions found 0 dead transitions in 61665ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69501 ms. Remains : 4505/4505 places, 15666/15666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 12566 edges and 4505 vertex of which 2874 / 4505 are part of one of the 2 SCC in 13 ms
Free SCC test removed 2872 places
Drop transitions (Empty/Sink Transition effects.) removed 7388 transitions
Ensure Unique test removed 3215 transitions
Reduce isomorphic transitions removed 10603 transitions.
Graph (complete) has 5541 edges and 1633 vertex of which 1475 are kept as prefixes of interest. Removing 158 places using SCC suffix rule.1 ms
Discarding 158 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Drop transitions (Empty/Sink Transition effects.) removed 812 transitions
Reduce isomorphic transitions removed 812 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 816 rules applied. Total rules applied 818 place count 1475 transition count 4203
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 826 place count 1471 transition count 4199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 826 place count 1471 transition count 4191
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 842 place count 1463 transition count 4191
Discarding 641 places :
Symmetric choice reduction at 2 with 641 rule applications. Total rules 1483 place count 822 transition count 2826
Iterating global reduction 2 with 641 rules applied. Total rules applied 2124 place count 822 transition count 2826
Ensure Unique test removed 460 transitions
Reduce isomorphic transitions removed 460 transitions.
Iterating post reduction 2 with 460 rules applied. Total rules applied 2584 place count 822 transition count 2366
Discarding 118 places :
Symmetric choice reduction at 3 with 118 rule applications. Total rules 2702 place count 704 transition count 2130
Iterating global reduction 3 with 118 rules applied. Total rules applied 2820 place count 704 transition count 2130
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 118 rules applied. Total rules applied 2938 place count 704 transition count 2012
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2940 place count 703 transition count 2011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2941 place count 703 transition count 2010
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 5 with 72 rules applied. Total rules applied 3013 place count 703 transition count 1938
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 5 with 15 rules applied. Total rules applied 3028 place count 703 transition count 1923
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 17 rules applied. Total rules applied 3045 place count 688 transition count 1921
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3047 place count 686 transition count 1921
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3049 place count 685 transition count 1920
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3052 place count 685 transition count 1917
Free-agglomeration rule applied 258 times with reduction of 24 identical transitions.
Iterating global reduction 8 with 258 rules applied. Total rules applied 3310 place count 685 transition count 1635
Reduce places removed 258 places and 0 transitions.
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 8 with 500 rules applied. Total rules applied 3810 place count 427 transition count 1393
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 3834 place count 427 transition count 1369
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 3845 place count 427 transition count 1369
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 3877 place count 416 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3878 place count 416 transition count 1347
Partial Free-agglomeration rule applied 164 times.
Drop transitions (Partial Free agglomeration) removed 164 transitions
Iterating global reduction 10 with 164 rules applied. Total rules applied 4042 place count 416 transition count 1347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4043 place count 416 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 4044 place count 415 transition count 1343
Iterating global reduction 11 with 1 rules applied. Total rules applied 4045 place count 415 transition count 1343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4046 place count 415 transition count 1342
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 4047 place count 415 transition count 1341
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 4049 place count 415 transition count 1341
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 4054 place count 410 transition count 1336
Applied a total of 4054 rules in 1419 ms. Remains 410 /4505 variables (removed 4095) and now considering 1336/15666 (removed 14330) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 1336 rows 410 cols
[2024-05-22 18:00:32] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 18:00:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-22 18:00:32] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 18:00:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-22 18:00:33] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-22 18:00:34] [INFO ] After 1699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-22 18:00:35] [INFO ] After 2479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 4390 ms.
[2024-05-22 18:00:35] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-22 18:00:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4505 places, 15666 transitions and 60088 arcs took 69 ms.
[2024-05-22 18:00:36] [INFO ] Flatten gal took : 566 ms
Total runtime 327680 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-060

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4505
TRANSITIONS: 15666
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.315s, Sys 0.024s]


SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.050s, 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: 732
MODEL NAME: /home/mcc/execution/405/model
4505 places, 15666 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716401675518

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-060"
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-060, 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-171620503900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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