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.r576-smll-171734920100150.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 MedleyA-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 MedleyA-PT-19-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717385594059

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-03 03:33:16] [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-06-03 03:33:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 03:33:17] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-06-03 03:33:17] [INFO ] Transformed 272 places.
[2024-06-03 03:33:17] [INFO ] Transformed 586 transitions.
[2024-06-03 03:33:17] [INFO ] Found NUPN structural information;
[2024-06-03 03:33:17] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3 places in 19 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 03:33:18] [INFO ] Flatten gal took : 378 ms
RANDOM walk for 40000 steps (20 resets) in 3611 ms. (11 steps per ms) remains 12/14 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 03:33:18] [INFO ] Flatten gal took : 245 ms
[2024-06-03 03:33:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4673660151062953245.gal : 78 ms
BEST_FIRST walk for 40002 steps (12 resets) in 1049 ms. (38 steps per ms) remains 12/12 properties
[2024-06-03 03:33:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15670827035061395872.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/ReachabilityCardinality4673660151062953245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15670827035061395872.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 320 ms. (124 steps per ms) remains 12/12 properties

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 ...329
BEST_FIRST walk for 40003 steps (15 resets) in 268 ms. (148 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality15670827035061395872.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :11 after 23
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :23 after 63
BEST_FIRST walk for 40004 steps (16 resets) in 771 ms. (51 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :63 after 408
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :408 after 528
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :528 after 856
BEST_FIRST walk for 40004 steps (16 resets) in 571 ms. (69 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :856 after 1959
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1959 after 3300
BEST_FIRST walk for 40002 steps (24 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :3300 after 6280
BEST_FIRST walk for 40001 steps (9 resets) in 315 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (11 resets) in 281 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (40 resets) in 302 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (11 resets) in 387 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 410 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 353 ms. (113 steps per ms) remains 12/12 properties
// Phase 1: matrix 583 rows 269 cols
[2024-06-03 03:33:20] [INFO ] Computed 24 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 59/209 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 59/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 60/269 variables, 14/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 60/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 583/852 variables, 269/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 562 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1775 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 59/209 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 59/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 03:33:23] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 19 ms to minimize.
[2024-06-03 03:33:23] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2024-06-03 03:33:23] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2024-06-03 03:33:23] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-06-03 03:33:24] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-06-03 03:33:24] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 23 ms to minimize.
[2024-06-03 03:33:24] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-06-03 03:33:24] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 8/227 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 03:33:24] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 60/269 variables, 14/242 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 60/302 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-03 03:33:25] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-03 03:33:25] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-06-03 03:33:25] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 3 ms to minimize.
[2024-06-03 03:33:25] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-06-03 03:33:25] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:33:26] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-06-03 03:33:26] [INFO ] Deduced a trap composed of 56 places in 311 ms of which 3 ms to minimize.
[2024-06-03 03:33:26] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 2 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-03 03:33:26] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-03 03:33:27] [INFO ] Deduced a trap composed of 73 places in 246 ms of which 3 ms to minimize.
[2024-06-03 03:33:27] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 2 ms to minimize.
[2024-06-03 03:33:27] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 4 ms to minimize.
[2024-06-03 03:33:27] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-06-03 03:33:27] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 7357ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 139 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 7 rules applied. Total rules applied 8 place count 268 transition count 576
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 261 transition count 567
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 33 place count 253 transition count 566
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 33 place count 253 transition count 561
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 248 transition count 561
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 63 place count 228 transition count 538
Iterating global reduction 3 with 20 rules applied. Total rules applied 83 place count 228 transition count 538
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 99 place count 220 transition count 530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 216 transition count 564
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 119 place count 216 transition count 552
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 216 transition count 536
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 216 transition count 533
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 213 transition count 533
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 147 place count 213 transition count 533
Applied a total of 147 rules in 327 ms. Remains 213 /269 variables (removed 56) and now considering 533/583 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 213/269 places, 533/583 transitions.
RANDOM walk for 40000 steps (26 resets) in 460 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (16 resets) in 359 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (11 resets) in 382 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (19 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (15 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (21 resets) in 312 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (14 resets) in 371 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (21 resets) in 360 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (18 resets) in 328 ms. (121 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 415404 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :1 out of 10
Probabilistic random walk after 415404 steps, saw 82583 distinct states, run finished after 3011 ms. (steps per millisecond=137 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 533 rows 213 cols
[2024-06-03 03:33:32] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 03:33:32] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 45/210 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 531/741 variables, 210/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 78/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 5/746 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/746 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/746 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 314 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:34] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-03 03:33:34] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 45/210 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:34] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 4 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 3 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2024-06-03 03:33:35] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:36] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:36] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-06-03 03:33:36] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:33:36] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-06-03 03:33:36] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-06-03 03:33:36] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 531/741 variables, 210/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 78/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/741 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:37] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/741 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:37] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/741 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:38] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/741 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/741 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 5/746 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/746 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:39] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-03 03:33:39] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/746 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-03 03:33:40] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 7 ms to minimize.
Invariant property MedleyA-PT-19-ReachabilityCardinality-2024-11 does not hold.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 19 (INCLUDED_ONLY) 0/746 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-03 03:33:41] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 1/347 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/746 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 347 constraints, problems are : Problem set: 1 solved, 8 unsolved in 9308 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 24/24 constraints]
After SMT, in 10814ms problems are : Problem set: 1 solved, 8 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 11336 ms.
Support contains 87 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 533/533 transitions.
Graph (complete) has 780 edges and 213 vertex of which 210 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 0 with 7 rules applied. Total rules applied 8 place count 210 transition count 523
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 203 transition count 518
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 198 transition count 518
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 198 transition count 517
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 197 transition count 517
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 36 place count 188 transition count 507
Iterating global reduction 3 with 9 rules applied. Total rules applied 45 place count 188 transition count 507
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 71 place count 175 transition count 494
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 173 transition count 520
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 90 place count 173 transition count 505
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 95 place count 173 transition count 500
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 100 place count 168 transition count 500
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 168 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 104 place count 166 transition count 498
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 166 transition count 498
Applied a total of 105 rules in 123 ms. Remains 166 /213 variables (removed 47) and now considering 498/533 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 166/213 places, 498/533 transitions.
RANDOM walk for 40000 steps (27 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (19 resets) in 329 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (10 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (17 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (23 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (15 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 441163 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :2 out of 6
Probabilistic random walk after 441163 steps, saw 87825 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :2
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 03:33:58] [INFO ] Flow matrix only has 486 transitions (discarded 12 similar events)
// Phase 1: matrix 486 rows 166 cols
[2024-06-03 03:33:58] [INFO ] Computed 23 invariants in 15 ms
[2024-06-03 03:33:58] [INFO ] State equation strengthened by 130 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 63/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 59/158 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/164 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 485/649 variables, 164/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 130/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/652 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/652 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/652 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 319 constraints, problems are : Problem set: 0 solved, 4 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 166/166 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 63/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:33:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-03 03:33:59] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 4 ms to minimize.
[2024-06-03 03:33:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-03 03:33:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 59/158 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:33:59] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-03 03:34:00] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 2 ms to minimize.
[2024-06-03 03:34:00] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 3 ms to minimize.
[2024-06-03 03:34:00] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 3 ms to minimize.
[2024-06-03 03:34:00] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 15 ms to minimize.
[2024-06-03 03:34:00] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-03 03:34:01] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 2 ms to minimize.
[2024-06-03 03:34:01] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:34:01] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:01] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-06-03 03:34:01] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
[2024-06-03 03:34:02] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 2 ms to minimize.
[2024-06-03 03:34:02] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 3 ms to minimize.
[2024-06-03 03:34:02] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:02] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2024-06-03 03:34:02] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 2 ms to minimize.
[2024-06-03 03:34:03] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
[2024-06-03 03:34:03] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/164 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:03] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 485/649 variables, 164/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 130/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:03] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-03 03:34:04] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:34:04] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/652 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:04] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:05] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:05] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-03 03:34:05] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:05] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/652 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/652 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 03:34:06] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-06-03 03:34:06] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-06-03 03:34:06] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-06-03 03:34:07] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 2 ms to minimize.
[2024-06-03 03:34:07] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 3 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/652 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/652 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/652 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 359 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8794 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 166/166 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 36/36 constraints]
After SMT, in 9463ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2566 ms.
Support contains 35 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 498/498 transitions.
Graph (complete) has 684 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 0 with 7 rules applied. Total rules applied 8 place count 165 transition count 490
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 158 transition count 490
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 158 transition count 487
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 155 transition count 487
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 33 place count 143 transition count 472
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 143 transition count 472
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 79 place count 126 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 122 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 118 place count 122 transition count 451
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 122 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 120 transition count 449
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 120 transition count 473
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 140 place count 114 transition count 467
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 114 transition count 467
Applied a total of 143 rules in 123 ms. Remains 114 /166 variables (removed 52) and now considering 467/498 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 114/166 places, 467/498 transitions.
RANDOM walk for 40000 steps (26 resets) in 345 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (18 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 557922 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :1 out of 3
Probabilistic random walk after 557922 steps, saw 104568 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 03:34:14] [INFO ] Flow matrix only has 424 transitions (discarded 43 similar events)
// Phase 1: matrix 424 rows 114 cols
[2024-06-03 03:34:14] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 03:34:14] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/109 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/113 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 424/537 variables, 113/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 189/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/538 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/538 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 326 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 03:34:14] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-03 03:34:14] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 37/109 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 03:34:14] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 2 ms to minimize.
[2024-06-03 03:34:15] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 2 ms to minimize.
[2024-06-03 03:34:15] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-03 03:34:15] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/113 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 03:34:15] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 2 ms to minimize.
[2024-06-03 03:34:15] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 424/537 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 189/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/538 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/538 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 336 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1976 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 454 ms.
Support contains 32 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 467/467 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 485
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 110 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 484
Applied a total of 10 rules in 63 ms. Remains 109 /114 variables (removed 5) and now considering 484/467 (removed -17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 109/114 places, 484/467 transitions.
RANDOM walk for 40000 steps (18 resets) in 150 ms. (264 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (16 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-06-03 03:34:17] [INFO ] Flow matrix only has 441 transitions (discarded 43 similar events)
// Phase 1: matrix 441 rows 109 cols
[2024-06-03 03:34:17] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 03:34:17] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/104 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/108 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 441/549 variables, 108/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 205/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/550 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/550 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 109/109 constraints, ReadFeed: 205/205 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/104 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 03:34:17] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2024-06-03 03:34:17] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-06-03 03:34:17] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/108 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 441/549 variables, 108/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 205/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/550 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 03:34:18] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-03 03:34:18] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/550 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 109/109 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 484/484 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 109 transition count 479
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 104 transition count 479
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 104 transition count 478
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 103 transition count 478
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 101 transition count 476
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 101 transition count 476
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 90 transition count 465
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 90 transition count 462
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 88 transition count 475
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 88 transition count 467
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 88 transition count 563
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 83 place count 82 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 82 transition count 544
Applied a total of 84 rules in 182 ms. Remains 82 /109 variables (removed 27) and now considering 544/484 (removed -60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 82/109 places, 544/484 transitions.
RANDOM walk for 40000 steps (3008 resets) in 473 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (392 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 852184 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 1
Probabilistic random walk after 852184 steps, saw 153586 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
[2024-06-03 03:34:22] [INFO ] Flow matrix only has 462 transitions (discarded 82 similar events)
// Phase 1: matrix 462 rows 82 cols
[2024-06-03 03:34:22] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 03:34:22] [INFO ] State equation strengthened by 206 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/77 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/81 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 462/543 variables, 81/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 206/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/544 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/544 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 82/82 constraints, ReadFeed: 206/206 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/77 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 03:34:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-03 03:34:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/81 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 03:34:22] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 81/544 variables, and 26 constraints, problems are : Problem set: 1 solved, 0 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/82 constraints, ReadFeed: 0/206 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 548ms problems are : Problem set: 1 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 65958 ms.

BK_STOP 1717385662647

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r576-smll-171734920100150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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