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.r246-tall-171654350800062.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 itstools
Input is MultiCrashLeafsetExtension-PT-S24C02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350800062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 05:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 05:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K 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 7.6M 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-S24C02-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716580232226

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 19:50:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:50:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:50:33] [INFO ] Load time of PNML (sax parser for PT used): 494 ms
[2024-05-24 19:50:33] [INFO ] Transformed 7032 places.
[2024-05-24 19:50:33] [INFO ] Transformed 10855 transitions.
[2024-05-24 19:50:34] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 639 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1882 resets) in 4664 ms. (8 steps per ms) remains 15/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (32 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 107 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 114 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 178 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
[2024-05-24 19:50:36] [INFO ] Flatten gal took : 1317 ms
[2024-05-24 19:50:36] [INFO ] Flatten gal took : 412 ms
[2024-05-24 19:50:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7193701153116011195.gal : 116 ms
[2024-05-24 19:50:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8545631778841338944.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7193701153116011195.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8545631778841338944.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8545631778841338944.prop.
Interrupted probabilistic random walk after 17581 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :0 out of 15
Probabilistic random walk after 17581 steps, saw 8311 distinct states, run finished after 3005 ms. (steps per millisecond=5 ) properties seen :0
[2024-05-24 19:50:39] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2024-05-24 19:50:39] [INFO ] Computed 813 invariants in 607 ms
[2024-05-24 19:50:39] [INFO ] State equation strengthened by 3202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2269/2544 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2544 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 42/2586 variables, 42/52 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2586 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 3452/6038 variables, 415/467 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6038 variables, 0/467 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/6044 variables, 6/473 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6044 variables, 0/473 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 967/7011 variables, 319/792 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7011 variables, 0/792 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 21/7032 variables, 21/813 constraints. Problems are: Problem set: 9 solved, 6 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 7032/17287 variables, and 813 constraints, problems are : Problem set: 9 solved, 6 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 755/755 constraints, State Equation: 0/7032 constraints, ReadFeed: 0/3202 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2298/2391 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2391 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3192/5583 variables, 341/342 constraints. Problems are: Problem set: 9 solved, 6 unsolved
[2024-05-24 19:50:52] [INFO ] Deduced a trap composed of 158 places in 6122 ms of which 256 ms to minimize.
SMT process timed out in 13530ms, After SMT, problems are : Problem set: 9 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 7032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.29 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1174 transitions
Trivial Post-agglo rules discarded 1174 transitions
Performed 1174 trivial Post agglomeration. Transition count delta: 1174
Iterating post reduction 0 with 1174 rules applied. Total rules applied 1175 place count 7000 transition count 9681
Reduce places removed 1174 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 1185 rules applied. Total rules applied 2360 place count 5826 transition count 9670
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2371 place count 5815 transition count 9670
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 2371 place count 5815 transition count 9570
Deduced a syphon composed of 100 places in 19 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 2571 place count 5715 transition count 9570
Discarding 1074 places :
Symmetric choice reduction at 3 with 1074 rule applications. Total rules 3645 place count 4641 transition count 8496
Iterating global reduction 3 with 1074 rules applied. Total rules applied 4719 place count 4641 transition count 8496
Discarding 520 places :
Symmetric choice reduction at 3 with 520 rule applications. Total rules 5239 place count 4121 transition count 7456
Iterating global reduction 3 with 520 rules applied. Total rules applied 5759 place count 4121 transition count 7456
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 7 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 5807 place count 4097 transition count 7432
Free-agglomeration rule (complex) applied 322 times.
Iterating global reduction 3 with 322 rules applied. Total rules applied 6129 place count 4097 transition count 7305
Reduce places removed 322 places and 0 transitions.
Iterating post reduction 3 with 322 rules applied. Total rules applied 6451 place count 3775 transition count 7305
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 6551 place count 3775 transition count 7305
Applied a total of 6551 rules in 4335 ms. Remains 3775 /7032 variables (removed 3257) and now considering 7305/10855 (removed 3550) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4354 ms. Remains : 3775/7032 places, 7305/10855 transitions.
RANDOM walk for 40000 steps (2778 resets) in 1317 ms. (30 steps per ms) remains 5/6 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (360 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (360 resets) in 330 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (360 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
[2024-05-24 19:50:57] [INFO ] Flow matrix only has 6427 transitions (discarded 878 similar events)
// Phase 1: matrix 6427 rows 3775 cols
[2024-05-24 19:50:57] [INFO ] Computed 781 invariants in 145 ms
[2024-05-24 19:50:57] [INFO ] State equation strengthened by 2877 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2580/2672 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2672 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2672 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 871/3543 variables, 540/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:51:02] [INFO ] Deduced a trap composed of 7 places in 3190 ms of which 25 ms to minimize.
[2024-05-24 19:51:05] [INFO ] Deduced a trap composed of 239 places in 3242 ms of which 28 ms to minimize.
[2024-05-24 19:51:08] [INFO ] Deduced a trap composed of 256 places in 3200 ms of which 23 ms to minimize.
[2024-05-24 19:51:12] [INFO ] Deduced a trap composed of 166 places in 3354 ms of which 23 ms to minimize.
[2024-05-24 19:51:15] [INFO ] Deduced a trap composed of 227 places in 3139 ms of which 22 ms to minimize.
[2024-05-24 19:51:18] [INFO ] Deduced a trap composed of 41 places in 3070 ms of which 22 ms to minimize.
[2024-05-24 19:51:21] [INFO ] Deduced a trap composed of 277 places in 3227 ms of which 24 ms to minimize.
[2024-05-24 19:51:24] [INFO ] Deduced a trap composed of 222 places in 3197 ms of which 23 ms to minimize.
[2024-05-24 19:51:28] [INFO ] Deduced a trap composed of 196 places in 3284 ms of which 23 ms to minimize.
[2024-05-24 19:51:31] [INFO ] Deduced a trap composed of 74 places in 3226 ms of which 26 ms to minimize.
[2024-05-24 19:51:34] [INFO ] Deduced a trap composed of 102 places in 3258 ms of which 32 ms to minimize.
[2024-05-24 19:51:38] [INFO ] Deduced a trap composed of 127 places in 3110 ms of which 22 ms to minimize.
[2024-05-24 19:51:41] [INFO ] Deduced a trap composed of 251 places in 3328 ms of which 23 ms to minimize.
[2024-05-24 19:51:44] [INFO ] Deduced a trap composed of 225 places in 3090 ms of which 23 ms to minimize.
SMT process timed out in 46934ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 3775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3775/3775 places, 7305/7305 transitions.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3775 transition count 7305
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 4
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3774 transition count 7304
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3774 transition count 7304
Applied a total of 3 rules in 1348 ms. Remains 3774 /3775 variables (removed 1) and now considering 7304/7305 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 3774/3775 places, 7304/7305 transitions.
RANDOM walk for 40000 steps (2771 resets) in 1259 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :4 after 6
BEST_FIRST walk for 40004 steps (360 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (360 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (360 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (360 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 26538 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 5
Probabilistic random walk after 26538 steps, saw 12099 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 19:51:49] [INFO ] Flow matrix only has 6426 transitions (discarded 878 similar events)
// Phase 1: matrix 6426 rows 3774 cols
[2024-05-24 19:51:49] [INFO ] Computed 781 invariants in 200 ms
[2024-05-24 19:51:49] [INFO ] State equation strengthened by 2877 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :6 after 12
At refinement iteration 1 (OVERLAPS) 2583/2675 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2675 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2675 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 868/3543 variables, 541/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:51:54] [INFO ] Deduced a trap composed of 7 places in 3232 ms of which 23 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :12 after 15
[2024-05-24 19:51:57] [INFO ] Deduced a trap composed of 41 places in 3297 ms of which 23 ms to minimize.
[2024-05-24 19:52:00] [INFO ] Deduced a trap composed of 192 places in 3366 ms of which 25 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :15 after 31
[2024-05-24 19:52:04] [INFO ] Deduced a trap composed of 41 places in 3665 ms of which 25 ms to minimize.
[2024-05-24 19:52:07] [INFO ] Deduced a trap composed of 225 places in 3339 ms of which 25 ms to minimize.
[2024-05-24 19:52:11] [INFO ] Deduced a trap composed of 91 places in 3362 ms of which 23 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :31 after 49
[2024-05-24 19:52:14] [INFO ] Deduced a trap composed of 74 places in 3326 ms of which 25 ms to minimize.
[2024-05-24 19:52:18] [INFO ] Deduced a trap composed of 102 places in 3191 ms of which 22 ms to minimize.
[2024-05-24 19:52:21] [INFO ] Deduced a trap composed of 309 places in 3244 ms of which 23 ms to minimize.
[2024-05-24 19:52:24] [INFO ] Deduced a trap composed of 195 places in 3167 ms of which 23 ms to minimize.
[2024-05-24 19:52:27] [INFO ] Deduced a trap composed of 218 places in 3220 ms of which 23 ms to minimize.
[2024-05-24 19:52:31] [INFO ] Deduced a trap composed of 247 places in 3134 ms of which 24 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :49 after 98
[2024-05-24 19:52:34] [INFO ] Deduced a trap composed of 127 places in 3229 ms of which 22 ms to minimize.
[2024-05-24 19:52:37] [INFO ] Deduced a trap composed of 203 places in 3293 ms of which 22 ms to minimize.
[2024-05-24 19:52:40] [INFO ] Deduced a trap composed of 162 places in 3181 ms of which 22 ms to minimize.
[2024-05-24 19:52:44] [INFO ] Deduced a trap composed of 199 places in 3278 ms of which 23 ms to minimize.
[2024-05-24 19:52:47] [INFO ] Deduced a trap composed of 74 places in 3140 ms of which 23 ms to minimize.
[2024-05-24 19:52:50] [INFO ] Deduced a trap composed of 102 places in 3060 ms of which 23 ms to minimize.
[2024-05-24 19:52:53] [INFO ] Deduced a trap composed of 261 places in 3207 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3543 variables, 19/569 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:52:57] [INFO ] Deduced a trap composed of 217 places in 3198 ms of which 32 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :98 after 174
[2024-05-24 19:53:00] [INFO ] Deduced a trap composed of 253 places in 3175 ms of which 23 ms to minimize.
[2024-05-24 19:53:03] [INFO ] Deduced a trap composed of 127 places in 3107 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/3543 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3543 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 44/3587 variables, 44/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3587 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 187/3774 variables, 187/803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3774/10200 variables, and 803 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 732/732 constraints, State Equation: 0/3774 constraints, ReadFeed: 0/2877 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2583/2675 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2675 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 19:53:07] [INFO ] Deduced a trap composed of 559 places in 1549 ms of which 11 ms to minimize.
[2024-05-24 19:53:08] [INFO ] Deduced a trap composed of 503 places in 1147 ms of which 10 ms to minimize.
[2024-05-24 19:53:09] [INFO ] Deduced a trap composed of 490 places in 1151 ms of which 10 ms to minimize.
[2024-05-24 19:53:10] [INFO ] Deduced a trap composed of 497 places in 884 ms of which 10 ms to minimize.
[2024-05-24 19:53:11] [INFO ] Deduced a trap composed of 411 places in 870 ms of which 10 ms to minimize.
[2024-05-24 19:53:12] [INFO ] Deduced a trap composed of 462 places in 872 ms of which 10 ms to minimize.
[2024-05-24 19:53:13] [INFO ] Deduced a trap composed of 553 places in 859 ms of which 11 ms to minimize.
[2024-05-24 19:53:14] [INFO ] Deduced a trap composed of 459 places in 837 ms of which 10 ms to minimize.
[2024-05-24 19:53:14] [INFO ] Deduced a trap composed of 568 places in 874 ms of which 10 ms to minimize.
[2024-05-24 19:53:15] [INFO ] Deduced a trap composed of 576 places in 891 ms of which 10 ms to minimize.
[2024-05-24 19:53:16] [INFO ] Deduced a trap composed of 573 places in 859 ms of which 10 ms to minimize.
[2024-05-24 19:53:17] [INFO ] Deduced a trap composed of 599 places in 812 ms of which 11 ms to minimize.
[2024-05-24 19:53:18] [INFO ] Deduced a trap composed of 616 places in 858 ms of which 10 ms to minimize.
[2024-05-24 19:53:19] [INFO ] Deduced a trap composed of 562 places in 937 ms of which 12 ms to minimize.
[2024-05-24 19:53:20] [INFO ] Deduced a trap composed of 557 places in 933 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2675 variables, 15/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 19:53:21] [INFO ] Deduced a trap composed of 610 places in 925 ms of which 11 ms to minimize.
[2024-05-24 19:53:22] [INFO ] Deduced a trap composed of 405 places in 940 ms of which 11 ms to minimize.
[2024-05-24 19:53:23] [INFO ] Deduced a trap composed of 399 places in 942 ms of which 11 ms to minimize.
[2024-05-24 19:53:24] [INFO ] Deduced a trap composed of 477 places in 938 ms of which 20 ms to minimize.
[2024-05-24 19:53:25] [INFO ] Deduced a trap composed of 591 places in 925 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2675 variables, 5/29 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 19:53:26] [INFO ] Deduced a trap composed of 692 places in 921 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2675 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2675 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 868/3543 variables, 541/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3543 variables, 22/593 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 19:53:30] [INFO ] Deduced a trap composed of 158 places in 3226 ms of which 24 ms to minimize.
[2024-05-24 19:53:34] [INFO ] Deduced a trap composed of 74 places in 3174 ms of which 21 ms to minimize.
[2024-05-24 19:53:37] [INFO ] Deduced a trap composed of 212 places in 3096 ms of which 23 ms to minimize.
[2024-05-24 19:53:40] [INFO ] Deduced a trap composed of 255 places in 3123 ms of which 23 ms to minimize.
[2024-05-24 19:53:43] [INFO ] Deduced a trap composed of 251 places in 3174 ms of which 23 ms to minimize.
[2024-05-24 19:53:46] [INFO ] Deduced a trap composed of 239 places in 3183 ms of which 27 ms to minimize.
[2024-05-24 19:53:50] [INFO ] Deduced a trap composed of 215 places in 3122 ms of which 23 ms to minimize.
[2024-05-24 19:53:53] [INFO ] Deduced a trap composed of 232 places in 3018 ms of which 22 ms to minimize.
[2024-05-24 19:53:56] [INFO ] Deduced a trap composed of 215 places in 3059 ms of which 20 ms to minimize.
[2024-05-24 19:53:59] [INFO ] Deduced a trap composed of 272 places in 3100 ms of which 23 ms to minimize.
[2024-05-24 19:54:02] [INFO ] Deduced a trap composed of 238 places in 3150 ms of which 23 ms to minimize.
[2024-05-24 19:54:05] [INFO ] Deduced a trap composed of 224 places in 3143 ms of which 23 ms to minimize.
[2024-05-24 19:54:09] [INFO ] Deduced a trap composed of 203 places in 3227 ms of which 23 ms to minimize.
[2024-05-24 19:54:12] [INFO ] Deduced a trap composed of 239 places in 3112 ms of which 22 ms to minimize.
[2024-05-24 19:54:15] [INFO ] Deduced a trap composed of 258 places in 3152 ms of which 22 ms to minimize.
[2024-05-24 19:54:18] [INFO ] Deduced a trap composed of 232 places in 3144 ms of which 21 ms to minimize.
[2024-05-24 19:54:22] [INFO ] Deduced a trap composed of 102 places in 3251 ms of which 22 ms to minimize.
SMT process timed out in 152322ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 3774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3774/3774 places, 7304/7304 transitions.
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 0 with 15 rules applied. Total rules applied 15 place count 3774 transition count 7289
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 3759 transition count 7289
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 38 place count 3751 transition count 7278
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 3751 transition count 7278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 3750 transition count 7277
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 2 with 44 rules applied. Total rules applied 92 place count 3750 transition count 7550
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 136 place count 3706 transition count 7550
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 156 place count 3686 transition count 7530
Iterating global reduction 3 with 20 rules applied. Total rules applied 176 place count 3686 transition count 7530
Applied a total of 176 rules in 2225 ms. Remains 3686 /3774 variables (removed 88) and now considering 7530/7304 (removed -226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2225 ms. Remains : 3686/3774 places, 7530/7304 transitions.
RANDOM walk for 40000 steps (3046 resets) in 978 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (364 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (364 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 28783 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 28783 steps, saw 12951 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 19:54:27] [INFO ] Flow matrix only has 6644 transitions (discarded 886 similar events)
// Phase 1: matrix 6644 rows 3686 cols
[2024-05-24 19:54:27] [INFO ] Computed 781 invariants in 170 ms
[2024-05-24 19:54:27] [INFO ] State equation strengthened by 3191 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2636/2640 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2640 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/2675 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:54:29] [INFO ] Deduced a trap composed of 363 places in 1109 ms of which 12 ms to minimize.
[2024-05-24 19:54:30] [INFO ] Deduced a trap composed of 388 places in 1098 ms of which 12 ms to minimize.
[2024-05-24 19:54:31] [INFO ] Deduced a trap composed of 467 places in 1086 ms of which 11 ms to minimize.
[2024-05-24 19:54:33] [INFO ] Deduced a trap composed of 502 places in 1067 ms of which 11 ms to minimize.
[2024-05-24 19:54:34] [INFO ] Deduced a trap composed of 458 places in 1104 ms of which 14 ms to minimize.
[2024-05-24 19:54:35] [INFO ] Deduced a trap composed of 382 places in 1093 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2675 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2675 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 850/3525 variables, 615/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:54:39] [INFO ] Deduced a trap composed of 5 places in 3312 ms of which 23 ms to minimize.
[2024-05-24 19:54:42] [INFO ] Deduced a trap composed of 152 places in 3244 ms of which 23 ms to minimize.
[2024-05-24 19:54:45] [INFO ] Deduced a trap composed of 239 places in 3261 ms of which 22 ms to minimize.
[2024-05-24 19:54:49] [INFO ] Deduced a trap composed of 171 places in 3243 ms of which 23 ms to minimize.
[2024-05-24 19:54:52] [INFO ] Deduced a trap composed of 39 places in 3241 ms of which 22 ms to minimize.
[2024-05-24 19:54:55] [INFO ] Deduced a trap composed of 70 places in 3356 ms of which 21 ms to minimize.
[2024-05-24 19:54:59] [INFO ] Deduced a trap composed of 203 places in 3362 ms of which 23 ms to minimize.
[2024-05-24 19:55:02] [INFO ] Deduced a trap composed of 98 places in 3278 ms of which 23 ms to minimize.
[2024-05-24 19:55:05] [INFO ] Deduced a trap composed of 123 places in 3279 ms of which 23 ms to minimize.
[2024-05-24 19:55:09] [INFO ] Deduced a trap composed of 123 places in 3238 ms of which 22 ms to minimize.
[2024-05-24 19:55:12] [INFO ] Deduced a trap composed of 144 places in 3336 ms of which 23 ms to minimize.
[2024-05-24 19:55:15] [INFO ] Deduced a trap composed of 98 places in 3331 ms of which 23 ms to minimize.
[2024-05-24 19:55:19] [INFO ] Deduced a trap composed of 158 places in 3340 ms of which 24 ms to minimize.
[2024-05-24 19:55:22] [INFO ] Deduced a trap composed of 124 places in 3441 ms of which 23 ms to minimize.
[2024-05-24 19:55:26] [INFO ] Deduced a trap composed of 145 places in 3395 ms of which 24 ms to minimize.
[2024-05-24 19:55:29] [INFO ] Deduced a trap composed of 145 places in 3277 ms of which 21 ms to minimize.
[2024-05-24 19:55:33] [INFO ] Deduced a trap composed of 194 places in 3290 ms of which 22 ms to minimize.
[2024-05-24 19:55:36] [INFO ] Deduced a trap composed of 214 places in 3305 ms of which 22 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :174 after 301
[2024-05-24 19:55:39] [INFO ] Deduced a trap composed of 204 places in 3308 ms of which 22 ms to minimize.
[2024-05-24 19:55:43] [INFO ] Deduced a trap composed of 290 places in 3208 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3525 variables, 20/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:55:46] [INFO ] Deduced a trap composed of 164 places in 3246 ms of which 22 ms to minimize.
[2024-05-24 19:55:49] [INFO ] Deduced a trap composed of 207 places in 3213 ms of which 22 ms to minimize.
[2024-05-24 19:55:53] [INFO ] Deduced a trap composed of 150 places in 3504 ms of which 22 ms to minimize.
[2024-05-24 19:55:56] [INFO ] Deduced a trap composed of 195 places in 3543 ms of which 23 ms to minimize.
[2024-05-24 19:56:00] [INFO ] Deduced a trap composed of 175 places in 3461 ms of which 23 ms to minimize.
SMT process timed out in 92647ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3686/3686 places, 7530/7530 transitions.
Applied a total of 0 rules in 560 ms. Remains 3686 /3686 variables (removed 0) and now considering 7530/7530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 3686/3686 places, 7530/7530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3686/3686 places, 7530/7530 transitions.
Applied a total of 0 rules in 538 ms. Remains 3686 /3686 variables (removed 0) and now considering 7530/7530 (removed 0) transitions.
[2024-05-24 19:56:01] [INFO ] Flow matrix only has 6644 transitions (discarded 886 similar events)
[2024-05-24 19:56:01] [INFO ] Invariant cache hit.
[2024-05-24 19:56:09] [INFO ] Implicit Places using invariants in 8063 ms returned [4, 7, 9, 10, 11, 15, 21, 29, 39, 51, 65, 81, 99, 119, 141, 164, 186, 187, 188, 208, 226, 242, 256, 268, 278, 286, 292, 296, 298, 305, 311, 313, 314, 315, 317, 321, 327, 335, 345, 357, 371, 387, 405, 425, 446, 466, 467, 468, 486, 502, 516, 528, 538, 546, 552, 556, 558, 560, 567, 573, 575, 576, 577, 579, 581, 585, 591, 599, 609, 621, 635, 651, 669, 688, 706, 707, 708, 724, 738, 750, 760, 768, 774, 778, 780, 782, 784, 791, 797, 799, 800, 801, 803, 805, 807, 811, 817, 825, 835, 847, 861, 877, 894, 910, 911, 912, 926, 938, 948, 956, 962, 966, 968, 970, 972, 974, 981, 987, 989, 990, 991, 993, 995, 997, 999, 1003, 1009, 1017, 1027, 1039, 1053, 1068, 1082, 1083, 1084, 1096, 1106, 1114, 1120, 1124, 1126, 1128, 1130, 1132, 1134, 1141, 1147, 1149, 1150, 1151, 1153, 1155, 1157, 1159, 1161, 1165, 1171, 1179, 1189, 1201, 1214, 1226, 1227, 1228, 1238, 1246, 1252, 1256, 1258, 1260, 1262, 1264, 1266, 1268, 1275, 1281, 1283, 1284, 1285, 1287, 1289, 1291, 1293, 1295, 1297, 1301, 1307, 1315, 1325, 1336, 1346, 1347, 1348, 1356, 1362, 1366, 1368, 1370, 1372, 1374, 1376, 1378, 1380, 1387, 1393, 1396, 1397, 1398, 1400, 1402, 1404, 1406, 1408, 1410, 1412, 1416, 1422, 1430, 1439, 1447, 1448, 1449, 1455, 1459, 1461, 1463, 1465, 1467, 1469, 1471, 1473, 1475, 1482, 1488, 1490, 1491, 1492, 1494, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1512, 1518, 1525, 1531, 1532, 1533, 1537, 1539, 1541, 1543, 1545, 1547, 1549, 1551, 1553, 1555, 1562, 1568, 1570, 1571, 1572, 1574, 1576, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1594, 1599, 1603, 1604, 1605, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1632, 1638, 1640, 1641, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1665, 1667, 1668, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1696, 1702, 1704, 1705, 1706, 1708, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1731, 1732, 1734, 1736, 1738, 1740, 1742, 1744, 1746, 1748, 1750, 1752, 1759, 1761, 1764, 1766, 1767, 1768, 1770, 1772, 1774, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1793, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1821, 1827, 1829, 1830, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1856, 1857, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1884, 1890, 1892, 1893, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1919, 1920, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1937, 1939, 1941, 1948, 1954, 1956, 1957, 1958, 1960, 1962, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1982, 1987, 1988, 1989, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2018, 2024, 2026, 2027, 2028, 2030, 2032, 2034, 2036, 2038, 2040, 2042, 2044, 2046, 2050, 2056, 2063, 2064, 2065, 2071, 2075, 2077, 2079, 2081, 2083, 2085, 2087, 2089, 2091, 2098, 2104, 2106, 2107, 2108, 2110, 2112, 2114, 2116, 2118, 2120, 2122, 2124, 2128, 2134, 2142, 2151, 2152, 2153, 2161, 2167, 2171, 2173, 2175, 2177, 2179, 2181, 2183, 2185, 2192, 2198, 2200, 2201, 2202, 2204, 2206, 2208, 2210, 2212, 2214, 2216, 2220, 2226, 2234, 2244, 2255, 2256, 2257, 2267, 2275, 2281, 2285, 2287, 2289, 2291, 2293, 2295, 2297, 2304, 2310, 2312, 2313, 2314, 2316, 2318, 2320, 2322, 2324, 2326, 2330, 2336, 2344, 2354, 2366, 2379, 2380, 2381, 2393, 2403, 2411, 2417, 2421, 2423, 2425, 2427, 2429, 2431, 2438, 2444, 2446, 2447, 2448, 2450, 2452, 2454, 2456, 2458, 2462, 2468, 2476, 2486, 2498, 2512, 2527, 2528, 2529, 2543, 2555, 2565, 2573, 2579, 2583, 2585, 2587, 2589, 2591, 2598, 2604, 2606, 2607, 2608, 2610, 2612, 2614, 2616, 2620, 2626, 2634, 2644, 2656, 2670, 2686, 2703, 2704, 2705, 2721, 2735, 2747, 2757, 2765, 2771, 2775, 2777, 2779, 2781, 2788, 2794, 2796, 2797, 2798, 2800, 2802, 2804, 2808, 2814, 2822, 2832, 2844, 2858, 2874, 2892, 2911, 2912, 2913, 2931, 2947, 2961, 2973, 2983, 2991, 2997, 3001, 3003, 3005, 3012, 3018, 3020, 3021, 3022, 3024, 3026, 3030, 3036, 3044, 3054, 3066, 3080, 3096, 3114, 3134, 3155, 3156, 3157, 3177, 3195, 3211, 3225, 3237, 3247, 3255, 3261, 3265, 3267, 3274, 3276, 3279, 3281, 3282, 3283, 3285, 3289, 3295, 3303, 3313, 3325, 3339, 3355, 3373, 3393, 3415, 3438, 3439, 3440, 3462, 3482, 3500, 3516, 3530, 3542, 3552, 3560, 3566, 3570, 3577]
[2024-05-24 19:56:09] [INFO ] Actually due to overlaps returned [1482, 1884, 1948, 2018, 2098, 2192, 2304, 2438, 2598, 2788, 3012, 3274, 3577, 305, 567, 791, 981, 1141, 1275, 1387, 1562, 1632, 1696, 1759, 1821, 4, 9, 10, 186, 187, 313, 314, 466, 467, 575, 576, 706, 707, 799, 800, 910, 911, 989, 990, 1082, 1083, 1149, 1150, 1226, 1227, 1283, 1284, 1346, 1347, 1396, 1397, 1447, 1448, 1490, 1491, 1531, 1532, 1570, 1571, 1603, 1604, 1640, 1641, 1667, 1668, 1704, 1705, 1730, 1731, 1761, 1766, 1767, 1792, 1793, 1829, 1830, 1855, 1856, 1892, 1893, 1919, 1920, 1956, 1957, 1987, 1988, 2026, 2027, 2063, 2064, 2106, 2107, 2151, 2152, 2200, 2201, 2255, 2256, 2312, 2313, 2379, 2380, 2446, 2447, 2527, 2528, 2606, 2607, 2703, 2704, 2796, 2797, 2911, 2912, 3020, 3021, 3155, 3156, 3276, 3281, 3282, 3438, 3439]
Discarding 128 places :
Implicit Place search using SMT only with invariants took 8091 ms to find 128 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3558/3686 places, 7530/7530 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 3462 transition count 7434
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 3462 transition count 7434
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 288 place count 3366 transition count 7338
Iterating global reduction 0 with 96 rules applied. Total rules applied 384 place count 3366 transition count 7338
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 387 place count 3366 transition count 7335
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 390 place count 3363 transition count 7335
Applied a total of 390 rules in 1886 ms. Remains 3363 /3558 variables (removed 195) and now considering 7335/7530 (removed 195) transitions.
[2024-05-24 19:56:11] [INFO ] Flow matrix only has 6449 transitions (discarded 886 similar events)
// Phase 1: matrix 6449 rows 3363 cols
[2024-05-24 19:56:11] [INFO ] Computed 653 invariants in 130 ms
[2024-05-24 19:56:18] [INFO ] Implicit Places using invariants in 6756 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 281, 287, 291, 293, 304, 306, 308, 312, 318, 326, 336, 348, 362, 378, 396, 416, 437, 457, 475, 491, 505, 517, 527, 535, 541, 545, 547, 549, 557, 559, 561, 563, 567, 573, 581, 591, 603, 617, 633, 651, 670, 688, 704, 718, 730, 740, 748, 754, 758, 760, 762, 764, 772, 774, 776, 778, 780, 784, 790, 798, 808, 820, 834, 850, 867, 883, 897, 909, 919, 927, 933, 937, 939, 941, 943, 945, 953, 955, 957, 959, 961, 963, 967, 973, 981, 991, 1003, 1017, 1032, 1046, 1058, 1068, 1076, 1082, 1086, 1088, 1090, 1092, 1094, 1096, 1104, 1106, 1108, 1110, 1112, 1114, 1116, 1120, 1126, 1134, 1144, 1156, 1169, 1181, 1191, 1199, 1205, 1209, 1211, 1213, 1215, 1217, 1219, 1221, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1247, 1253, 1261, 1271, 1282, 1292, 1300, 1306, 1310, 1312, 1314, 1316, 1318, 1320, 1322, 1324, 1332, 1335, 1337, 1339, 1341, 1343, 1345, 1347, 1349, 1353, 1359, 1367, 1376, 1384, 1390, 1394, 1396, 1398, 1400, 1402, 1404, 1406, 1408, 1410, 1418, 1420, 1422, 1424, 1426, 1428, 1430, 1432, 1434, 1436, 1440, 1446, 1453, 1459, 1463, 1465, 1467, 1469, 1471, 1473, 1475, 1477, 1479, 1481, 1489, 1491, 1493, 1495, 1497, 1499, 1501, 1503, 1505, 1507, 1509, 1513, 1518, 1522, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1538, 1540, 1542, 1550, 1552, 1554, 1556, 1558, 1560, 1562, 1564, 1566, 1568, 1570, 1572, 1575, 1577, 1579, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1597, 1605, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1641, 1643, 1645, 1647, 1649, 1651, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1740, 1742, 1744, 1746, 1748, 1750, 1752, 1754, 1756, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1791, 1793, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1819, 1821, 1823, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1845, 1850, 1854, 1856, 1858, 1860, 1862, 1864, 1866, 1868, 1870, 1872, 1880, 1882, 1884, 1886, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1904, 1910, 1917, 1923, 1927, 1929, 1931, 1933, 1935, 1937, 1939, 1941, 1943, 1951, 1953, 1955, 1957, 1959, 1961, 1963, 1965, 1967, 1969, 1973, 1979, 1987, 1996, 2004, 2010, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2036, 2038, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2056, 2062, 2070, 2080, 2091, 2101, 2109, 2115, 2119, 2121, 2123, 2125, 2127, 2129, 2131, 2139, 2141, 2143, 2145, 2147, 2149, 2151, 2153, 2157, 2163, 2171, 2181, 2193, 2206, 2218, 2228, 2236, 2242, 2246, 2248, 2250, 2252, 2254, 2256, 2264, 2266, 2268, 2270, 2272, 2274, 2276, 2280, 2286, 2294, 2304, 2316, 2330, 2345, 2359, 2371, 2381, 2389, 2395, 2399, 2401, 2403, 2405, 2407, 2415, 2417, 2419, 2421, 2423, 2425, 2429, 2435, 2443, 2453, 2465, 2479, 2495, 2512, 2528, 2542, 2554, 2564, 2572, 2578, 2582, 2584, 2586, 2588, 2596, 2598, 2600, 2602, 2604, 2608, 2614, 2622, 2632, 2644, 2658, 2674, 2692, 2711, 2729, 2745, 2759, 2771, 2781, 2789, 2795, 2799, 2801, 2803, 2811, 2813, 2815, 2817, 2821, 2827, 2835, 2845, 2857, 2871, 2887, 2905, 2925, 2946, 2966, 2984, 3000, 3014, 3026, 3036, 3044, 3050, 3054, 3056, 3062, 3064, 3066, 3070, 3076, 3084, 3094, 3106, 3120, 3136, 3154, 3174, 3196, 3219, 3241, 3261, 3279, 3295, 3309, 3321, 3331, 3339, 3345, 3349]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 6802 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2763/3686 places, 7335/7530 transitions.
Applied a total of 0 rules in 424 ms. Remains 2763 /2763 variables (removed 0) and now considering 7335/7335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 17745 ms. Remains : 2763/3686 places, 7335/7530 transitions.
RANDOM walk for 40000 steps (3310 resets) in 971 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (205 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (210 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 31050 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 31050 steps, saw 12819 distinct states, run finished after 3003 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 19:56:22] [INFO ] Flow matrix only has 6449 transitions (discarded 886 similar events)
// Phase 1: matrix 6449 rows 2763 cols
[2024-05-24 19:56:22] [INFO ] Computed 53 invariants in 164 ms
[2024-05-24 19:56:22] [INFO ] State equation strengthened by 3191 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2655/2659 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2659 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2685 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:56:24] [INFO ] Deduced a trap composed of 255 places in 1794 ms of which 19 ms to minimize.
[2024-05-24 19:56:26] [INFO ] Deduced a trap composed of 339 places in 1890 ms of which 18 ms to minimize.
[2024-05-24 19:56:28] [INFO ] Deduced a trap composed of 386 places in 1879 ms of which 17 ms to minimize.
[2024-05-24 19:56:30] [INFO ] Deduced a trap composed of 322 places in 1872 ms of which 17 ms to minimize.
[2024-05-24 19:56:32] [INFO ] Deduced a trap composed of 352 places in 1879 ms of which 17 ms to minimize.
[2024-05-24 19:56:34] [INFO ] Deduced a trap composed of 334 places in 1873 ms of which 17 ms to minimize.
[2024-05-24 19:56:36] [INFO ] Deduced a trap composed of 370 places in 1869 ms of which 17 ms to minimize.
[2024-05-24 19:56:38] [INFO ] Deduced a trap composed of 82 places in 1876 ms of which 18 ms to minimize.
[2024-05-24 19:56:39] [INFO ] Deduced a trap composed of 98 places in 1871 ms of which 17 ms to minimize.
[2024-05-24 19:56:41] [INFO ] Deduced a trap composed of 81 places in 1860 ms of which 17 ms to minimize.
[2024-05-24 19:56:43] [INFO ] Deduced a trap composed of 81 places in 1868 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2685 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2685 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/2715 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2715 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 44/2759 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2759 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/2763 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2763 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6449/9212 variables, 2763/2827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (INCLUDED_ONLY) 0/9212 variables, 3191/6018 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/9212 variables, 0/6018 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/9212 variables, 0/6018 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9212/9212 variables, and 6018 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25229 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 2763/2763 constraints, ReadFeed: 3191/3191 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2656/2659 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2659 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/2685 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2685 variables, 11/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 19:56:49] [INFO ] Deduced a trap composed of 98 places in 1884 ms of which 18 ms to minimize.
[2024-05-24 19:56:51] [INFO ] Deduced a trap composed of 411 places in 1883 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2685 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2685 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/2715 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 19:56:54] [INFO ] Deduced a trap composed of 5 places in 2079 ms of which 18 ms to minimize.
[2024-05-24 19:56:56] [INFO ] Deduced a trap composed of 39 places in 2015 ms of which 17 ms to minimize.
[2024-05-24 19:56:58] [INFO ] Deduced a trap composed of 88 places in 2053 ms of which 18 ms to minimize.
[2024-05-24 19:57:00] [INFO ] Deduced a trap composed of 90 places in 2015 ms of which 19 ms to minimize.
[2024-05-24 19:57:02] [INFO ] Deduced a trap composed of 70 places in 1979 ms of which 17 ms to minimize.
[2024-05-24 19:57:04] [INFO ] Deduced a trap composed of 89 places in 2073 ms of which 17 ms to minimize.
[2024-05-24 19:57:06] [INFO ] Deduced a trap composed of 86 places in 2046 ms of which 18 ms to minimize.
[2024-05-24 19:57:08] [INFO ] Deduced a trap composed of 87 places in 2070 ms of which 17 ms to minimize.
[2024-05-24 19:57:10] [INFO ] Deduced a trap composed of 72 places in 2020 ms of which 17 ms to minimize.
[2024-05-24 19:57:12] [INFO ] Deduced a trap composed of 92 places in 2089 ms of which 18 ms to minimize.
[2024-05-24 19:57:14] [INFO ] Deduced a trap composed of 85 places in 2042 ms of which 17 ms to minimize.
[2024-05-24 19:57:16] [INFO ] Deduced a trap composed of 95 places in 2053 ms of which 18 ms to minimize.
[2024-05-24 19:57:19] [INFO ] Deduced a trap composed of 107 places in 2059 ms of which 18 ms to minimize.
[2024-05-24 19:57:21] [INFO ] Deduced a trap composed of 97 places in 2023 ms of which 17 ms to minimize.
[2024-05-24 19:57:23] [INFO ] Deduced a trap composed of 81 places in 1982 ms of which 17 ms to minimize.
[2024-05-24 19:57:25] [INFO ] Deduced a trap composed of 100 places in 2004 ms of which 18 ms to minimize.
[2024-05-24 19:57:27] [INFO ] Deduced a trap composed of 106 places in 2019 ms of which 18 ms to minimize.
[2024-05-24 19:57:29] [INFO ] Deduced a trap composed of 106 places in 1994 ms of which 17 ms to minimize.
[2024-05-24 19:57:31] [INFO ] Deduced a trap composed of 105 places in 2074 ms of which 18 ms to minimize.
[2024-05-24 19:57:33] [INFO ] Deduced a trap composed of 105 places in 2111 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2715 variables, 20/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 19:57:35] [INFO ] Deduced a trap composed of 107 places in 1985 ms of which 17 ms to minimize.
[2024-05-24 19:57:37] [INFO ] Deduced a trap composed of 112 places in 1984 ms of which 18 ms to minimize.
[2024-05-24 19:57:39] [INFO ] Deduced a trap composed of 114 places in 2117 ms of which 18 ms to minimize.
[2024-05-24 19:57:42] [INFO ] Deduced a trap composed of 121 places in 2116 ms of which 18 ms to minimize.
[2024-05-24 19:57:44] [INFO ] Deduced a trap composed of 107 places in 2006 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2715 variables, 5/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2715 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/2759 variables, 44/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2759 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/2763 variables, 4/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 19:57:46] [INFO ] Deduced a trap composed of 98 places in 2077 ms of which 19 ms to minimize.
[2024-05-24 19:57:48] [INFO ] Deduced a trap composed of 109 places in 1975 ms of which 17 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2763 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2763 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6449/9212 variables, 2763/2856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 9212/9212 variables, and 6047 constraints, problems are : Problem set: 2 solved, 0 unsolved in 72332 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 2763/2763 constraints, ReadFeed: 3191/3191 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 40/40 constraints]
After SMT, in 97808ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 446774 ms.

BK_STOP 1716580680192

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S24C02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, 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 r246-tall-171654350800062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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