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.r245-tall-171654349100046.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 MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.7M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716575067200

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 18:24:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 18:24:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:24:28] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-24 18:24:28] [INFO ] Transformed 6222 places.
[2024-05-24 18:24:29] [INFO ] Transformed 8685 transitions.
[2024-05-24 18:24:29] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 644 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (550 resets) in 2946 ms. (13 steps per ms) remains 12/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (152 resets) in 350 ms. (113 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 368 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 381 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 769 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (152 resets) in 1125 ms. (35 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (152 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (152 resets) in 266 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (152 resets) in 338 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (152 resets) in 348 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 295 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
[2024-05-24 18:24:31] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-24 18:24:32] [INFO ] Computed 611 invariants in 660 ms
[2024-05-24 18:24:32] [INFO ] State equation strengthened by 2450 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 679/1003 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 26/1029 variables, 10/16 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 30/1059 variables, 30/46 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1059 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 3942/5001 variables, 289/335 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5001 variables, 0/335 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/5009 variables, 8/343 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5009 variables, 0/343 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1213/6222 variables, 268/611 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6222 variables, 0/611 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14635/14635 variables, and 6833 constraints, problems are : Problem set: 11 solved, 1 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 559/559 constraints, State Equation: 6222/6222 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3291/3292 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3292 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 521/3813 variables, 52/54 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-24 18:24:42] [INFO ] Deduced a trap composed of 202 places in 3604 ms of which 214 ms to minimize.
[2024-05-24 18:24:45] [INFO ] Deduced a trap composed of 221 places in 3161 ms of which 28 ms to minimize.
SMT process timed out in 13515ms, After SMT, problems are : Problem set: 11 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.24 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1903 transitions
Trivial Post-agglo rules discarded 1903 transitions
Performed 1903 trivial Post agglomeration. Transition count delta: 1903
Iterating post reduction 0 with 1903 rules applied. Total rules applied 1904 place count 6188 transition count 6782
Reduce places removed 1903 places and 0 transitions.
Iterating post reduction 1 with 1903 rules applied. Total rules applied 3807 place count 4285 transition count 6782
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 3807 place count 4285 transition count 6544
Deduced a syphon composed of 238 places in 5 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 4283 place count 4047 transition count 6544
Discarding 1665 places :
Symmetric choice reduction at 2 with 1665 rule applications. Total rules 5948 place count 2382 transition count 4879
Iterating global reduction 2 with 1665 rules applied. Total rules applied 7613 place count 2382 transition count 4879
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 7613 place count 2382 transition count 4866
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 7639 place count 2369 transition count 4866
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 7876 place count 2132 transition count 3207
Iterating global reduction 2 with 237 rules applied. Total rules applied 8113 place count 2132 transition count 3207
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 8147 place count 2115 transition count 3190
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 2 with 161 rules applied. Total rules applied 8308 place count 2115 transition count 4451
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 2 with 161 rules applied. Total rules applied 8469 place count 1954 transition count 4451
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 8486 place count 1954 transition count 4451
Applied a total of 8486 rules in 1907 ms. Remains 1954 /6222 variables (removed 4268) and now considering 4451/8685 (removed 4234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1920 ms. Remains : 1954/6222 places, 4451/8685 transitions.
RANDOM walk for 40000 steps (915 resets) in 1063 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (169 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 53438 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 1
Probabilistic random walk after 53438 steps, saw 23872 distinct states, run finished after 3011 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 18:24:50] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
// Phase 1: matrix 4053 rows 1954 cols
[2024-05-24 18:24:50] [INFO ] Computed 577 invariants in 66 ms
[2024-05-24 18:24:50] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 888/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 283/1172 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 636/1808 variables, 428/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:24:52] [INFO ] Deduced a trap composed of 5 places in 1528 ms of which 12 ms to minimize.
[2024-05-24 18:24:54] [INFO ] Deduced a trap composed of 228 places in 1682 ms of which 12 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1808 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1808 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/1836 variables, 28/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1836 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/1954 variables, 118/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:24:56] [INFO ] Deduced a trap composed of 360 places in 1782 ms of which 15 ms to minimize.
[2024-05-24 18:24:58] [INFO ] Deduced a trap composed of 323 places in 1974 ms of which 14 ms to minimize.
[2024-05-24 18:25:00] [INFO ] Deduced a trap composed of 361 places in 1684 ms of which 13 ms to minimize.
[2024-05-24 18:25:01] [INFO ] Deduced a trap composed of 350 places in 1641 ms of which 14 ms to minimize.
[2024-05-24 18:25:03] [INFO ] Deduced a trap composed of 353 places in 1599 ms of which 13 ms to minimize.
[2024-05-24 18:25:05] [INFO ] Deduced a trap composed of 260 places in 1668 ms of which 13 ms to minimize.
[2024-05-24 18:25:06] [INFO ] Deduced a trap composed of 302 places in 1652 ms of which 13 ms to minimize.
[2024-05-24 18:25:08] [INFO ] Deduced a trap composed of 232 places in 1723 ms of which 13 ms to minimize.
[2024-05-24 18:25:10] [INFO ] Deduced a trap composed of 259 places in 1685 ms of which 12 ms to minimize.
[2024-05-24 18:25:12] [INFO ] Deduced a trap composed of 377 places in 1670 ms of which 13 ms to minimize.
[2024-05-24 18:25:13] [INFO ] Deduced a trap composed of 241 places in 1659 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1954 variables, 11/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1954 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4053/6007 variables, 1954/2544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6007 variables, 2450/4994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/6007 variables, 0/4994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/6007 variables, 0/4994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6007/6007 variables, and 4994 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24990 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 546/546 constraints, State Equation: 1954/1954 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 888/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 283/1172 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 636/1808 variables, 428/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1808 variables, 3/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:25:17] [INFO ] Deduced a trap composed of 241 places in 1617 ms of which 12 ms to minimize.
[2024-05-24 18:25:19] [INFO ] Deduced a trap composed of 239 places in 1580 ms of which 11 ms to minimize.
[2024-05-24 18:25:20] [INFO ] Deduced a trap composed of 265 places in 1337 ms of which 11 ms to minimize.
[2024-05-24 18:25:22] [INFO ] Deduced a trap composed of 202 places in 1465 ms of which 12 ms to minimize.
[2024-05-24 18:25:23] [INFO ] Deduced a trap composed of 186 places in 1467 ms of which 11 ms to minimize.
[2024-05-24 18:25:25] [INFO ] Deduced a trap composed of 227 places in 1520 ms of which 11 ms to minimize.
[2024-05-24 18:25:26] [INFO ] Deduced a trap composed of 225 places in 1502 ms of which 11 ms to minimize.
[2024-05-24 18:25:28] [INFO ] Deduced a trap composed of 238 places in 1607 ms of which 12 ms to minimize.
[2024-05-24 18:25:30] [INFO ] Deduced a trap composed of 257 places in 1576 ms of which 13 ms to minimize.
[2024-05-24 18:25:31] [INFO ] Deduced a trap composed of 236 places in 1544 ms of which 11 ms to minimize.
[2024-05-24 18:25:33] [INFO ] Deduced a trap composed of 201 places in 1535 ms of which 11 ms to minimize.
[2024-05-24 18:25:34] [INFO ] Deduced a trap composed of 182 places in 1518 ms of which 11 ms to minimize.
[2024-05-24 18:25:36] [INFO ] Deduced a trap composed of 220 places in 1440 ms of which 11 ms to minimize.
[2024-05-24 18:25:38] [INFO ] Deduced a trap composed of 285 places in 1555 ms of which 12 ms to minimize.
[2024-05-24 18:25:39] [INFO ] Deduced a trap composed of 260 places in 1460 ms of which 11 ms to minimize.
[2024-05-24 18:25:41] [INFO ] Deduced a trap composed of 241 places in 1625 ms of which 15 ms to minimize.
[2024-05-24 18:25:42] [INFO ] Deduced a trap composed of 256 places in 1578 ms of which 12 ms to minimize.
[2024-05-24 18:25:44] [INFO ] Deduced a trap composed of 270 places in 1590 ms of which 11 ms to minimize.
[2024-05-24 18:25:45] [INFO ] Deduced a trap composed of 249 places in 1556 ms of which 12 ms to minimize.
[2024-05-24 18:25:47] [INFO ] Deduced a trap composed of 280 places in 1530 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1808 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:25:49] [INFO ] Deduced a trap composed of 267 places in 1466 ms of which 11 ms to minimize.
[2024-05-24 18:25:50] [INFO ] Deduced a trap composed of 259 places in 1530 ms of which 12 ms to minimize.
[2024-05-24 18:25:52] [INFO ] Deduced a trap composed of 236 places in 1494 ms of which 11 ms to minimize.
[2024-05-24 18:25:53] [INFO ] Deduced a trap composed of 299 places in 1498 ms of which 12 ms to minimize.
[2024-05-24 18:25:55] [INFO ] Deduced a trap composed of 239 places in 1506 ms of which 11 ms to minimize.
[2024-05-24 18:25:56] [INFO ] Deduced a trap composed of 277 places in 1486 ms of which 11 ms to minimize.
[2024-05-24 18:25:58] [INFO ] Deduced a trap composed of 256 places in 1515 ms of which 11 ms to minimize.
[2024-05-24 18:25:59] [INFO ] Deduced a trap composed of 264 places in 1629 ms of which 12 ms to minimize.
[2024-05-24 18:26:01] [INFO ] Deduced a trap composed of 240 places in 1624 ms of which 13 ms to minimize.
SMT process timed out in 70964ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 4451/4451 transitions.
Applied a total of 0 rules in 171 ms. Remains 1954 /1954 variables (removed 0) and now considering 4451/4451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 1954/1954 places, 4451/4451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 4451/4451 transitions.
Applied a total of 0 rules in 161 ms. Remains 1954 /1954 variables (removed 0) and now considering 4451/4451 (removed 0) transitions.
[2024-05-24 18:26:01] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
[2024-05-24 18:26:01] [INFO ] Invariant cache hit.
[2024-05-24 18:26:06] [INFO ] Implicit Places using invariants in 4486 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 317, 318, 320, 322, 326, 332, 340, 350, 361, 371, 372, 373, 374, 375, 376, 377, 378, 386, 392, 396, 398, 400, 402, 419, 425, 427, 428, 429, 430, 431, 432, 433, 434, 436, 438, 440, 444, 450, 458, 467, 475, 476, 477, 478, 479, 480, 481, 482, 488, 492, 494, 496, 498, 500, 517, 523, 525, 526, 527, 528, 529, 530, 531, 532, 534, 536, 538, 540, 544, 550, 557, 563, 564, 565, 566, 567, 568, 569, 570, 574, 576, 578, 580, 582, 584, 601, 607, 609, 610, 611, 612, 613, 614, 615, 616, 618, 620, 622, 624, 626, 630, 635, 639, 640, 641, 642, 643, 644, 645, 646, 648, 650, 652, 654, 656, 658, 675, 681, 683, 684, 685, 686, 687, 688, 689, 690, 692, 694, 696, 698, 700, 702, 705, 707, 708, 709, 710, 711, 712, 713, 714, 716, 718, 720, 722, 724, 726, 743, 749, 751, 752, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 780, 781, 783, 785, 787, 789, 791, 793, 810, 812, 815, 817, 818, 819, 820, 821, 822, 823, 824, 826, 828, 830, 832, 834, 836, 838, 840, 841, 842, 843, 844, 845, 846, 847, 849, 851, 853, 855, 857, 859, 876, 882, 884, 885, 886, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 903, 905, 907, 908, 909, 910, 911, 912, 913, 914, 916, 918, 920, 922, 924, 926, 943, 949, 951, 952, 953, 954, 955, 956, 957, 958, 960, 962, 964, 966, 968, 970, 972, 975, 976, 977, 978, 979, 980, 981, 982, 984, 986, 988, 990, 992, 994, 1011, 1017, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1028, 1030, 1032, 1034, 1036, 1038, 1042, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1058, 1060, 1062, 1064, 1066, 1068, 1085, 1091, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1102, 1104, 1106, 1108, 1110, 1114, 1120, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1140, 1144, 1146, 1148, 1150, 1152, 1169, 1175, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1186, 1188, 1190, 1192, 1196, 1202, 1210, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1234, 1240, 1244, 1246, 1248, 1250, 1267, 1273, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1284, 1286, 1288, 1292, 1298, 1306, 1316, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1344, 1352, 1358, 1362, 1364, 1366, 1383, 1389, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1400, 1402, 1406, 1412, 1420, 1430, 1442, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1474, 1484, 1492, 1498, 1502, 1504, 1521, 1523, 1526, 1528, 1529, 1530, 1531, 1532, 1533, 1535, 1537, 1541, 1549, 1557, 1567, 1579, 1593, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1629, 1641, 1651, 1659, 1665, 1669, 1686]
[2024-05-24 18:26:06] [INFO ] Actually due to overlaps returned [165, 303, 419, 517, 601, 675, 743, 810, 876, 943, 1011, 1085, 1169, 1267, 1383, 1521, 1686, 4, 9, 10, 11, 12, 13, 14, 15, 99, 100, 101, 102, 103, 104, 105, 173, 174, 175, 176, 177, 178, 179, 247, 248, 249, 250, 251, 252, 253, 311, 312, 313, 314, 315, 316, 317, 371, 372, 373, 374, 375, 376, 377, 427, 428, 429, 430, 431, 432, 433, 475, 476, 477, 478, 479, 480, 481, 525, 526, 527, 528, 529, 530, 531, 563, 564, 565, 566, 567, 568, 569, 609, 610, 611, 612, 613, 614, 615, 639, 640, 641, 642, 643, 644, 645, 683, 684, 685, 686, 687, 688, 689, 707, 708, 709, 710, 711, 712, 713, 751, 752, 753, 754, 755, 756, 757, 774, 775, 776, 777, 778, 779, 780, 812, 817, 818, 819, 820, 821, 822, 823, 840, 841, 842, 843, 844, 845, 846, 884, 885, 886, 887, 888, 889, 890, 907, 908, 909, 910, 911, 912, 913, 951, 952, 953, 954, 955, 956, 957, 975, 976, 977, 978, 979, 980, 981, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1523, 1528, 1529, 1530, 1531, 1532, 1533, 1608, 1609, 1610, 1611, 1612, 1613, 1614]
Discarding 257 places :
Implicit Place search using SMT only with invariants took 4505 ms to find 257 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1697/1954 places, 4451/4451 transitions.
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 223 place count 1474 transition count 4228
Iterating global reduction 0 with 223 rules applied. Total rules applied 446 place count 1474 transition count 4228
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 669 place count 1251 transition count 4005
Iterating global reduction 0 with 223 rules applied. Total rules applied 892 place count 1251 transition count 4005
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 895 place count 1251 transition count 4002
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 898 place count 1248 transition count 4002
Applied a total of 898 rules in 331 ms. Remains 1248 /1697 variables (removed 449) and now considering 4002/4451 (removed 449) transitions.
[2024-05-24 18:26:06] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 1248 cols
[2024-05-24 18:26:06] [INFO ] Computed 320 invariants in 34 ms
[2024-05-24 18:26:09] [INFO ] Implicit Places using invariants in 2523 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 154, 156, 158, 162, 168, 176, 186, 198, 211, 223, 233, 241, 247, 251, 253, 255, 263, 265, 267, 269, 273, 279, 287, 297, 308, 318, 326, 332, 336, 338, 340, 342, 350, 352, 354, 356, 358, 362, 368, 376, 385, 393, 399, 403, 405, 407, 409, 411, 419, 421, 423, 425, 427, 429, 433, 439, 446, 452, 456, 458, 460, 462, 464, 466, 474, 476, 478, 480, 482, 484, 486, 490, 495, 499, 501, 503, 505, 507, 509, 511, 519, 521, 523, 525, 527, 529, 531, 533, 536, 538, 540, 542, 544, 546, 548, 550, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 586, 588, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 622, 624, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 669, 671, 673, 675, 677, 679, 681, 683, 685, 688, 690, 692, 694, 696, 698, 700, 708, 710, 712, 714, 716, 718, 720, 722, 726, 731, 735, 737, 739, 741, 743, 745, 753, 755, 757, 759, 761, 763, 765, 769, 775, 782, 788, 792, 794, 796, 798, 800, 808, 810, 812, 814, 816, 818, 822, 828, 836, 845, 853, 859, 863, 865, 867, 869, 877, 879, 881, 883, 885, 889, 895, 903, 913, 924, 934, 942, 948, 952, 954, 956, 964, 966, 968, 970, 974, 980, 988, 998, 1010, 1023, 1035, 1045, 1053, 1059, 1063, 1065, 1071, 1074, 1076, 1080, 1088, 1096, 1106, 1118, 1132, 1147, 1161, 1173, 1183, 1191, 1197, 1201]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2540 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 976/1954 places, 4002/4451 transitions.
Applied a total of 0 rules in 115 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7653 ms. Remains : 976/1954 places, 4002/4451 transitions.
RANDOM walk for 40000 steps (964 resets) in 945 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (127 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66388 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66388 steps, saw 27851 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 18:26:12] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2024-05-24 18:26:12] [INFO ] Computed 48 invariants in 47 ms
[2024-05-24 18:26:12] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/900 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/934 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/962 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/962 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/976 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/976 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3604/4580 variables, 976/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4580 variables, 2450/3474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4580 variables, 0/3474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4580 variables, 0/3474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4580/4580 variables, and 3474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1393 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 976/976 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/900 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/934 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:26:15] [INFO ] Deduced a trap composed of 5 places in 574 ms of which 6 ms to minimize.
[2024-05-24 18:26:15] [INFO ] Deduced a trap composed of 70 places in 595 ms of which 7 ms to minimize.
[2024-05-24 18:26:16] [INFO ] Deduced a trap composed of 54 places in 620 ms of which 6 ms to minimize.
[2024-05-24 18:26:16] [INFO ] Deduced a trap composed of 57 places in 596 ms of which 6 ms to minimize.
[2024-05-24 18:26:17] [INFO ] Deduced a trap composed of 80 places in 597 ms of which 6 ms to minimize.
[2024-05-24 18:26:18] [INFO ] Deduced a trap composed of 63 places in 575 ms of which 6 ms to minimize.
[2024-05-24 18:26:18] [INFO ] Deduced a trap composed of 75 places in 561 ms of which 6 ms to minimize.
[2024-05-24 18:26:19] [INFO ] Deduced a trap composed of 67 places in 630 ms of which 7 ms to minimize.
[2024-05-24 18:26:20] [INFO ] Deduced a trap composed of 71 places in 616 ms of which 6 ms to minimize.
[2024-05-24 18:26:20] [INFO ] Deduced a trap composed of 67 places in 609 ms of which 6 ms to minimize.
[2024-05-24 18:26:21] [INFO ] Deduced a trap composed of 72 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:26:21] [INFO ] Deduced a trap composed of 69 places in 597 ms of which 5 ms to minimize.
[2024-05-24 18:26:22] [INFO ] Deduced a trap composed of 53 places in 579 ms of which 7 ms to minimize.
[2024-05-24 18:26:23] [INFO ] Deduced a trap composed of 52 places in 557 ms of which 5 ms to minimize.
[2024-05-24 18:26:23] [INFO ] Deduced a trap composed of 78 places in 539 ms of which 6 ms to minimize.
[2024-05-24 18:26:24] [INFO ] Deduced a trap composed of 62 places in 606 ms of which 6 ms to minimize.
[2024-05-24 18:26:24] [INFO ] Deduced a trap composed of 69 places in 547 ms of which 5 ms to minimize.
[2024-05-24 18:26:25] [INFO ] Deduced a trap composed of 85 places in 594 ms of which 6 ms to minimize.
[2024-05-24 18:26:26] [INFO ] Deduced a trap composed of 67 places in 604 ms of which 6 ms to minimize.
[2024-05-24 18:26:26] [INFO ] Deduced a trap composed of 60 places in 603 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:26:27] [INFO ] Deduced a trap composed of 52 places in 595 ms of which 6 ms to minimize.
[2024-05-24 18:26:27] [INFO ] Deduced a trap composed of 74 places in 572 ms of which 6 ms to minimize.
[2024-05-24 18:26:28] [INFO ] Deduced a trap composed of 53 places in 562 ms of which 6 ms to minimize.
[2024-05-24 18:26:29] [INFO ] Deduced a trap composed of 65 places in 567 ms of which 5 ms to minimize.
[2024-05-24 18:26:29] [INFO ] Deduced a trap composed of 72 places in 593 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/934 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/962 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:26:30] [INFO ] Deduced a trap composed of 70 places in 619 ms of which 6 ms to minimize.
[2024-05-24 18:26:30] [INFO ] Deduced a trap composed of 95 places in 602 ms of which 6 ms to minimize.
[2024-05-24 18:26:31] [INFO ] Deduced a trap composed of 65 places in 583 ms of which 7 ms to minimize.
[2024-05-24 18:26:32] [INFO ] Deduced a trap composed of 84 places in 592 ms of which 6 ms to minimize.
[2024-05-24 18:26:32] [INFO ] Deduced a trap composed of 69 places in 578 ms of which 6 ms to minimize.
[2024-05-24 18:26:33] [INFO ] Deduced a trap composed of 144 places in 600 ms of which 6 ms to minimize.
[2024-05-24 18:26:34] [INFO ] Deduced a trap composed of 151 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:26:34] [INFO ] Deduced a trap composed of 81 places in 555 ms of which 6 ms to minimize.
[2024-05-24 18:26:35] [INFO ] Deduced a trap composed of 75 places in 630 ms of which 7 ms to minimize.
[2024-05-24 18:26:35] [INFO ] Deduced a trap composed of 81 places in 620 ms of which 6 ms to minimize.
[2024-05-24 18:26:36] [INFO ] Deduced a trap composed of 74 places in 645 ms of which 6 ms to minimize.
[2024-05-24 18:26:37] [INFO ] Deduced a trap composed of 86 places in 645 ms of which 6 ms to minimize.
[2024-05-24 18:26:37] [INFO ] Deduced a trap composed of 208 places in 648 ms of which 6 ms to minimize.
[2024-05-24 18:26:38] [INFO ] Deduced a trap composed of 74 places in 608 ms of which 6 ms to minimize.
[2024-05-24 18:26:39] [INFO ] Deduced a trap composed of 80 places in 613 ms of which 8 ms to minimize.
[2024-05-24 18:26:39] [INFO ] Deduced a trap composed of 72 places in 613 ms of which 6 ms to minimize.
[2024-05-24 18:26:40] [INFO ] Deduced a trap composed of 56 places in 609 ms of which 6 ms to minimize.
[2024-05-24 18:26:41] [INFO ] Deduced a trap composed of 92 places in 634 ms of which 7 ms to minimize.
[2024-05-24 18:26:41] [INFO ] Deduced a trap composed of 53 places in 621 ms of which 6 ms to minimize.
[2024-05-24 18:26:42] [INFO ] Deduced a trap composed of 64 places in 618 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:26:43] [INFO ] Deduced a trap composed of 70 places in 639 ms of which 6 ms to minimize.
[2024-05-24 18:26:43] [INFO ] Deduced a trap composed of 61 places in 633 ms of which 6 ms to minimize.
[2024-05-24 18:26:44] [INFO ] Deduced a trap composed of 132 places in 622 ms of which 6 ms to minimize.
[2024-05-24 18:26:44] [INFO ] Deduced a trap composed of 79 places in 630 ms of which 6 ms to minimize.
[2024-05-24 18:26:45] [INFO ] Deduced a trap composed of 86 places in 622 ms of which 6 ms to minimize.
[2024-05-24 18:26:46] [INFO ] Deduced a trap composed of 61 places in 632 ms of which 6 ms to minimize.
[2024-05-24 18:26:46] [INFO ] Deduced a trap composed of 127 places in 637 ms of which 6 ms to minimize.
[2024-05-24 18:26:47] [INFO ] Deduced a trap composed of 119 places in 601 ms of which 6 ms to minimize.
[2024-05-24 18:26:48] [INFO ] Deduced a trap composed of 103 places in 569 ms of which 6 ms to minimize.
[2024-05-24 18:26:48] [INFO ] Deduced a trap composed of 76 places in 633 ms of which 6 ms to minimize.
[2024-05-24 18:26:49] [INFO ] Deduced a trap composed of 71 places in 597 ms of which 6 ms to minimize.
[2024-05-24 18:26:50] [INFO ] Deduced a trap composed of 69 places in 599 ms of which 6 ms to minimize.
[2024-05-24 18:26:50] [INFO ] Deduced a trap composed of 148 places in 598 ms of which 5 ms to minimize.
[2024-05-24 18:26:51] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 6 ms to minimize.
[2024-05-24 18:26:51] [INFO ] Deduced a trap composed of 65 places in 585 ms of which 6 ms to minimize.
[2024-05-24 18:26:52] [INFO ] Deduced a trap composed of 126 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:26:53] [INFO ] Deduced a trap composed of 80 places in 583 ms of which 6 ms to minimize.
[2024-05-24 18:26:53] [INFO ] Deduced a trap composed of 134 places in 588 ms of which 7 ms to minimize.
[2024-05-24 18:26:54] [INFO ] Deduced a trap composed of 85 places in 617 ms of which 7 ms to minimize.
[2024-05-24 18:26:55] [INFO ] Deduced a trap composed of 60 places in 568 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:26:55] [INFO ] Deduced a trap composed of 57 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:26:56] [INFO ] Deduced a trap composed of 126 places in 548 ms of which 6 ms to minimize.
[2024-05-24 18:26:57] [INFO ] Deduced a trap composed of 137 places in 515 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/962 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/976 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/976 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3604/4580 variables, 976/1092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4580 variables, 2450/3542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4580 variables, 1/3543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4580 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/4580 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4580/4580 variables, and 3543 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45427 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 976/976 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 68/68 constraints]
After SMT, in 46917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 112 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 110 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2024-05-24 18:27:00] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2024-05-24 18:27:00] [INFO ] Invariant cache hit.
[2024-05-24 18:27:01] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2024-05-24 18:27:01] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2024-05-24 18:27:01] [INFO ] Invariant cache hit.
[2024-05-24 18:27:02] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2024-05-24 18:27:32] [INFO ] Performed 813/976 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 18:27:41] [INFO ] Implicit Places using invariants and state equation in 40426 ms returned []
Implicit Place search using SMT with State Equation took 41643 ms to find 0 implicit places.
[2024-05-24 18:27:41] [INFO ] Redundant transitions in 253 ms returned []
Running 3940 sub problems to find dead transitions.
[2024-05-24 18:27:42] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2024-05-24 18:27:42] [INFO ] Invariant cache hit.
[2024-05-24 18:27:42] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3940 unsolved
SMT process timed out in 55770ms, After SMT, problems are : Problem set: 0 solved, 3940 unsolved
Search for dead transitions found 0 dead transitions in 55813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97849 ms. Remains : 976/976 places, 4002/4002 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1052 edges and 976 vertex of which 17 / 976 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4567 edges and 960 vertex of which 946 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 929 transition count 3233
Reduce places removed 97 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 832 transition count 3040
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 736 transition count 2872
Reduce places removed 72 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 664 transition count 2730
Reduce places removed 70 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 594 transition count 2610
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 544 transition count 2512
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 496 transition count 2432
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 464 transition count 2370
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 434 transition count 2322
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 416 transition count 2288
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 400 transition count 2264
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 392 transition count 2250
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 386 transition count 2242
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 383 transition count 2240
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 383 transition count 2225
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 368 transition count 2225
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1954 place count 84 transition count 333
Iterating global reduction 14 with 284 rules applied. Total rules applied 2238 place count 84 transition count 333
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 253 rules applied. Total rules applied 2491 place count 84 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2498 place count 77 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2498 place count 77 transition count 79
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2500 place count 76 transition count 79
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2512 place count 64 transition count 62
Iterating global reduction 16 with 12 rules applied. Total rules applied 2524 place count 64 transition count 62
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2529 place count 59 transition count 57
Iterating global reduction 16 with 5 rules applied. Total rules applied 2534 place count 59 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2538 place count 57 transition count 55
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2539 place count 56 transition count 53
Iterating global reduction 16 with 1 rules applied. Total rules applied 2540 place count 56 transition count 53
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 16 with 14 rules applied. Total rules applied 2554 place count 56 transition count 39
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 16 with 14 rules applied. Total rules applied 2568 place count 42 transition count 39
Applied a total of 2568 rules in 383 ms. Remains 42 /976 variables (removed 934) and now considering 39/4002 (removed 3963) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 42 cols
[2024-05-24 18:28:38] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 18:28:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 18:28:38] [INFO ] [Real]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-24 18:28:38] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:28:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 18:28:38] [INFO ] [Nat]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-24 18:28:38] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 18:28:38] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:28:38] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 491 ms.
[2024-05-24 18:28:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-24 18:28:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 976 places, 4002 transitions and 19954 arcs took 22 ms.
[2024-05-24 18:28:38] [INFO ] Flatten gal took : 356 ms
Total runtime 250526 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C07

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.002s]


----------------------------------------------------------------------
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: 929
MODEL NAME: /home/mcc/execution/408/model
976 places, 4002 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MultiCrashLeafsetExtension-PT-S16C07"
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 MultiCrashLeafsetExtension-PT-S16C07, 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 r245-tall-171654349100046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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