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-171734920000087.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-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K 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.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 160K 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-11-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717364693594

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-02 21:44:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:44:56] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-06-02 21:44:56] [INFO ] Transformed 150 places.
[2024-06-02 21:44:56] [INFO ] Transformed 478 transitions.
[2024-06-02 21:44:56] [INFO ] Found NUPN structural information;
[2024-06-02 21:44:56] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 297 ms
[2024-06-02 21:44:58] [INFO ] Flatten gal took : 162 ms
[2024-06-02 21:44:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4969984842277880156.gal : 52 ms
RANDOM walk for 40000 steps (3120 resets) in 4870 ms. (8 steps per ms) remains 14/16 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 21:44:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3749451989873527442.prop : 46 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/ReachabilityCardinality4969984842277880156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3749451989873527442.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40003 steps (530 resets) in 483 ms. (82 steps per ms) remains 13/14 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (550 resets) in 601 ms. (66 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality3749451989873527442.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :13 after 37
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :37 after 347
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :347 after 392
Invariant property MedleyA-PT-11-ReachabilityFireability-2024-15 does not hold.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :392 after 1071
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :1071 after 1644
BEST_FIRST walk for 40004 steps (440 resets) in 1552 ms. (25 steps per ms) remains 13/13 properties
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :1644 after 22273
BEST_FIRST walk for 40004 steps (546 resets) in 261 ms. (152 steps per ms) remains 13/13 properties
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :22273 after 40279
BEST_FIRST walk for 40003 steps (537 resets) in 212 ms. (187 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (536 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (543 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (545 resets) in 245 ms. (162 steps per ms) remains 12/13 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (478 resets) in 225 ms. (177 steps per ms) remains 12/12 properties
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-04 is true.
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :40279 after 47114
BEST_FIRST walk for 40004 steps (443 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (549 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (436 resets) in 417 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (475 resets) in 310 ms. (128 steps per ms) remains 12/12 properties
[2024-06-02 21:45:00] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
Invariant property MedleyA-PT-11-ReachabilityFireability-2024-06 does not hold.
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-06-02 21:45:00] [INFO ] Computed 23 invariants in 31 ms
[2024-06-02 21:45:00] [INFO ] State equation strengthened by 171 read => feed constraints.
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-02 is true.
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :47114 after 90207
Invariant property MedleyA-PT-11-ReachabilityFireability-2024-11 does not hold.
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-08 is true.
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :90207 after 284463
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/102 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 17/117 variables, 9/111 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 17/128 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 30/147 variables, 12/140 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 30/170 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/170 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 394/541 variables, 147/317 constraints. Problems are: Problem set: 4 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :284463 after 301503
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 171/488 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/488 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 6/547 variables, 3/491 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 3/494 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 4 solved, 7 unsolved in 1355 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 26/104 variables, 9/87 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 26/113 constraints. Problems are: Problem set: 5 solved, 6 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :301503 after 336783
[2024-06-02 21:45:02] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/114 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem MedleyA-PT-11-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 43/147 variables, 14/128 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 43/171 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-06-02 21:45:02] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:45:03] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 2/173 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-06-02 21:45:03] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:45:03] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:45:03] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 3/176 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/176 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 394/541 variables, 147/323 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 171/494 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 1/495 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-06-02 21:45:04] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:45:04] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:45:04] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:45:04] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-06-02 21:45:04] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :336783 after 720351
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 5/500 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/500 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/547 variables, 3/503 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 3/506 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 4/510 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/510 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-06-02 21:45:06] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:45:06] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:45:06] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:45:06] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/547 variables, 4/514 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/547 variables, 0/514 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 514 constraints, problems are : Problem set: 6 solved, 5 unsolved in 5008 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 15/15 constraints]
After SMT, in 7153ms problems are : Problem set: 6 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 120 transition count 428
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 120 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 119 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 119 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 119 transition count 420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 65 place count 119 transition count 445
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 70 place count 114 transition count 445
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 114 transition count 445
Applied a total of 80 rules in 179 ms. Remains 114 /150 variables (removed 36) and now considering 445/469 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 114/150 places, 445/469 transitions.
RANDOM walk for 40000 steps (3086 resets) in 827 ms. (48 steps per ms) remains 4/5 properties
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (572 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (557 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (550 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (407 resets) in 430 ms. (92 steps per ms) remains 4/4 properties
[2024-06-02 21:45:08] [INFO ] Flow matrix only has 373 transitions (discarded 72 similar events)
// Phase 1: matrix 373 rows 114 cols
[2024-06-02 21:45:08] [INFO ] Computed 23 invariants in 5 ms
[2024-06-02 21:45:08] [INFO ] State equation strengthened by 184 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 33/114 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 373/487 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 184/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 321 constraints, problems are : Problem set: 0 solved, 4 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 184/184 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:45:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-05 is true.
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 8192
[2024-06-02 21:45:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
SDD size :720351 after 1.49469e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 33/114 variables, 14/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 21:45:09] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:45:09] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:45:09] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:45:09] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 4/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 373/487 variables, 114/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 184/327 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 3/330 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 21:45:10] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 1/331 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/487 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 331 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 114/114 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 3695ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1091 ms.
Support contains 52 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 445/445 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 439
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 112 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 111 transition count 438
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 111 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 110 transition count 485
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 110 transition count 485
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 108 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 108 transition count 470
Applied a total of 15 rules in 76 ms. Remains 108 /114 variables (removed 6) and now considering 470/445 (removed -25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 108/114 places, 470/445 transitions.
RANDOM walk for 40000 steps (3089 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (552 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (408 resets) in 399 ms. (100 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 812777 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :1 out of 2
Probabilistic random walk after 812777 steps, saw 151898 distinct states, run finished after 3015 ms. (steps per millisecond=269 ) properties seen :1
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 21:45:16] [INFO ] Flow matrix only has 398 transitions (discarded 72 similar events)
// Phase 1: matrix 398 rows 108 cols
[2024-06-02 21:45:16] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:45:16] [INFO ] State equation strengthened by 201 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/105 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/108 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 398/506 variables, 108/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 201/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/506 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/108 constraints, ReadFeed: 201/201 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/63 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/105 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:45:16] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:45:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/108 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 398/506 variables, 108/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 201/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:45:17] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/506 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/108 constraints, ReadFeed: 201/201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 23 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 470/470 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 102 transition count 449
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 102 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 100 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 100 transition count 433
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 98 transition count 431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 97 transition count 434
Free-agglomeration rule (complex) applied 7 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 97 transition count 587
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 49 place count 90 transition count 574
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 87 transition count 523
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 87 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 85 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 85 transition count 491
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 85 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 84 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 84 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 83 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 83 transition count 472
Applied a total of 65 rules in 88 ms. Remains 83 /108 variables (removed 25) and now considering 472/470 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 83/108 places, 472/470 transitions.
RANDOM walk for 40000 steps (3952 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (890 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 915607 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :0 out of 1
Probabilistic random walk after 915607 steps, saw 178527 distinct states, run finished after 3005 ms. (steps per millisecond=304 ) properties seen :0
[2024-06-02 21:45:20] [INFO ] Flow matrix only has 400 transitions (discarded 72 similar events)
// Phase 1: matrix 400 rows 83 cols
[2024-06-02 21:45:20] [INFO ] Computed 23 invariants in 3 ms
[2024-06-02 21:45:20] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/81 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/83 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 400/483 variables, 83/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 210/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/483 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 210/210 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/81 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:45:21] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/83 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 400/483 variables, 83/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 210/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:45:22] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:45:22] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:45:22] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/483 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/483 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1603ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 23 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 472/472 transitions.
Applied a total of 0 rules in 20 ms. Remains 83 /83 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 83/83 places, 472/472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 472/472 transitions.
Applied a total of 0 rules in 20 ms. Remains 83 /83 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2024-06-02 21:45:22] [INFO ] Flow matrix only has 400 transitions (discarded 72 similar events)
[2024-06-02 21:45:22] [INFO ] Invariant cache hit.
[2024-06-02 21:45:22] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-02 21:45:22] [INFO ] Flow matrix only has 400 transitions (discarded 72 similar events)
[2024-06-02 21:45:22] [INFO ] Invariant cache hit.
[2024-06-02 21:45:23] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-02 21:45:23] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-06-02 21:45:23] [INFO ] Redundant transitions in 44 ms returned []
Running 470 sub problems to find dead transitions.
[2024-06-02 21:45:23] [INFO ] Flow matrix only has 400 transitions (discarded 72 similar events)
[2024-06-02 21:45:23] [INFO ] Invariant cache hit.
[2024-06-02 21:45:23] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/83 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 362 unsolved
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 6 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:45:28] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:45:29] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:45:29] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:45:29] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:45:29] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 3 ms to minimize.
[2024-06-02 21:45:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
Invariant property MedleyA-PT-11-ReachabilityFireability-2024-13 does not hold.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-06-02 21:45:30] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.49469e+06 after 3.34064e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 19/42 constraints. Problems are: Problem set: 108 solved, 362 unsolved
[2024-06-02 21:45:33] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/43 constraints. Problems are: Problem set: 108 solved, 362 unsolved
[2024-06-02 21:45:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:45:35] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/45 constraints. Problems are: Problem set: 108 solved, 362 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :3.34064e+06 after 3.67802e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/45 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 400/483 variables, 83/128 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 210/338 constraints. Problems are: Problem set: 108 solved, 362 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :3.67802e+06 after 4.27253e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/338 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 10 (OVERLAPS) 0/483 variables, 0/338 constraints. Problems are: Problem set: 108 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 338 constraints, problems are : Problem set: 108 solved, 362 unsolved in 27948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 108 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 22/45 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/45 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 400/483 variables, 83/128 constraints. Problems are: Problem set: 108 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 210/338 constraints. Problems are: Problem set: 108 solved, 362 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :4.27253e+06 after 7.17066e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 362/700 constraints. Problems are: Problem set: 108 solved, 362 unsolved
[2024-06-02 21:46:06] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:46:14] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 2/702 constraints. Problems are: Problem set: 108 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 702 constraints, problems are : Problem set: 108 solved, 362 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 362/470 constraints, Known Traps: 24/24 constraints]
After SMT, in 59618ms problems are : Problem set: 108 solved, 362 unsolved
Search for dead transitions found 108 dead transitions in 59638ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 364/472 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 364
Applied a total of 2 rules in 20 ms. Remains 81 /83 variables (removed 2) and now considering 364/364 (removed 0) transitions.
// Phase 1: matrix 364 rows 81 cols
[2024-06-02 21:46:23] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:46:23] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 21:46:23] [INFO ] Invariant cache hit.
[2024-06-02 21:46:23] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-02 21:46:23] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 364/472 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60944 ms. Remains : 81/83 places, 364/472 transitions.
RANDOM walk for 40000 steps (3942 resets) in 360 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (887 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1149894 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :0 out of 1
Probabilistic random walk after 1149894 steps, saw 220452 distinct states, run finished after 3004 ms. (steps per millisecond=382 ) properties seen :0
[2024-06-02 21:46:26] [INFO ] Invariant cache hit.
[2024-06-02 21:46:26] [INFO ] State equation strengthened by 174 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/81 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 364/445 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 174/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/445 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 174/174 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:46:27] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/81 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 364/445 variables, 81/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 174/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 23 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 364/364 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 81/81 places, 364/364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 364/364 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2024-06-02 21:46:27] [INFO ] Invariant cache hit.
[2024-06-02 21:46:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:46:27] [INFO ] Invariant cache hit.
[2024-06-02 21:46:27] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-02 21:46:28] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 21:46:28] [INFO ] Redundant transitions in 4 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-02 21:46:28] [INFO ] Invariant cache hit.
[2024-06-02 21:46:28] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:46:30] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:46:30] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 16 ms to minimize.
[2024-06-02 21:46:31] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:46:31] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:46:31] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:46:31] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:46:31] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:46:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:46:34] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:46:34] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:46:35] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:46:35] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:46:35] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:46:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:46:37] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 364/445 variables, 81/121 constraints. Problems are: Problem set: 0 solved, 362 unsolved
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :7.17066e+06 after 2.89409e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 174/295 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 11 (OVERLAPS) 0/445 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 295 constraints, problems are : Problem set: 0 solved, 362 unsolved in 21358 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 364/445 variables, 81/121 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 174/295 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 362/657 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:46:58] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:47:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 21:47:09] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:47:09] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 661 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 23/23 constraints]
After SMT, in 51946ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 51951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52360 ms. Remains : 81/81 places, 364/364 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 81 transition count 359
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 81 transition count 357
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 29 place count 79 transition count 337
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 79 transition count 337
Applied a total of 31 rules in 26 ms. Remains 79 /81 variables (removed 2) and now considering 337/364 (removed 27) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 337 rows 79 cols
[2024-06-02 21:47:20] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 21:47:20] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:47:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-02 21:47:20] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-02 21:47:20] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:47:20] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:47:20] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:47:20] [INFO ] Flatten gal took : 47 ms
[2024-06-02 21:47:20] [INFO ] Flatten gal took : 46 ms
[2024-06-02 21:47:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9035810717036898620.gal : 7 ms
[2024-06-02 21:47:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2406363626846384271.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/ReachabilityCardinality9035810717036898620.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2406363626846384271.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2406363626846384271.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 141
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :141 after 218
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :218 after 1090
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1090 after 2150
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2150 after 10598
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10598 after 27635
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :27635 after 245271
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245271 after 754883
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-07 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 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,1.35302e+06,1.17366,26140,2,4482,18,77278,6,0,643,114352,0
Total reachable state count : 1353020

Verifying 1 reachability properties.
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-11-ReachabilityFireability-2024-07,1422,1.17733,26140,2,318,18,77278,7,0,693,114352,0
Over-approximation ignoring read arcs solved 0 properties in 1777 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 21:47:21] [INFO ] Flatten gal took : 39 ms
[2024-06-02 21:47:21] [INFO ] Applying decomposition
[2024-06-02 21:47:22] [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/graph8693821914663592197.txt' '-o' '/tmp/graph8693821914663592197.bin' '-w' '/tmp/graph8693821914663592197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8693821914663592197.bin' '-l' '-1' '-v' '-w' '/tmp/graph8693821914663592197.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:47:22] [INFO ] Decomposing Gal with order
[2024-06-02 21:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:47:22] [INFO ] Removed a total of 891 redundant transitions.
[2024-06-02 21:47:22] [INFO ] Flatten gal took : 142 ms
[2024-06-02 21:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 27 ms.
[2024-06-02 21:47:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12630105819607552245.gal : 9 ms
[2024-06-02 21:47:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3692083327171086518.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/ReachabilityCardinality12630105819607552245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3692083327171086518.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/ReachabilityCardinality3692083327171086518.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 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 38
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :38 after 146
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2545 after 3205
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3205 after 23011
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :23011 after 372455
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :372455 after 3.4943e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.4943e+06 after 4.61623e+07
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-07 is true.
FORMULA MedleyA-PT-11-ReachabilityFireability-2024-07 TRUE 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 2049 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.60471e+08,389.214,4751456,95764,6913,5.76516e+06,63679,814,2.96987e+07,372,1.41137e+06,0
Total reachable state count : 360470721

Verifying 1 reachability properties.
Reachability property MedleyA-PT-11-ReachabilityFireability-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-11-ReachabilityFireability-2024-07,28148,393.259,4751456,354,485,5.76516e+06,63679,950,2.96987e+07,400,1.41137e+06,0
All properties solved without resorting to model-checking.
Total runtime 539801 ms.

BK_STOP 1717365236247

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-11"
export BK_EXAMINATION="ReachabilityFireability"
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-11, examination is ReachabilityFireability"
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-171734920000087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-11.tgz
mv MedleyA-PT-11 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;