Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399500422.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BugTracking-PT-q8m032, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q8m032-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2023-06
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2023-09
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2023-10
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m032-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716333129765

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:12:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:12:12] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2024-05-21 23:12:12] [INFO ] Transformed 754 places.
[2024-05-21 23:12:12] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:12:12] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1098 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 125 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (67 resets) in 2532 ms. (15 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 292 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 362 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
[2024-05-21 23:12:14] [INFO ] Flatten gal took : 772 ms
BEST_FIRST walk for 40004 steps (12 resets) in 312 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 254 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 235 ms. (169 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 318 ms. (125 steps per ms) remains 10/10 properties
[2024-05-21 23:12:14] [INFO ] Flatten gal took : 455 ms
[2024-05-21 23:12:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10306096571089863237.gal : 98 ms
[2024-05-21 23:12:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15602568370817111293.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/ReachabilityCardinality10306096571089863237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15602568370817111293.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 ...330
Loading property file /tmp/ReachabilityCardinality15602568370817111293.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :35 after 84
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :84 after 286
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :286 after 1140
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :1140 after 5456
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :5456 after 2.7287e+06
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :2.7287e+06 after 9.43733e+06
Interrupted probabilistic random walk after 97044 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 10
Probabilistic random walk after 97044 steps, saw 49286 distinct states, run finished after 3019 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-21 23:12:17] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 23:12:17] [INFO ] Computed 10 invariants in 31 ms
[2024-05-21 23:12:17] [INFO ] State equation strengthened by 303 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, 10 unsolved
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 123/146 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3482/3628 variables, 146/153 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3628 variables, 71/224 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3628 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 379/4007 variables, 132/356 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4007 variables, 1/357 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4007 variables, 232/589 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4007 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2/4009 variables, 2/591 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 2/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 4 solved, 6 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/121 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2984/3105 variables, 121/127 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3105 variables, 70/197 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3105 variables, 0/197 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 879/3984 variables, 135/332 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3984 variables, 1/333 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3984 variables, 232/565 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3984 variables, 6/571 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-21 23:12:21] [INFO ] Deduced a trap composed of 67 places in 421 ms of which 17 ms to minimize.
[2024-05-21 23:12:22] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 2 ms to minimize.
[2024-05-21 23:12:22] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3984 variables, 3/574 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-21 23:12:23] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 3 ms to minimize.
[2024-05-21 23:12:24] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3984 variables, 2/576 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-21 23:12:24] [INFO ] Deduced a trap composed of 68 places in 334 ms of which 1 ms to minimize.
SMT process timed out in 7431ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 275 transition count 3873
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 271 transition count 3873
Applied a total of 15 rules in 446 ms. Remains 271 /280 variables (removed 9) and now considering 3873/3904 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 271/280 places, 3873/3904 transitions.
RANDOM walk for 40000 steps (79 resets) in 617 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :9.43733e+06 after 2.2848e+07
BEST_FIRST walk for 40004 steps (11 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 126570 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 6
Probabilistic random walk after 126570 steps, saw 64477 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 23:12:29] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 271 cols
[2024-05-21 23:12:29] [INFO ] Computed 8 invariants in 18 ms
[2024-05-21 23:12:29] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 102/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3953 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3953 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3953 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 19/3972 variables, 19/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3972/3972 variables, and 562 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 102/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 6/547 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:12:33] [INFO ] Deduced a trap composed of 23 places in 540 ms of which 3 ms to minimize.
[2024-05-21 23:12:33] [INFO ] Deduced a trap composed of 61 places in 424 ms of which 2 ms to minimize.
[2024-05-21 23:12:34] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 4 ms to minimize.
[2024-05-21 23:12:34] [INFO ] Deduced a trap composed of 76 places in 456 ms of which 13 ms to minimize.
[2024-05-21 23:12:35] [INFO ] Deduced a trap composed of 76 places in 432 ms of which 3 ms to minimize.
[2024-05-21 23:12:36] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 1 ms to minimize.
[2024-05-21 23:12:36] [INFO ] Deduced a trap composed of 62 places in 461 ms of which 2 ms to minimize.
[2024-05-21 23:12:37] [INFO ] Deduced a trap composed of 14 places in 413 ms of which 2 ms to minimize.
[2024-05-21 23:12:37] [INFO ] Deduced a trap composed of 67 places in 431 ms of which 1 ms to minimize.
[2024-05-21 23:12:38] [INFO ] Deduced a trap composed of 65 places in 409 ms of which 2 ms to minimize.
[2024-05-21 23:12:38] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 2 ms to minimize.
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2023-10 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2023-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/3952 variables, 11/558 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 23:12:39] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3952 variables, 1/559 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3952 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/3953 variables, 1/560 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3953 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3953 variables, 0/561 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 19/3972 variables, 19/580 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3972 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/3972 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3972/3972 variables, and 580 constraints, problems are : Problem set: 1 solved, 5 unsolved in 11091 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 13367ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9562 ms.
Support contains 11 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 86 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 271/271 places, 3873/3873 transitions.
RANDOM walk for 40039 steps (84 resets) in 610 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (14 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 123099 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 5
Probabilistic random walk after 123099 steps, saw 62686 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-21 23:12:55] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:12:55] [INFO ] Invariant cache hit.
[2024-05-21 23:12:55] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/3953 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3953 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3953 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 19/3972 variables, 19/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3972/3972 variables, and 562 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 103/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2956/3070 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3070 variables, 45/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3070 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 882/3952 variables, 137/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3952 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3952 variables, 238/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3952 variables, 5/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:12:58] [INFO ] Deduced a trap composed of 10 places in 492 ms of which 3 ms to minimize.
[2024-05-21 23:12:59] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 2 ms to minimize.
[2024-05-21 23:12:59] [INFO ] Deduced a trap composed of 66 places in 382 ms of which 2 ms to minimize.
[2024-05-21 23:13:00] [INFO ] Deduced a trap composed of 24 places in 337 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3952 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3952 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/3953 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3953 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:13:01] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3953 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3953 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 19/3972 variables, 19/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3972 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/3972 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3972/3972 variables, and 572 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7636 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 9066ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16042 ms.
Support contains 11 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 72 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 271/271 places, 3873/3873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 3873/3873 transitions.
Applied a total of 0 rules in 53 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2024-05-21 23:13:20] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:13:20] [INFO ] Invariant cache hit.
[2024-05-21 23:13:21] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-21 23:13:21] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:13:21] [INFO ] Invariant cache hit.
[2024-05-21 23:13:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:13:23] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2024-05-21 23:13:23] [INFO ] Redundant transitions in 213 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-05-21 23:13:23] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:13:23] [INFO ] Invariant cache hit.
[2024-05-21 23:13:23] [INFO ] State equation strengthened by 283 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :2.2848e+07 after 4.96629e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3871 unsolved
[2024-05-21 23:14:35] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
Problem TDEAD782 is UNSAT
[2024-05-21 23:14:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3972 variables, and 10 constraints, problems are : Problem set: 10 solved, 3861 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/271 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 3861 unsolved
Problem TDEAD3799 is UNSAT
Problem TDEAD3805 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3817 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 2/10 constraints. Problems are: Problem set: 14 solved, 3857 unsolved
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
Problem TDEAD2690 is UNSAT
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
Problem TDEAD2691 is UNSAT
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
Problem TDEAD2695 is UNSAT
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2717 is UNSAT
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3972 variables, and 15 constraints, problems are : Problem set: 58 solved, 3813 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/271 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2668 constraints, Known Traps: 7/7 constraints]
After SMT, in 110619ms problems are : Problem set: 58 solved, 3813 unsolved
Search for dead transitions found 58 dead transitions in 110664ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 271/271 places, 3815/3873 transitions.
Reduce places removed 15 places and 525 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 256 transition count 3290
Reduce places removed 10 places and 280 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 25 place count 246 transition count 3010
Reduce places removed 12 places and 338 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 37 place count 234 transition count 2672
Reduce places removed 8 places and 185 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 45 place count 226 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 225 transition count 2467
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 225 transition count 2467
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 47 rules in 74 ms. Remains 225 /271 variables (removed 46) and now considering 2467/3815 (removed 1348) transitions.
[2024-05-21 23:15:14] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 225 cols
[2024-05-21 23:15:14] [INFO ] Computed 9 invariants in 12 ms
[2024-05-21 23:15:14] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 23:15:14] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:15:14] [INFO ] Invariant cache hit.
[2024-05-21 23:15:14] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:15:15] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 225/271 places, 2467/3873 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 114961 ms. Remains : 225/271 places, 2467/3873 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40006 steps (84 resets) in 698 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (12 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (13 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 140720 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 5
Probabilistic random walk after 140720 steps, saw 71653 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-21 23:15:19] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 224 cols
[2024-05-21 23:15:19] [INFO ] Computed 8 invariants in 10 ms
[2024-05-21 23:15:19] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BugTracking-PT-q8m032-ReachabilityCardinality-2023-09 is UNSAT
FORMULA BugTracking-PT-q8m032-ReachabilityCardinality-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 74/82 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/2562 variables, 1/423 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2562 variables, 2/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2562 variables, 0/425 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 18/2580 variables, 18/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2580/2580 variables, and 443 constraints, problems are : Problem set: 1 solved, 4 unsolved in 962 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/82 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 4/426 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:15:21] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 2 ms to minimize.
[2024-05-21 23:15:21] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 2 ms to minimize.
[2024-05-21 23:15:22] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 2 ms to minimize.
[2024-05-21 23:15:22] [INFO ] Deduced a trap composed of 55 places in 281 ms of which 6 ms to minimize.
[2024-05-21 23:15:22] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 1 ms to minimize.
[2024-05-21 23:15:23] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 1 ms to minimize.
[2024-05-21 23:15:23] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 1 ms to minimize.
[2024-05-21 23:15:23] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 1 ms to minimize.
[2024-05-21 23:15:24] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-21 23:15:24] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 2 ms to minimize.
[2024-05-21 23:15:24] [INFO ] Deduced a trap composed of 79 places in 265 ms of which 1 ms to minimize.
[2024-05-21 23:15:25] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 2 ms to minimize.
[2024-05-21 23:15:25] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2560 variables, 13/439 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2560 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/2562 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2562 variables, 2/442 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2562 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 18/2580 variables, 18/460 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2580 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2580 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2580/2580 variables, and 460 constraints, problems are : Problem set: 1 solved, 4 unsolved in 6396 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 13/13 constraints]
After SMT, in 7404ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3451 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Applied a total of 0 rules in 37 ms. Remains 224 /224 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 224/224 places, 2467/2467 transitions.
RANDOM walk for 40020 steps (76 resets) in 433 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 124668 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 124668 steps, saw 63533 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-21 23:15:33] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:15:33] [INFO ] Invariant cache hit.
[2024-05-21 23:15:33] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/2562 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2562 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2562 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 18/2580 variables, 18/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2580/2580 variables, and 443 constraints, problems are : Problem set: 0 solved, 4 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1701/1783 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1783 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 777/2560 variables, 122/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2560 variables, 173/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2560 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:15:35] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2024-05-21 23:15:36] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 1 ms to minimize.
[2024-05-21 23:15:36] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2024-05-21 23:15:36] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2560 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2560 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/2562 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2562 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:15:37] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2562 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2562 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 18/2580 variables, 18/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:15:37] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2580 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2580 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2580 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2580/2580 variables, and 453 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3923 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 4944ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2522 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Applied a total of 0 rules in 32 ms. Remains 224 /224 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 224/224 places, 2467/2467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 2467/2467 transitions.
Applied a total of 0 rules in 33 ms. Remains 224 /224 variables (removed 0) and now considering 2467/2467 (removed 0) transitions.
[2024-05-21 23:15:41] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:15:41] [INFO ] Invariant cache hit.
[2024-05-21 23:15:41] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-21 23:15:41] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:15:41] [INFO ] Invariant cache hit.
[2024-05-21 23:15:41] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:15:42] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2024-05-21 23:15:42] [INFO ] Redundant transitions in 66 ms returned []
Running 2465 sub problems to find dead transitions.
[2024-05-21 23:15:42] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:15:42] [INFO ] Invariant cache hit.
[2024-05-21 23:15:42] [INFO ] State equation strengthened by 211 read => feed constraints.

BK_STOP 1716333345627

--------------------
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="BugTracking-PT-q8m032"
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 BugTracking-PT-q8m032, 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 r048-tajo-171620399500422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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