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.r550-tall-171734899100318.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 FireWire-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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 FireWire-PT-19-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717372364098

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 23:52:45] [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-02 23:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:52:45] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-02 23:52:45] [INFO ] Transformed 602 places.
[2024-06-02 23:52:45] [INFO ] Transformed 944 transitions.
[2024-06-02 23:52:45] [INFO ] Found NUPN structural information;
[2024-06-02 23:52:45] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:52:46] [INFO ] Flatten gal took : 270 ms
RANDOM walk for 40000 steps (15 resets) in 2538 ms. (15 steps per ms) remains 11/15 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 23:52:46] [INFO ] Flatten gal took : 153 ms
BEST_FIRST walk for 40001 steps (15 resets) in 389 ms. (102 steps per ms) remains 11/11 properties
[2024-06-02 23:52:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17928101744709907070.gal : 72 ms
[2024-06-02 23:52:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7238576498552460024.prop : 1 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/ReachabilityCardinality17928101744709907070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7238576498552460024.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (16 resets) in 232 ms. (171 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

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 40000 steps (17 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality7238576498552460024.prop.
BEST_FIRST walk for 40003 steps (12 resets) in 455 ms. (87 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :13 after 42
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :42 after 46
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :46 after 51
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :51 after 341
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :341 after 453
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :453 after 706
BEST_FIRST walk for 40003 steps (8 resets) in 1097 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (10 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :706 after 1916
BEST_FIRST walk for 40000 steps (14 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
Reachability property FireWire-PT-19-ReachabilityCardinality-2024-01 is true.
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1916 after 14339
BEST_FIRST walk for 40000 steps (9 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (15 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
// Phase 1: matrix 944 rows 602 cols
[2024-06-02 23:52:47] [INFO ] Computed 13 invariants in 20 ms
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :14339 after 532579
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 511/602 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 511/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 944/1546 variables, 602/1217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1546/1546 variables, and 1217 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1182 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 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/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 511/602 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 511/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 13 ms to minimize.
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 122 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 122 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 110 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 108 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 122 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:52:49] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:52:50] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:52:50] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:52:50] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 10/625 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:52:50] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:52:50] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 944/1546 variables, 602/1229 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1546 variables, 9/1238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:52:51] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:52:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:52:52] [INFO ] Deduced a trap composed of 138 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:52:52] [INFO ] Deduced a trap composed of 130 places in 192 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1546 variables, 4/1242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1546 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1546/1546 variables, and 1242 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5010 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 16/16 constraints]
After SMT, in 6308ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 368 edges and 602 vertex of which 4 / 602 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1601 edges and 599 vertex of which 590 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 590 transition count 815
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 125 rules applied. Total rules applied 252 place count 468 transition count 812
Reduce places removed 2 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 19 rules applied. Total rules applied 271 place count 466 transition count 795
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 288 place count 449 transition count 795
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 288 place count 449 transition count 779
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 320 place count 433 transition count 779
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 368 place count 385 transition count 730
Iterating global reduction 4 with 48 rules applied. Total rules applied 416 place count 385 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 417 place count 385 transition count 729
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 417 place count 385 transition count 721
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 433 place count 377 transition count 721
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 439 place count 371 transition count 654
Iterating global reduction 5 with 6 rules applied. Total rules applied 445 place count 371 transition count 654
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 448 place count 371 transition count 651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 449 place count 370 transition count 651
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 531 place count 329 transition count 610
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 585 place count 302 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 592 place count 302 transition count 676
Free-agglomeration rule applied 32 times.
Iterating global reduction 7 with 32 rules applied. Total rules applied 624 place count 302 transition count 644
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 657 place count 270 transition count 643
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 672 place count 270 transition count 628
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 676 place count 270 transition count 628
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 680 place count 270 transition count 628
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 681 place count 269 transition count 627
Applied a total of 681 rules in 252 ms. Remains 269 /602 variables (removed 333) and now considering 627/944 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 269/602 places, 627/944 transitions.
RANDOM walk for 40000 steps (689 resets) in 732 ms. (54 steps per ms) remains 6/9 properties
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (132 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (119 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (136 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (138 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (133 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
[2024-06-02 23:52:54] [INFO ] Flow matrix only has 617 transitions (discarded 10 similar events)
// Phase 1: matrix 617 rows 269 cols
[2024-06-02 23:52:54] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:52:54] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/257 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 615/872 variables, 257/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/872 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/885 variables, 11/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/885 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/886 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/886 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 886/886 variables, and 291 constraints, problems are : Problem set: 0 solved, 6 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 269/269 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/257 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:52:55] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-14 does not hold.
Reachability property FireWire-PT-19-ReachabilityCardinality-2024-11 is true.
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-06-02 23:52:55] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :532579 after 570604
[2024-06-02 23:52:55] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 23:52:56] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 23:52:56] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:52:56] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-09 does not hold.
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-00 does not hold.
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :570604 after 584490
At refinement iteration 6 (OVERLAPS) 615/872 variables, 257/273 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/872 variables, 12/285 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/885 variables, 11/296 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/885 variables, 3/299 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-02 23:52:56] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/885 variables, 1/300 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :584490 after 643848
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/886 variables, 1/301 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/886 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/886 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 886/886 variables, and 301 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1699 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 269/269 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 2358ms problems are : Problem set: 3 solved, 3 unsolved
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1213 ms.
Support contains 35 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 627/627 transitions.
Graph (trivial) has 87 edges and 269 vertex of which 6 / 269 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 265 transition count 604
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 248 transition count 601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 246 transition count 601
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 246 transition count 595
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 240 transition count 595
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 237 transition count 592
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 237 transition count 592
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 225 transition count 580
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 223 transition count 574
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 223 transition count 574
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 218 transition count 589
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 218 transition count 588
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 161 place count 218 transition count 524
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 173 place count 218 transition count 512
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 196 place count 206 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 205 place count 206 transition count 492
Applied a total of 205 rules in 101 ms. Remains 206 /269 variables (removed 63) and now considering 492/627 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 206/269 places, 492/627 transitions.
RANDOM walk for 40000 steps (950 resets) in 689 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (113 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :643848 after 4.90065e+06
Interrupted probabilistic random walk after 970870 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :1 out of 2
Probabilistic random walk after 970870 steps, saw 262057 distinct states, run finished after 3005 ms. (steps per millisecond=323 ) properties seen :1
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 23:53:01] [INFO ] Flow matrix only has 445 transitions (discarded 47 similar events)
// Phase 1: matrix 445 rows 206 cols
[2024-06-02 23:53:01] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:53:01] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/174 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/194 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 438/632 variables, 194/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 62/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/643 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/646 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/648 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/650 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/650 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/650 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/651 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/651 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/651 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 64/64 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/174 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:53:02] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/194 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 438/632 variables, 194/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 62/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/643 variables, 7/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/646 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/648 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/650 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/650 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/650 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/651 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:53:02] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/651 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/651 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/651 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 492/492 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 206 transition count 486
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 200 transition count 486
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 200 transition count 481
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 195 transition count 481
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 193 transition count 478
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 193 transition count 478
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 193 transition count 477
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 28 place count 192 transition count 477
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 182 transition count 467
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 180 transition count 463
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 180 transition count 463
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 178 transition count 466
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 178 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 178 transition count 460
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 178 transition count 456
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 71 place count 174 transition count 455
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 174 transition count 455
Applied a total of 72 rules in 85 ms. Remains 174 /206 variables (removed 32) and now considering 455/492 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 174/206 places, 455/492 transitions.
RANDOM walk for 40000 steps (1322 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (229 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-10 does not hold.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :4.90065e+06 after 6.65242e+06
Interrupted probabilistic random walk after 1188796 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 1
Probabilistic random walk after 1188796 steps, saw 308152 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
[2024-06-02 23:53:05] [INFO ] Flow matrix only has 406 transitions (discarded 49 similar events)
// Phase 1: matrix 406 rows 174 cols
[2024-06-02 23:53:05] [INFO ] Computed 10 invariants in 14 ms
[2024-06-02 23:53:05] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/168 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 406/574 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/580 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/580 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/168 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:53:06] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 406/574 variables, 168/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 88/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:53:06] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/580 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/580 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 174 /174 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 174/174 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 174 /174 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-06-02 23:53:06] [INFO ] Flow matrix only has 406 transitions (discarded 49 similar events)
[2024-06-02 23:53:06] [INFO ] Invariant cache hit.
[2024-06-02 23:53:06] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 23:53:06] [INFO ] Flow matrix only has 406 transitions (discarded 49 similar events)
[2024-06-02 23:53:06] [INFO ] Invariant cache hit.
[2024-06-02 23:53:06] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 23:53:07] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-06-02 23:53:07] [INFO ] Redundant transitions in 89 ms returned [163, 168, 273, 274, 375, 376]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 443 sub problems to find dead transitions.
[2024-06-02 23:53:07] [INFO ] Flow matrix only has 400 transitions (discarded 49 similar events)
// Phase 1: matrix 400 rows 174 cols
[2024-06-02 23:53:07] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:53:07] [INFO ] State equation strengthened by 88 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :6.65242e+06 after 8.56611e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 3/174 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 23:53:10] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:53:10] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:53:10] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:53:10] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:53:10] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-06-02 23:53:11] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:53:11] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 2 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :8.56611e+06 after 1.14481e+07
[2024-06-02 23:53:12] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:53:12] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:53:12] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:53:13] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 400/574 variables, 174/195 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 88/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :1.14481e+07 after 1.65938e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 283 constraints, problems are : Problem set: 0 solved, 443 unsolved in 18833 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 3/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (OVERLAPS) 400/574 variables, 174/195 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 88/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 443/726 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 726 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 11/11 constraints]
After SMT, in 49280ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 49287ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 174/174 places, 449/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50055 ms. Remains : 174/174 places, 449/455 transitions.
RANDOM walk for 40000 steps (1267 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (185 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1301255 steps, run timeout after 3001 ms. (steps per millisecond=433 ) properties seen :0 out of 1
Probabilistic random walk after 1301255 steps, saw 335532 distinct states, run finished after 3001 ms. (steps per millisecond=433 ) properties seen :0
[2024-06-02 23:53:59] [INFO ] Flow matrix only has 400 transitions (discarded 49 similar events)
[2024-06-02 23:53:59] [INFO ] Invariant cache hit.
[2024-06-02 23:53:59] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/168 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/568 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/574 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 145/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:53:59] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 400/568 variables, 168/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 88/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/574 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 449/449 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 174/174 places, 449/449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 449/449 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2024-06-02 23:54:00] [INFO ] Flow matrix only has 400 transitions (discarded 49 similar events)
[2024-06-02 23:54:00] [INFO ] Invariant cache hit.
[2024-06-02 23:54:00] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:54:00] [INFO ] Flow matrix only has 400 transitions (discarded 49 similar events)
[2024-06-02 23:54:00] [INFO ] Invariant cache hit.
[2024-06-02 23:54:00] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 23:54:00] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-06-02 23:54:00] [INFO ] Redundant transitions in 5 ms returned []
Running 443 sub problems to find dead transitions.
[2024-06-02 23:54:00] [INFO ] Flow matrix only has 400 transitions (discarded 49 similar events)
[2024-06-02 23:54:00] [INFO ] Invariant cache hit.
[2024-06-02 23:54:00] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 3/174 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 23:54:04] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:54:04] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:54:04] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:54:04] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:54:04] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:54:04] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:54:05] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:54:05] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:54:05] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:54:06] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:54:06] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 400/574 variables, 174/195 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 88/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 283 constraints, problems are : Problem set: 0 solved, 443 unsolved in 18202 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 3/174 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-02 23:54:21] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (OVERLAPS) 400/574 variables, 174/196 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 88/284 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 443/727 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 11 (OVERLAPS) 0/574 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 727 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 12/12 constraints]
After SMT, in 48671ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 48678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49344 ms. Remains : 174/174 places, 449/449 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 142 edges and 174 vertex of which 24 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 619 edges and 154 vertex of which 151 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 146 transition count 323
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 146 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 146 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 145 transition count 318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 143 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 143 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 49 place count 143 transition count 293
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 143 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 142 transition count 292
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 51 place count 142 transition count 289
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 57 place count 139 transition count 289
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 63 place count 136 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 136 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 135 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 69 place count 135 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 135 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 73 place count 134 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 74 place count 133 transition count 244
Iterating global reduction 6 with 1 rules applied. Total rules applied 75 place count 133 transition count 244
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 81 place count 133 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 87 place count 127 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 91 place count 127 transition count 234
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 93 place count 127 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 95 place count 125 transition count 232
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 100 place count 125 transition count 232
Applied a total of 100 rules in 96 ms. Remains 125 /174 variables (removed 49) and now considering 232/449 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:54:49] [INFO ] Flow matrix only has 231 transitions (discarded 1 similar events)
// Phase 1: matrix 231 rows 125 cols
[2024-06-02 23:54:49] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:54:49] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:54:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:54:49] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:54:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 23:54:49] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 23:54:49] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:54:49] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:54:50] [INFO ] Flatten gal took : 38 ms
[2024-06-02 23:54:50] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:54:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1272216332830913787.gal : 3 ms
[2024-06-02 23:54:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10365666035970828602.prop : 0 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/ReachabilityCardinality1272216332830913787.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10365666035970828602.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 ...329
Loading property file /tmp/ReachabilityCardinality10365666035970828602.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 151
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :151 after 499
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :499 after 667
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :667 after 841
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :841 after 3825
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3825 after 6524
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6524 after 24675
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-04 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,115547,0.717666,14900,2,1321,15,30096,6,0,732,43708,0
Total reachable state count : 115547

Verifying 1 reachability properties.
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-04 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-19-ReachabilityCardinality-2024-04,180,0.832038,14900,2,208,15,30096,7,0,758,43708,0
Over-approximation ignoring read arcs solved 0 properties in 1492 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 23:54:51] [INFO ] Flatten gal took : 39 ms
[2024-06-02 23:54:51] [INFO ] Applying decomposition
[2024-06-02 23:54:51] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17975720431927009920.txt' '-o' '/tmp/graph17975720431927009920.bin' '-w' '/tmp/graph17975720431927009920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17975720431927009920.bin' '-l' '-1' '-v' '-w' '/tmp/graph17975720431927009920.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:54:51] [INFO ] Decomposing Gal with order
[2024-06-02 23:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:54:51] [INFO ] Removed a total of 806 redundant transitions.
[2024-06-02 23:54:51] [INFO ] Flatten gal took : 125 ms
[2024-06-02 23:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 26 ms.
[2024-06-02 23:54:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6482132030325336820.gal : 13 ms
[2024-06-02 23:54:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16982749650462387464.prop : 1 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/ReachabilityCardinality6482132030325336820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16982749650462387464.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality16982749650462387464.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 281735
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :281735 after 3.52849e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.52849e+06 after 1.42516e+07
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-04 does not hold.
FORMULA FireWire-PT-19-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.64246e+12,47.4931,1452040,7171,192,1.41416e+06,2630,1555,1.42443e+07,102,10670,0
Total reachable state count : 3642459892181

Verifying 1 reachability properties.
Invariant property FireWire-PT-19-ReachabilityCardinality-2024-04 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-19-ReachabilityCardinality-2024-04,1.36121e+08,48.4527,1452040,447,29,1.41416e+06,2630,1594,1.42443e+07,114,10670,0
All properties solved without resorting to model-checking.
Total runtime 174908 ms.

BK_STOP 1717372540255

--------------------
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="FireWire-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 FireWire-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 r550-tall-171734899100318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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