Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118400351.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K 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 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K 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 Anderson-PT-08-ReachabilityFireability-2024-00
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME Anderson-PT-08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716433495223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-23 03:04:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 03:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:04:57] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2024-05-23 03:04:57] [INFO ] Transformed 401 places.
[2024-05-23 03:04:57] [INFO ] Transformed 1328 transitions.
[2024-05-23 03:04:57] [INFO ] Found NUPN structural information;
[2024-05-23 03:04:57] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 113 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2500 ms. (15 steps per ms) remains 11/16 properties
FORMULA Anderson-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 414 ms. (96 steps per ms) remains 8/11 properties
FORMULA Anderson-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-08-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 03:04:58] [INFO ] Flatten gal took : 467 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1247 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
[2024-05-23 03:04:58] [INFO ] Flatten gal took : 241 ms
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 8/8 properties
[2024-05-23 03:04:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6261994489733466534.gal : 169 ms
[2024-05-23 03:04:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4384582712909167807.prop : 14 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/ReachabilityCardinality6261994489733466534.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4384582712909167807.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 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 (8 resets) in 315 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality4384582712909167807.prop.
// Phase 1: matrix 1328 rows 401 cols
[2024-05-23 03:04:59] [INFO ] Computed 19 invariants in 59 ms
[2024-05-23 03:04:59] [INFO ] State equation strengthened by 56 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :12 after 19
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :19 after 55
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :55 after 76
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :76 after 391
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :391 after 841
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem Anderson-PT-08-ReachabilityFireability-2024-03 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem Anderson-PT-08-ReachabilityFireability-2024-04 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Anderson-PT-08-ReachabilityFireability-2024-10 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 288/400 variables, 9/121 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 288/409 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 7/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :841 after 4198
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/401 variables, 3/419 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/420 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :4198 after 28393
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 3 solved, 5 unsolved in 4131 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 315/400 variables, 9/94 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 315/409 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 7/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/416 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem Anderson-PT-08-ReachabilityFireability-2024-07 is UNSAT
FORMULA Anderson-PT-08-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 1/401 variables, 3/419 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/420 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-23 03:05:06] [INFO ] Deduced a trap composed of 105 places in 712 ms of which 82 ms to minimize.
[2024-05-23 03:05:07] [INFO ] Deduced a trap composed of 130 places in 427 ms of which 4 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :28393 after 188444
[2024-05-23 03:05:07] [INFO ] Deduced a trap composed of 196 places in 635 ms of which 26 ms to minimize.
[2024-05-23 03:05:08] [INFO ] Deduced a trap composed of 103 places in 557 ms of which 6 ms to minimize.
[2024-05-23 03:05:09] [INFO ] Deduced a trap composed of 136 places in 639 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 5/425 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1729 variables, and 425 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5012 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/401 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 9877ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 45 Pre rules applied. Total rules applied 0 place count 401 transition count 1283
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 356 transition count 1283
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 162 place count 284 transition count 875
Iterating global reduction 0 with 72 rules applied. Total rules applied 234 place count 284 transition count 875
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 248 place count 277 transition count 868
Applied a total of 248 rules in 457 ms. Remains 277 /401 variables (removed 124) and now considering 868/1328 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 277/401 places, 868/1328 transitions.
RANDOM walk for 40000 steps (8 resets) in 601 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 255136 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 4
Probabilistic random walk after 255136 steps, saw 152646 distinct states, run finished after 3007 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 868 rows 277 cols
[2024-05-23 03:05:13] [INFO ] Computed 19 invariants in 13 ms
[2024-05-23 03:05:13] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 201/275 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 868/1145 variables, 277/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 56/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1145 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 352 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 56/56 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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 201/275 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/277 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 868/1145 variables, 277/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 56/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1145 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1145 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1145 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1145/1145 variables, and 356 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6529ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 74 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 868/868 transitions.
Applied a total of 0 rules in 28 ms. Remains 277 /277 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 277/277 places, 868/868 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 868/868 transitions.
Applied a total of 0 rules in 25 ms. Remains 277 /277 variables (removed 0) and now considering 868/868 (removed 0) transitions.
[2024-05-23 03:05:20] [INFO ] Invariant cache hit.
[2024-05-23 03:05:20] [INFO ] Implicit Places using invariants in 304 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 276/277 places, 868/868 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 276 transition count 862
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 270 transition count 862
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 270 transition count 854
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 262 transition count 854
Applied a total of 28 rules in 54 ms. Remains 262 /276 variables (removed 14) and now considering 854/868 (removed 14) transitions.
// Phase 1: matrix 854 rows 262 cols
[2024-05-23 03:05:20] [INFO ] Computed 18 invariants in 9 ms
[2024-05-23 03:05:20] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-23 03:05:20] [INFO ] Invariant cache hit.
[2024-05-23 03:05:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:05:22] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 262/277 places, 854/868 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2021 ms. Remains : 262/277 places, 854/868 transitions.
RANDOM walk for 40000 steps (8 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 302462 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 4
Probabilistic random walk after 302462 steps, saw 178950 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-23 03:05:25] [INFO ] Invariant cache hit.
[2024-05-23 03:05:25] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/261 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/262 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 854/1116 variables, 262/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 56/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
At refinement iteration 9 (OVERLAPS) 0/1116 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 336 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 262/262 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
SDD size :188444 after 5.94293e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/261 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/262 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 03:05:27] [INFO ] Deduced a trap composed of 124 places in 224 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 03:05:27] [INFO ] Deduced a trap composed of 135 places in 226 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 854/1116 variables, 262/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 56/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1116 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1116 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1116 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1116 variables, and 342 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 262/262 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 5145ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 74 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 854/854 transitions.
Applied a total of 0 rules in 26 ms. Remains 262 /262 variables (removed 0) and now considering 854/854 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 262/262 places, 854/854 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 854/854 transitions.
Applied a total of 0 rules in 19 ms. Remains 262 /262 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2024-05-23 03:05:30] [INFO ] Invariant cache hit.
[2024-05-23 03:05:30] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-23 03:05:30] [INFO ] Invariant cache hit.
[2024-05-23 03:05:31] [INFO ] State equation strengthened by 56 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :5.94293e+06 after 6.63089e+06
[2024-05-23 03:05:32] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2024-05-23 03:05:32] [INFO ] Redundant transitions in 68 ms returned []
Running 846 sub problems to find dead transitions.
[2024-05-23 03:05:32] [INFO ] Invariant cache hit.
[2024-05-23 03:05:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 03:05:39] [INFO ] Deduced a trap composed of 79 places in 239 ms of which 3 ms to minimize.
[2024-05-23 03:05:39] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 3 ms to minimize.
[2024-05-23 03:05:40] [INFO ] Deduced a trap composed of 104 places in 226 ms of which 3 ms to minimize.
[2024-05-23 03:05:40] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 3 ms to minimize.
[2024-05-23 03:05:40] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 4 ms to minimize.
[2024-05-23 03:05:40] [INFO ] Deduced a trap composed of 98 places in 229 ms of which 3 ms to minimize.
[2024-05-23 03:05:41] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 3 ms to minimize.
[2024-05-23 03:05:41] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 3 ms to minimize.
[2024-05-23 03:05:41] [INFO ] Deduced a trap composed of 113 places in 257 ms of which 3 ms to minimize.
[2024-05-23 03:05:41] [INFO ] Deduced a trap composed of 101 places in 251 ms of which 2 ms to minimize.
[2024-05-23 03:05:42] [INFO ] Deduced a trap composed of 135 places in 267 ms of which 3 ms to minimize.
[2024-05-23 03:05:42] [INFO ] Deduced a trap composed of 102 places in 258 ms of which 3 ms to minimize.
[2024-05-23 03:05:42] [INFO ] Deduced a trap composed of 99 places in 243 ms of which 3 ms to minimize.
[2024-05-23 03:05:43] [INFO ] Deduced a trap composed of 80 places in 246 ms of which 3 ms to minimize.
[2024-05-23 03:05:43] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 3 ms to minimize.
[2024-05-23 03:05:43] [INFO ] Deduced a trap composed of 77 places in 282 ms of which 3 ms to minimize.
[2024-05-23 03:05:43] [INFO ] Deduced a trap composed of 79 places in 243 ms of which 3 ms to minimize.
[2024-05-23 03:05:44] [INFO ] Deduced a trap composed of 73 places in 246 ms of which 2 ms to minimize.
[2024-05-23 03:05:44] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 3 ms to minimize.
[2024-05-23 03:05:44] [INFO ] Deduced a trap composed of 94 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 03:05:45] [INFO ] Deduced a trap composed of 97 places in 263 ms of which 3 ms to minimize.
[2024-05-23 03:05:46] [INFO ] Deduced a trap composed of 80 places in 252 ms of which 3 ms to minimize.
[2024-05-23 03:05:46] [INFO ] Deduced a trap composed of 137 places in 261 ms of which 3 ms to minimize.
[2024-05-23 03:05:46] [INFO ] Deduced a trap composed of 80 places in 258 ms of which 2 ms to minimize.
[2024-05-23 03:05:46] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 2 ms to minimize.
[2024-05-23 03:05:47] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 3 ms to minimize.
[2024-05-23 03:05:47] [INFO ] Deduced a trap composed of 117 places in 257 ms of which 3 ms to minimize.
[2024-05-23 03:05:47] [INFO ] Deduced a trap composed of 75 places in 255 ms of which 9 ms to minimize.
[2024-05-23 03:05:48] [INFO ] Deduced a trap composed of 78 places in 270 ms of which 10 ms to minimize.
[2024-05-23 03:05:48] [INFO ] Deduced a trap composed of 83 places in 256 ms of which 3 ms to minimize.
[2024-05-23 03:05:48] [INFO ] Deduced a trap composed of 119 places in 254 ms of which 3 ms to minimize.
[2024-05-23 03:05:48] [INFO ] Deduced a trap composed of 112 places in 246 ms of which 3 ms to minimize.
[2024-05-23 03:05:49] [INFO ] Deduced a trap composed of 120 places in 248 ms of which 4 ms to minimize.
[2024-05-23 03:05:49] [INFO ] Deduced a trap composed of 99 places in 256 ms of which 3 ms to minimize.
[2024-05-23 03:05:49] [INFO ] Deduced a trap composed of 78 places in 247 ms of which 3 ms to minimize.
[2024-05-23 03:05:49] [INFO ] Deduced a trap composed of 101 places in 247 ms of which 3 ms to minimize.
[2024-05-23 03:05:50] [INFO ] Deduced a trap composed of 132 places in 265 ms of which 3 ms to minimize.
[2024-05-23 03:05:50] [INFO ] Deduced a trap composed of 148 places in 261 ms of which 3 ms to minimize.
[2024-05-23 03:05:50] [INFO ] Deduced a trap composed of 106 places in 264 ms of which 3 ms to minimize.
[2024-05-23 03:05:51] [INFO ] Deduced a trap composed of 105 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 03:05:58] [INFO ] Deduced a trap composed of 128 places in 262 ms of which 2 ms to minimize.
[2024-05-23 03:05:58] [INFO ] Deduced a trap composed of 129 places in 259 ms of which 3 ms to minimize.
[2024-05-23 03:05:58] [INFO ] Deduced a trap composed of 127 places in 245 ms of which 2 ms to minimize.
[2024-05-23 03:05:59] [INFO ] Deduced a trap composed of 139 places in 254 ms of which 4 ms to minimize.
[2024-05-23 03:05:59] [INFO ] Deduced a trap composed of 125 places in 253 ms of which 2 ms to minimize.
[2024-05-23 03:05:59] [INFO ] Deduced a trap composed of 152 places in 249 ms of which 3 ms to minimize.
[2024-05-23 03:05:59] [INFO ] Deduced a trap composed of 144 places in 257 ms of which 3 ms to minimize.
[2024-05-23 03:06:00] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 3 ms to minimize.
[2024-05-23 03:06:00] [INFO ] Deduced a trap composed of 134 places in 246 ms of which 3 ms to minimize.
[2024-05-23 03:06:01] [INFO ] Deduced a trap composed of 126 places in 266 ms of which 15 ms to minimize.
[2024-05-23 03:06:01] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 3 ms to minimize.
[2024-05-23 03:06:01] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 2 ms to minimize.
[2024-05-23 03:06:01] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 3 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
[2024-05-23 03:06:02] [INFO ] Deduced a trap composed of 124 places in 239 ms of which 4 ms to minimize.
SDD size :6.63089e+06 after 1.17824e+07
[2024-05-23 03:06:02] [INFO ] Deduced a trap composed of 103 places in 247 ms of which 3 ms to minimize.
[2024-05-23 03:06:02] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 3 ms to minimize.
[2024-05-23 03:06:02] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 3 ms to minimize.
[2024-05-23 03:06:03] [INFO ] Deduced a trap composed of 98 places in 252 ms of which 3 ms to minimize.
[2024-05-23 03:06:03] [INFO ] Deduced a trap composed of 92 places in 250 ms of which 2 ms to minimize.
[2024-05-23 03:06:03] [INFO ] Deduced a trap composed of 122 places in 251 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/1116 variables, and 78 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/262 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 846/846 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 846 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 03:06:07] [INFO ] Deduced a trap composed of 80 places in 241 ms of which 2 ms to minimize.
[2024-05-23 03:06:08] [INFO ] Deduced a trap composed of 98 places in 244 ms of which 3 ms to minimize.
[2024-05-23 03:06:08] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 2 ms to minimize.
[2024-05-23 03:06:08] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 3 ms to minimize.
[2024-05-23 03:06:08] [INFO ] Deduced a trap composed of 146 places in 250 ms of which 2 ms to minimize.
[2024-05-23 03:06:09] [INFO ] Deduced a trap composed of 135 places in 249 ms of which 3 ms to minimize.
[2024-05-23 03:06:09] [INFO ] Deduced a trap composed of 132 places in 245 ms of which 3 ms to minimize.
[2024-05-23 03:06:09] [INFO ] Deduced a trap composed of 91 places in 247 ms of which 3 ms to minimize.
[2024-05-23 03:06:09] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 3 ms to minimize.
[2024-05-23 03:06:10] [INFO ] Deduced a trap composed of 149 places in 210 ms of which 3 ms to minimize.
[2024-05-23 03:06:10] [INFO ] Deduced a trap composed of 132 places in 278 ms of which 3 ms to minimize.
[2024-05-23 03:06:10] [INFO ] Deduced a trap composed of 142 places in 253 ms of which 2 ms to minimize.
[2024-05-23 03:06:10] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 3 ms to minimize.
[2024-05-23 03:06:11] [INFO ] Deduced a trap composed of 153 places in 210 ms of which 2 ms to minimize.
[2024-05-23 03:06:11] [INFO ] Deduced a trap composed of 95 places in 245 ms of which 3 ms to minimize.
[2024-05-23 03:06:11] [INFO ] Deduced a trap composed of 99 places in 246 ms of which 3 ms to minimize.
[2024-05-23 03:06:11] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 2 ms to minimize.
[2024-05-23 03:06:12] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
[2024-05-23 03:06:12] [INFO ] Deduced a trap composed of 81 places in 231 ms of which 3 ms to minimize.
[2024-05-23 03:06:12] [INFO ] Deduced a trap composed of 94 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 03:06:15] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 3 ms to minimize.
[2024-05-23 03:06:16] [INFO ] Deduced a trap composed of 104 places in 260 ms of which 4 ms to minimize.
[2024-05-23 03:06:16] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
[2024-05-23 03:06:16] [INFO ] Deduced a trap composed of 94 places in 249 ms of which 2 ms to minimize.
[2024-05-23 03:06:17] [INFO ] Deduced a trap composed of 90 places in 257 ms of which 3 ms to minimize.
[2024-05-23 03:06:17] [INFO ] Deduced a trap composed of 123 places in 207 ms of which 3 ms to minimize.
[2024-05-23 03:06:17] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2024-05-23 03:06:17] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 3 ms to minimize.
[2024-05-23 03:06:18] [INFO ] Deduced a trap composed of 91 places in 233 ms of which 2 ms to minimize.
[2024-05-23 03:06:18] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 3 ms to minimize.
[2024-05-23 03:06:18] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 3 ms to minimize.
[2024-05-23 03:06:18] [INFO ] Deduced a trap composed of 89 places in 209 ms of which 2 ms to minimize.
[2024-05-23 03:06:19] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-05-23 03:06:19] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 2 ms to minimize.
[2024-05-23 03:06:20] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 3 ms to minimize.
[2024-05-23 03:06:20] [INFO ] Deduced a trap composed of 106 places in 248 ms of which 3 ms to minimize.
[2024-05-23 03:06:20] [INFO ] Deduced a trap composed of 115 places in 252 ms of which 3 ms to minimize.
[2024-05-23 03:06:20] [INFO ] Deduced a trap composed of 135 places in 255 ms of which 4 ms to minimize.
[2024-05-23 03:06:21] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 3 ms to minimize.
[2024-05-23 03:06:21] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-23 03:06:25] [INFO ] Deduced a trap composed of 121 places in 208 ms of which 2 ms to minimize.
[2024-05-23 03:06:26] [INFO ] Deduced a trap composed of 151 places in 240 ms of which 2 ms to minimize.
[2024-05-23 03:06:26] [INFO ] Deduced a trap composed of 119 places in 248 ms of which 3 ms to minimize.
[2024-05-23 03:06:26] [INFO ] Deduced a trap composed of 123 places in 244 ms of which 3 ms to minimize.
[2024-05-23 03:06:26] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 3 ms to minimize.
[2024-05-23 03:06:27] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 3 ms to minimize.
[2024-05-23 03:06:27] [INFO ] Deduced a trap composed of 91 places in 246 ms of which 3 ms to minimize.
[2024-05-23 03:06:27] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 3 ms to minimize.
[2024-05-23 03:06:28] [INFO ] Deduced a trap composed of 99 places in 249 ms of which 3 ms to minimize.
[2024-05-23 03:06:28] [INFO ] Deduced a trap composed of 93 places in 268 ms of which 3 ms to minimize.
[2024-05-23 03:06:28] [INFO ] Deduced a trap composed of 100 places in 204 ms of which 2 ms to minimize.
[2024-05-23 03:06:28] [INFO ] Deduced a trap composed of 145 places in 240 ms of which 2 ms to minimize.
[2024-05-23 03:06:29] [INFO ] Deduced a trap composed of 89 places in 235 ms of which 3 ms to minimize.
[2024-05-23 03:06:29] [INFO ] Deduced a trap composed of 111 places in 237 ms of which 3 ms to minimize.
[2024-05-23 03:06:29] [INFO ] Deduced a trap composed of 87 places in 234 ms of which 3 ms to minimize.
[2024-05-23 03:06:29] [INFO ] Deduced a trap composed of 121 places in 236 ms of which 3 ms to minimize.
[2024-05-23 03:06:30] [INFO ] Deduced a trap composed of 103 places in 235 ms of which 3 ms to minimize.
[2024-05-23 03:06:30] [INFO ] Deduced a trap composed of 109 places in 227 ms of which 4 ms to minimize.
[2024-05-23 03:06:30] [INFO ] Deduced a trap composed of 93 places in 229 ms of which 2 ms to minimize.
[2024-05-23 03:06:30] [INFO ] Deduced a trap composed of 115 places in 219 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/1116 variables, and 138 constraints, problems are : Problem set: 0 solved, 846 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/262 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/846 constraints, Known Traps: 120/120 constraints]
After SMT, in 61728ms problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 61747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63403 ms. Remains : 262/262 places, 854/854 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 262 transition count 798
Deduced a syphon composed of 56 places in 7 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 206 transition count 798
Applied a total of 112 rules in 30 ms. Remains 206 /262 variables (removed 56) and now considering 798/854 (removed 56) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 798 rows 206 cols
[2024-05-23 03:06:34] [INFO ] Computed 18 invariants in 5 ms
[2024-05-23 03:06:34] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 03:06:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 03:06:34] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-23 03:06:36] [INFO ] After 1566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 03:06:37] [INFO ] After 2945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 03:06:38] [INFO ] After 4345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-23 03:06:38] [INFO ] Flatten gal took : 76 ms
[2024-05-23 03:06:38] [INFO ] Flatten gal took : 70 ms
[2024-05-23 03:06:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10341047929334637504.gal : 12 ms
[2024-05-23 03:06:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2368271134208514795.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/ReachabilityCardinality10341047929334637504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2368271134208514795.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2368271134208514795.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 32
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :32 after 36
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :36 after 49
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :49 after 128
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :128 after 166
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :166 after 557
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :557 after 1006
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1006 after 12538
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :1.17824e+07 after 1.82384e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :12538 after 215503
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :215503 after 250101
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :250101 after 390731
Detected timeout of ITS tools.
[2024-05-23 03:06:53] [INFO ] Flatten gal took : 44 ms
[2024-05-23 03:06:53] [INFO ] Applying decomposition
[2024-05-23 03:06:53] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10172288155455225930.txt' '-o' '/tmp/graph10172288155455225930.bin' '-w' '/tmp/graph10172288155455225930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10172288155455225930.bin' '-l' '-1' '-v' '-w' '/tmp/graph10172288155455225930.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:06:54] [INFO ] Decomposing Gal with order
[2024-05-23 03:06:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:06:54] [INFO ] Removed a total of 1215 redundant transitions.
[2024-05-23 03:06:54] [INFO ] Flatten gal took : 283 ms
[2024-05-23 03:06:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 69 ms.
[2024-05-23 03:06:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3671234838368613523.gal : 15 ms
[2024-05-23 03:06:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2139973034425523248.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/ReachabilityCardinality3671234838368613523.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2139973034425523248.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2139973034425523248.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 57
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :57 after 1493
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :331858 after 542776
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35868 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 03:07:10] [INFO ] Flatten gal took : 79 ms
[2024-05-23 03:07:10] [INFO ] Applying decomposition
[2024-05-23 03:07:10] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1116401772311011411.txt' '-o' '/tmp/graph1116401772311011411.bin' '-w' '/tmp/graph1116401772311011411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1116401772311011411.bin' '-l' '-1' '-v' '-w' '/tmp/graph1116401772311011411.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:07:10] [INFO ] Decomposing Gal with order
[2024-05-23 03:07:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:07:10] [INFO ] Removed a total of 2115 redundant transitions.
[2024-05-23 03:07:10] [INFO ] Flatten gal took : 160 ms
[2024-05-23 03:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 44 ms.
[2024-05-23 03:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality411666921753022368.gal : 12 ms
[2024-05-23 03:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8531168691177760133.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/ReachabilityCardinality411666921753022368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8531168691177760133.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality8531168691177760133.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :10 after 15
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15 after 17
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17 after 634
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :634 after 911
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :911 after 10292
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :707024 after 743933
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :743933 after 1.0148e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.0148e+06 after 1.27822e+06
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.27822e+06 after 5.71235e+06
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :5.71235e+06 after 2.42684e+07
Detected timeout of ITS tools.
[2024-05-23 03:37:11] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16753810229304943030
[2024-05-23 03:37:11] [INFO ] Applying decomposition
[2024-05-23 03:37:11] [INFO ] Computing symmetric may disable matrix : 854 transitions.
[2024-05-23 03:37:11] [INFO ] Flatten gal took : 32 ms
[2024-05-23 03:37:11] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:37:11] [INFO ] Computing symmetric may enable matrix : 854 transitions.
[2024-05-23 03:37:11] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4970163825871395213.txt' '-o' '/tmp/graph4970163825871395213.bin' '-w' '/tmp/graph4970163825871395213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4970163825871395213.bin' '-l' '-1' '-v' '-w' '/tmp/graph4970163825871395213.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:37:11] [INFO ] Decomposing Gal with order
[2024-05-23 03:37:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:37:11] [INFO ] Computing Do-Not-Accords matrix : 854 transitions.
[2024-05-23 03:37:11] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:37:11] [INFO ] Removed a total of 1316 redundant transitions.
[2024-05-23 03:37:11] [INFO ] Flatten gal took : 97 ms
[2024-05-23 03:37:11] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16753810229304943030
Running compilation step : cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 03:37:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 543 labels/synchronizations in 56 ms.
[2024-05-23 03:37:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13452060435794091578.gal : 10 ms
[2024-05-23 03:37:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1947545326870956529.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/ReachabilityFireability13452060435794091578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1947545326870956529.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability1947545326870956529.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 18
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :18 after 40
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :40 after 3675
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3675 after 35104
Compilation finished in 5222 ms.
Running link step : cd /tmp/ltsmin16753810229304943030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202405==true'
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :35104 after 368285
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.21888e+06 after 2.72069e+06
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202409==true'
Reachability property Anderson-PT-08-ReachabilityFireability-2024-14 is true.
FORMULA Anderson-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202413==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202413==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin16753810229304943030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityFireability202405==true'
Reachability property Anderson-PT-08-ReachabilityFireability-2024-05 is true.
FORMULA Anderson-PT-08-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.7291e+06 after 2.23453e+07

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-08"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-08, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118400351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;