Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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-q8m004-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2023-05
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2023-07
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2023-10
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716332729306

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-q8m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:05:30] [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:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:05:31] [INFO ] Load time of PNML (sax parser for PT used): 969 ms
[2024-05-21 23:05:31] [INFO ] Transformed 754 places.
[2024-05-21 23:05:32] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:05:32] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1245 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 105 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:05:33] [INFO ] Flatten gal took : 849 ms
RANDOM walk for 40000 steps (454 resets) in 4998 ms. (8 steps per ms) remains 8/11 properties
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (116 resets) in 625 ms. (63 steps per ms) remains 8/8 properties
[2024-05-21 23:05:34] [INFO ] Flatten gal took : 463 ms
BEST_FIRST walk for 40003 steps (118 resets) in 512 ms. (77 steps per ms) remains 8/8 properties
[2024-05-21 23:05:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9188744254668054115.gal : 223 ms
[2024-05-21 23:05:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9096737272297703963.prop : 2 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/ReachabilityCardinality9188744254668054115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9096737272297703963.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (115 resets) in 501 ms. (79 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (107 resets) in 467 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (106 resets) in 679 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (103 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (109 resets) in 1129 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (128 resets) in 258 ms. (154 steps per ms) remains 8/8 properties
[2024-05-21 23:05:35] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 23:05:35] [INFO ] Computed 10 invariants in 54 ms
Loading property file /tmp/ReachabilityCardinality9096737272297703963.prop.
[2024-05-21 23:05:36] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BugTracking-PT-q8m004-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m004-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m004-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m004-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 136/169 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :35 after 70
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :70 after 2260
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2260 after 6775
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :6775 after 15770
At refinement iteration 3 (OVERLAPS) 3637/3806 variables, 169/178 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3806 variables, 216/394 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :15770 after 33725
At refinement iteration 5 (INCLUDED_ONLY) 0/3806 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 202/4008 variables, 110/504 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4008 variables, 87/591 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4008 variables, 0/591 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/4009 variables, 1/592 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4009 variables, 1/593 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 4 solved, 4 unsolved in 3387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 109/133 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 23:05:39] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3084/3217 variables, 133/140 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3217 variables, 140/280 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3217 variables, 1/281 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3217 variables, 0/281 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 789/4006 variables, 144/425 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4006 variables, 2/427 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4006 variables, 163/590 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4006 variables, 3/593 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 23:05:42] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :33725 after 69600
[2024-05-21 23:05:42] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4006 variables, 2/595 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 23:05:43] [INFO ] Deduced a trap composed of 16 places in 364 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4006 variables, 1/596 constraints. Problems are: Problem set: 4 solved, 4 unsolved
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 Int declared 4006/4009 variables, and 596 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 277/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 8777ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 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 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 278 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 278 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 276 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 276 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 270 transition count 3871
Applied a total of 19 rules in 509 ms. Remains 270 /280 variables (removed 10) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 270/280 places, 3871/3904 transitions.
RANDOM walk for 40002 steps (12 resets) in 998 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 462 ms. (86 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 93368 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 4
Probabilistic random walk after 93368 steps, saw 32596 distinct states, run finished after 3007 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-21 23:05:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2024-05-21 23:05:49] [INFO ] Computed 9 invariants in 38 ms
[2024-05-21 23:05:49] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3011/3134 variables, 123/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3134 variables, 74/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3134 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 835/3969 variables, 147/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3969 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3969 variables, 209/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3969 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3969 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3969/3969 variables, and 562 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1424 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3011/3134 variables, 123/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3134 variables, 74/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3134 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 835/3969 variables, 147/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3969 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3969 variables, 209/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3969 variables, 4/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:05:52] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 2 ms to minimize.
[2024-05-21 23:05:53] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 9 ms to minimize.
[2024-05-21 23:05:53] [INFO ] Deduced a trap composed of 22 places in 429 ms of which 1 ms to minimize.
[2024-05-21 23:05:54] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 2 ms to minimize.
[2024-05-21 23:05:54] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 1 ms to minimize.
[2024-05-21 23:05:54] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 2 ms to minimize.
[2024-05-21 23:05:55] [INFO ] Deduced a trap composed of 63 places in 819 ms of which 4 ms to minimize.
[2024-05-21 23:05:56] [INFO ] Deduced a trap composed of 66 places in 463 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3969 variables, 8/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3969 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:05:58] [INFO ] Deduced a trap composed of 67 places in 431 ms of which 2 ms to minimize.
[2024-05-21 23:05:58] [INFO ] Deduced a trap composed of 70 places in 379 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/3969 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3969 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3969 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3969/3969 variables, and 576 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10337 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 11876ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :69600 after 141315
Parikh walk visited 0 properties in 1744 ms.
Support contains 24 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-21 23:06:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:06:02] [INFO ] Invariant cache hit.
[2024-05-21 23:06:03] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-21 23:06:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:06:03] [INFO ] Invariant cache hit.
[2024-05-21 23:06:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:06:07] [INFO ] Implicit Places using invariants and state equation in 4082 ms returned []
Implicit Place search using SMT with State Equation took 4496 ms to find 0 implicit places.
[2024-05-21 23:06:07] [INFO ] Redundant transitions in 476 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 23:06:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:06:07] [INFO ] Invariant cache hit.
[2024-05-21 23:06:07] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-05-21 23:07:43] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3969 variables, and 9 constraints, problems are : Problem set: 8 solved, 3862 unsolved in 30230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 3862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 3862 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :141315 after 284710
[2024-05-21 23:08:09] [INFO ] Deduced a trap composed of 17 places in 1852 ms of which 27 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
[2024-05-21 23:08:09] [INFO ] Deduced a trap composed of 8 places in 459 ms of which 1 ms to minimize.
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
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
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 Int declared 269/3969 variables, and 11 constraints, problems are : Problem set: 428 solved, 3442 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 3/3 constraints]
After SMT, in 126917ms problems are : Problem set: 428 solved, 3442 unsolved
Search for dead transitions found 428 dead transitions in 127053ms
Found 428 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 428 transitions
Dead transitions reduction (with SMT) removed 428 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 3443/3871 transitions.
Reduce places removed 1 places and 25 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 3418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 268 transition count 3393
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 268 transition count 3393
Applied a total of 3 rules in 118 ms. Remains 268 /270 variables (removed 2) and now considering 3393/3443 (removed 50) transitions.
[2024-05-21 23:08:14] [INFO ] Flow matrix only has 3224 transitions (discarded 169 similar events)
// Phase 1: matrix 3224 rows 268 cols
[2024-05-21 23:08:14] [INFO ] Computed 9 invariants in 31 ms
[2024-05-21 23:08:16] [INFO ] Implicit Places using invariants in 1068 ms returned []
[2024-05-21 23:08:16] [INFO ] Flow matrix only has 3224 transitions (discarded 169 similar events)
[2024-05-21 23:08:16] [INFO ] Invariant cache hit.
[2024-05-21 23:08:16] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-21 23:08:19] [INFO ] Implicit Places using invariants and state equation in 3835 ms returned []
Implicit Place search using SMT with State Equation took 4916 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 268/270 places, 3393/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 137208 ms. Remains : 268/270 places, 3393/3871 transitions.
RANDOM walk for 40002 steps (9 resets) in 556 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 69266 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 4
Probabilistic random walk after 69266 steps, saw 24706 distinct states, run finished after 3014 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-21 23:08:23] [INFO ] Flow matrix only has 3224 transitions (discarded 169 similar events)
[2024-05-21 23:08:23] [INFO ] Invariant cache hit.
[2024-05-21 23:08:23] [INFO ] State equation strengthened by 260 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2556/2678 variables, 122/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2678 variables, 71/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2678 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 814/3492 variables, 146/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3492 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3492 variables, 189/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3492 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3492 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3492/3492 variables, and 537 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2473 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 268/268 constraints, ReadFeed: 260/260 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:08:26] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2556/2678 variables, 122/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2678 variables, 71/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2678 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 814/3492 variables, 146/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3492 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3492 variables, 189/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3492 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:08:28] [INFO ] Deduced a trap composed of 8 places in 591 ms of which 2 ms to minimize.
[2024-05-21 23:08:28] [INFO ] Deduced a trap composed of 11 places in 497 ms of which 3 ms to minimize.
[2024-05-21 23:08:29] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 1 ms to minimize.
[2024-05-21 23:08:29] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3492 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:08:32] [INFO ] Deduced a trap composed of 19 places in 2171 ms of which 31 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3492 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3492 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3492 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3492/3492 variables, and 547 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 268/268 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 10430ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4194 ms.
Support contains 24 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 3393/3393 transitions.
Applied a total of 0 rules in 106 ms. Remains 268 /268 variables (removed 0) and now considering 3393/3393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 268/268 places, 3393/3393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 3393/3393 transitions.
Applied a total of 0 rules in 83 ms. Remains 268 /268 variables (removed 0) and now considering 3393/3393 (removed 0) transitions.
[2024-05-21 23:08:38] [INFO ] Flow matrix only has 3224 transitions (discarded 169 similar events)
[2024-05-21 23:08:38] [INFO ] Invariant cache hit.
[2024-05-21 23:08:38] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-21 23:08:38] [INFO ] Flow matrix only has 3224 transitions (discarded 169 similar events)
[2024-05-21 23:08:38] [INFO ] Invariant cache hit.
[2024-05-21 23:08:39] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-21 23:08:41] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2623 ms to find 0 implicit places.
[2024-05-21 23:08:41] [INFO ] Redundant transitions in 333 ms returned []
Running 3392 sub problems to find dead transitions.
[2024-05-21 23:08:41] [INFO ] Flow matrix only has 3224 transitions (discarded 169 similar events)
[2024-05-21 23:08:41] [INFO ] Invariant cache hit.
[2024-05-21 23:08:41] [INFO ] State equation strengthened by 260 read => feed constraints.

BK_STOP 1716332938587

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-q8m004"
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-q8m004, 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-171620399400398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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