Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399500438.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-q8m128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-q8m128-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m128-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716333360276

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-q8m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:16:01] [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:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:16:02] [INFO ] Load time of PNML (sax parser for PT used): 844 ms
[2024-05-21 23:16:02] [INFO ] Transformed 754 places.
[2024-05-21 23:16:02] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:16:02] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1086 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 82 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (13 resets) in 2549 ms. (15 steps per ms) remains 5/6 properties
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 690 ms. (57 steps per ms) remains 5/5 properties
[2024-05-21 23:16:04] [INFO ] Flatten gal took : 607 ms
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 447 ms. (89 steps per ms) remains 5/5 properties
[2024-05-21 23:16:04] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:16:04] [INFO ] Flatten gal took : 438 ms
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 23:16:04] [INFO ] Computed 10 invariants in 57 ms
[2024-05-21 23:16:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7247881224937349929.gal : 128 ms
[2024-05-21 23:16:04] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 23:16:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality181832816807836136.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/ReachabilityCardinality7247881224937349929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality181832816807836136.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 ...327
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BugTracking-PT-q8m128-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 105/124 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality181832816807836136.prop.
At refinement iteration 3 (OVERLAPS) 3536/3660 variables, 124/130 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3660 variables, 225/355 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3660 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :35 after 84
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :84 after 286
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :286 after 1140
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1140 after 5456
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :5456 after 32509
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :32509 after 221815
At refinement iteration 6 (OVERLAPS) 345/4005 variables, 153/508 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4005 variables, 3/511 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4005 variables, 77/588 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4005 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/4008 variables, 1/589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4008 variables, 1/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4008 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/4009 variables, 2/592 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4009 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2482 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/116 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :221815 after 5.83261e+08
At refinement iteration 3 (OVERLAPS) 3442/3558 variables, 116/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3558 variables, 136/257 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:16:08] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 20 ms to minimize.
[2024-05-21 23:16:08] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 2 ms to minimize.
[2024-05-21 23:16:09] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3558 variables, 3/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3558 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 446/4004 variables, 160/420 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4004 variables, 3/423 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4004 variables, 166/589 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4004 variables, 3/592 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:16:10] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4004 variables, 1/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:16:11] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4004 variables, 1/594 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4004 variables, 0/594 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 4/4008 variables, 2/596 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4008 variables, 2/598 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4008/4009 variables, and 598 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 278/280 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 7753ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 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.23 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 10 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 466 ms. Remains : 271/280 places, 3873/3904 transitions.
RANDOM walk for 40109 steps (22 resets) in 470 ms. (85 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 103445 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 103445 steps, saw 50220 distinct states, run finished after 3006 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-21 23:16:16] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 271 cols
[2024-05-21 23:16:16] [INFO ] Computed 8 invariants in 51 ms
[2024-05-21 23:16:16] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 86/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2827/2931 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2931 variables, 63/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2931 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1018/3949 variables, 144/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3949 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3949 variables, 220/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3949 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/3950 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3950 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3950 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 22/3972 variables, 22/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/3972 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3972/3972 variables, and 562 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1930 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 86/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2827/2931 variables, 104/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2931 variables, 63/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2931 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1018/3949 variables, 144/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3949 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3949 variables, 220/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3949 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:16:20] [INFO ] Deduced a trap composed of 6 places in 679 ms of which 2 ms to minimize.
[2024-05-21 23:16:21] [INFO ] Deduced a trap composed of 11 places in 604 ms of which 2 ms to minimize.
[2024-05-21 23:16:21] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 2 ms to minimize.
[2024-05-21 23:16:22] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 2 ms to minimize.
[2024-05-21 23:16:22] [INFO ] Deduced a trap composed of 11 places in 646 ms of which 5 ms to minimize.
[2024-05-21 23:16:23] [INFO ] Deduced a trap composed of 45 places in 551 ms of which 4 ms to minimize.
[2024-05-21 23:16:24] [INFO ] Deduced a trap composed of 15 places in 642 ms of which 2 ms to minimize.
[2024-05-21 23:16:24] [INFO ] Deduced a trap composed of 33 places in 489 ms of which 2 ms to minimize.
[2024-05-21 23:16:25] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-05-21 23:16:25] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2024-05-21 23:16:25] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2024-05-21 23:16:25] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3949 variables, 12/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3949 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/3950 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3950 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3950 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 22/3972 variables, 22/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3972 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/3972 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3972/3972 variables, and 577 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9715 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 271/271 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 11791ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5499 ms.
Support contains 18 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 88 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 88 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 74 ms. Remains 271 /271 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2024-05-21 23:16:33] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:16:33] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-21 23:16:34] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:16:35] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2024-05-21 23:16:36] [INFO ] Redundant transitions in 309 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-05-21 23:16:36] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:16:36] [INFO ] Invariant cache hit.
[2024-05-21 23:16:36] [INFO ] State equation strengthened by 283 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :5.83261e+08 after 2.08336e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3871 unsolved
[2024-05-21 23:17:44] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
Problem TDEAD782 is UNSAT
[2024-05-21 23:17:44] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 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
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 30076 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:18:18] [INFO ] Deduced a trap composed of 7 places in 83 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:18:18] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
Problem TDEAD2691 is UNSAT
[2024-05-21 23:18:19] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 1 ms to minimize.
Problem TDEAD2695 is UNSAT
[2024-05-21 23:18:19] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 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:18:19] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 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 30074 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 106496ms problems are : Problem set: 58 solved, 3813 unsolved
Search for dead transitions found 58 dead transitions in 106556ms
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 9 places and 280 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 24 place count 247 transition count 3010
Reduce places removed 12 places and 338 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 36 place count 235 transition count 2672
Reduce places removed 7 places and 185 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 43 place count 228 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 227 transition count 2467
Deduced a syphon composed of 3 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 227 transition count 2467
Deduced a syphon composed of 3 places in 2 ms
Applied a total of 45 rules in 78 ms. Remains 227 /271 variables (removed 44) and now considering 2467/3815 (removed 1348) transitions.
[2024-05-21 23:18:22] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 227 cols
[2024-05-21 23:18:22] [INFO ] Computed 11 invariants in 10 ms
[2024-05-21 23:18:23] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-21 23:18:23] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:18:23] [INFO ] Invariant cache hit.
[2024-05-21 23:18:23] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:18:24] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/271 places, 2467/3873 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 110601 ms. Remains : 227/271 places, 2467/3873 transitions.
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m128-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40002 steps (15 resets) in 733 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 128625 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 3
Probabilistic random walk after 128625 steps, saw 62702 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 23:18:27] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 224 cols
[2024-05-21 23:18:27] [INFO ] Computed 8 invariants in 24 ms
[2024-05-21 23:18:27] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 695/1866 variables, 86/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1866 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 130/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1866 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1867 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1867 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1867 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 679/2546 variables, 50/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2546 variables, 77/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2546 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 34/2580 variables, 32/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2580 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2580 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2580/2580 variables, and 443 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 695/1866 variables, 86/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1866 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 130/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1866 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:18:29] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1866 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1866 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1867 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1867 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1867 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 679/2546 variables, 50/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2546 variables, 77/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2546 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 34/2580 variables, 32/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2580 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2580 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2580 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2580/2580 variables, and 447 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1838 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 224/224 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3202ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11948 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.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 224 transition count 2465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 222 transition count 2465
Applied a total of 4 rules in 80 ms. Remains 222 /224 variables (removed 2) and now considering 2465/2467 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 222/224 places, 2465/2467 transitions.
RANDOM walk for 40341 steps (8 resets) in 42 ms. (938 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 129593 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 3
Probabilistic random walk after 129593 steps, saw 54027 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 23:18:46] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
// Phase 1: matrix 2354 rows 222 cols
[2024-05-21 23:18:46] [INFO ] Computed 8 invariants in 8 ms
[2024-05-21 23:18:46] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 692/1863 variables, 85/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1863 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 130/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1863 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1864 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1864 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 678/2542 variables, 49/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2542 variables, 77/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2542 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 34/2576 variables, 32/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2576 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2576/2576 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1171 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1171 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 692/1863 variables, 85/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1863 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 130/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1863 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:18:48] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:18:48] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2024-05-21 23:18:48] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 2 ms to minimize.
[2024-05-21 23:18:48] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1863 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1863 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1864 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 678/2542 variables, 49/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2542 variables, 77/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2542 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 34/2576 variables, 32/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2576 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:18:49] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:18:50] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2576 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2576 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2576 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2576/2576 variables, and 450 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 4554ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6197 ms.
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 47 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 222/222 places, 2465/2465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 30 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
[2024-05-21 23:18:56] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 23:18:56] [INFO ] Invariant cache hit.
[2024-05-21 23:18:57] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 23:18:57] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 23:18:57] [INFO ] Invariant cache hit.
[2024-05-21 23:18:57] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:18:58] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2024-05-21 23:18:58] [INFO ] Redundant transitions in 74 ms returned []
Running 2464 sub problems to find dead transitions.
[2024-05-21 23:18:58] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 23:18:58] [INFO ] Invariant cache hit.
[2024-05-21 23:18:58] [INFO ] State equation strengthened by 211 read => feed constraints.

BK_STOP 1716333545654

--------------------
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-q8m128"
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-q8m128, 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-171620399500438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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