fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853729300438
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ASLink-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ???T?FFTFFF?F?TT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729300438.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ASLink-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729300438
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.4M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-00
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-01
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-02
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-03
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-04
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-05
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-06
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-08
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-09
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-10
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-11
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-12
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-13
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-14
FORMULA_NAME ASLink-PT-10b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748620593758

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 15:56:34] [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]
[2025-05-30 15:56:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 15:56:35] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2025-05-30 15:56:35] [INFO ] Transformed 4410 places.
[2025-05-30 15:56:35] [INFO ] Transformed 5405 transitions.
[2025-05-30 15:56:35] [INFO ] Found NUPN structural information;
[2025-05-30 15:56:35] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (50 resets) in 2373 ms. (16 steps per ms) remains 9/13 properties
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 541 ms. (73 steps per ms) remains 9/9 properties
[2025-05-30 15:56:36] [INFO ] Flatten gal took : 740 ms
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
[2025-05-30 15:56:37] [INFO ] Flatten gal took : 309 ms
[2025-05-30 15:56:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9384835856173193027.gal : 82 ms
[2025-05-30 15:56:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6698411152880148108.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9384835856173193027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6698411152880148108.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 5405 rows 4410 cols

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2025-05-30 15:56:57] [INFO ] Computed 433 invariants in 233 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality6698411152880148108.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1025/1181 variables, 102/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1181 variables, 1025/1283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1181 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-10b-ReachabilityCardinality-2025-08 is UNSAT
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 3152/4333 variables, 316/1599 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 5471ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 947 transitions
Trivial Post-agglo rules discarded 947 transitions
Performed 947 trivial Post agglomeration. Transition count delta: 947
Iterating post reduction 0 with 947 rules applied. Total rules applied 947 place count 4410 transition count 4458
Reduce places removed 947 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 990 rules applied. Total rules applied 1937 place count 3463 transition count 4415
Reduce places removed 10 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 40 rules applied. Total rules applied 1977 place count 3453 transition count 4385
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2007 place count 3423 transition count 4385
Performed 980 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 980 Pre rules applied. Total rules applied 2007 place count 3423 transition count 3405
Deduced a syphon composed of 980 places in 11 ms
Ensure Unique test removed 88 places
Reduce places removed 1068 places and 0 transitions.
Iterating global reduction 4 with 2048 rules applied. Total rules applied 4055 place count 2355 transition count 3405
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 60 rules applied. Total rules applied 4115 place count 2341 transition count 3359
Reduce places removed 46 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 54 rules applied. Total rules applied 4169 place count 2295 transition count 3351
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4177 place count 2287 transition count 3351
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 4177 place count 2287 transition count 3321
Deduced a syphon composed of 30 places in 11 ms
Ensure Unique test removed 27 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 87 rules applied. Total rules applied 4264 place count 2230 transition count 3321
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 4265 place count 2229 transition count 3321
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 28 Pre rules applied. Total rules applied 4265 place count 2229 transition count 3293
Deduced a syphon composed of 28 places in 46 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 4321 place count 2201 transition count 3293
Discarding 137 places :
Symmetric choice reduction at 8 with 137 rule applications. Total rules 4458 place count 2064 transition count 3156
Iterating global reduction 8 with 137 rules applied. Total rules applied 4595 place count 2064 transition count 3156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4596 place count 2064 transition count 3155
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 41 Pre rules applied. Total rules applied 4596 place count 2064 transition count 3114
Deduced a syphon composed of 41 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 83 rules applied. Total rules applied 4679 place count 2022 transition count 3114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4679 place count 2022 transition count 3113
Deduced a syphon composed of 1 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 4682 place count 2020 transition count 3113
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 4693 place count 2009 transition count 3044
Iterating global reduction 9 with 11 rules applied. Total rules applied 4704 place count 2009 transition count 3044
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 7 Pre rules applied. Total rules applied 4704 place count 2009 transition count 3037
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 4718 place count 2002 transition count 3037
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4719 place count 2001 transition count 3029
Iterating global reduction 9 with 1 rules applied. Total rules applied 4720 place count 2001 transition count 3029
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4721 place count 2000 transition count 3021
Iterating global reduction 9 with 1 rules applied. Total rules applied 4722 place count 2000 transition count 3021
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4723 place count 1999 transition count 3013
Iterating global reduction 9 with 1 rules applied. Total rules applied 4724 place count 1999 transition count 3013
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4725 place count 1998 transition count 3005
Iterating global reduction 9 with 1 rules applied. Total rules applied 4726 place count 1998 transition count 3005
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4727 place count 1997 transition count 2997
Iterating global reduction 9 with 1 rules applied. Total rules applied 4728 place count 1997 transition count 2997
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4729 place count 1996 transition count 2989
Iterating global reduction 9 with 1 rules applied. Total rules applied 4730 place count 1996 transition count 2989
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4731 place count 1995 transition count 2981
Iterating global reduction 9 with 1 rules applied. Total rules applied 4732 place count 1995 transition count 2981
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4733 place count 1994 transition count 2973
Iterating global reduction 9 with 1 rules applied. Total rules applied 4734 place count 1994 transition count 2973
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4735 place count 1993 transition count 2965
Iterating global reduction 9 with 1 rules applied. Total rules applied 4736 place count 1993 transition count 2965
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4737 place count 1992 transition count 2957
Iterating global reduction 9 with 1 rules applied. Total rules applied 4738 place count 1992 transition count 2957
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4739 place count 1991 transition count 2949
Iterating global reduction 9 with 1 rules applied. Total rules applied 4740 place count 1991 transition count 2949
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4741 place count 1990 transition count 2941
Iterating global reduction 9 with 1 rules applied. Total rules applied 4742 place count 1990 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4743 place count 1989 transition count 2933
Iterating global reduction 9 with 1 rules applied. Total rules applied 4744 place count 1989 transition count 2933
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4745 place count 1988 transition count 2925
Iterating global reduction 9 with 1 rules applied. Total rules applied 4746 place count 1988 transition count 2925
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4747 place count 1987 transition count 2917
Iterating global reduction 9 with 1 rules applied. Total rules applied 4748 place count 1987 transition count 2917
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4749 place count 1986 transition count 2909
Iterating global reduction 9 with 1 rules applied. Total rules applied 4750 place count 1986 transition count 2909
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 5 ms
Ensure Unique test removed 5 places
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 9 with 517 rules applied. Total rules applied 5267 place count 1725 transition count 2653
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 5268 place count 1724 transition count 2652
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 5270 place count 1723 transition count 2652
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 5271 place count 1722 transition count 2651
Iterating global reduction 9 with 1 rules applied. Total rules applied 5272 place count 1722 transition count 2651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 5274 place count 1722 transition count 2649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 5275 place count 1721 transition count 2649
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 5277 place count 1720 transition count 2658
Free-agglomeration rule applied 16 times.
Iterating global reduction 11 with 16 rules applied. Total rules applied 5293 place count 1720 transition count 2642
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 5309 place count 1704 transition count 2642
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 12 with 13 rules applied. Total rules applied 5322 place count 1704 transition count 2629
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 5335 place count 1691 transition count 2629
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 5338 place count 1691 transition count 2629
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 5339 place count 1691 transition count 2629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 5340 place count 1690 transition count 2628
Applied a total of 5340 rules in 3752 ms. Remains 1690 /4410 variables (removed 2720) and now considering 2628/5405 (removed 2777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3760 ms. Remains : 1690/4410 places, 2628/5405 transitions.
RANDOM walk for 40000 steps (248 resets) in 722 ms. (55 steps per ms) remains 6/8 properties
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (23 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (25 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (29 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
// Phase 1: matrix 2628 rows 1690 cols
[2025-05-30 15:57:07] [INFO ] Computed 295 invariants in 70 ms
[2025-05-30 15:57:07] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 509/618 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 90/708 variables, 36/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/708 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 942/1650 variables, 208/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1650 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 40/1690 variables, 11/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1690 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2628/4318 variables, 1690/1985 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4318 variables, 63/2048 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4318 variables, 0/2048 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/4318 variables, 0/2048 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :16 after 22
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :22 after 294
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :294 after 394
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :394 after 807
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :807 after 26888
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :26888 after 110044
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :110044 after 906895
No progress, stopping.
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :906895 after 1.46003e+11
After SMT solving in domain Real declared 4318/4318 variables, and 2048 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6438 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 219/219 constraints, State Equation: 1690/1690 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.88427e+11
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :5.88427e+11 after 1.78867e+21
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 509/618 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 90/708 variables, 36/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:15] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/708 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/708 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 942/1650 variables, 208/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:16] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:17] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:17] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :1.78867e+21 after 5.42075e+34
[2025-05-30 15:57:18] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:18] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:18] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:19] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:19] [INFO ] Deduced a trap composed of 10 places in 619 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:20] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:20] [INFO ] Deduced a trap composed of 21 places in 372 ms of which 43 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1650 variables, 10/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1650 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 40/1690 variables, 11/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:22] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 22 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1690 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1690 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property ASLink-PT-10b-ReachabilityCardinality-2025-14 is true.
At refinement iteration 12 (OVERLAPS) 2628/4318 variables, 1690/1997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :5.42075e+34 after 3.40741e+59
At refinement iteration 13 (INCLUDED_ONLY) 0/4318 variables, 63/2060 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4318 variables, 5/2065 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:39] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:47] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:47] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:57:48] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 28 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4318 variables, 4/2069 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4318/4318 variables, and 2069 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 219/219 constraints, State Equation: 1690/1690 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51592ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 109 out of 1690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1690/1690 places, 2628/2628 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1690 transition count 2623
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1685 transition count 2623
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 1685 transition count 2612
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 33 place count 1673 transition count 2612
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 1671 transition count 2611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 1670 transition count 2611
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 44 place count 1666 transition count 2608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 1666 transition count 2606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 1665 transition count 2606
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 50 place count 1665 transition count 2667
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 53 place count 1662 transition count 2667
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 54 place count 1662 transition count 2667
Applied a total of 54 rules in 332 ms. Remains 1662 /1690 variables (removed 28) and now considering 2667/2628 (removed -39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 1662/1690 places, 2667/2628 transitions.
RANDOM walk for 40000 steps (246 resets) in 465 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (27 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (33 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 154311 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 6
Probabilistic random walk after 154311 steps, saw 31727 distinct states, run finished after 3006 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 2667 rows 1662 cols
[2025-05-30 15:58:02] [INFO ] Computed 291 invariants in 33 ms
[2025-05-30 15:58:02] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 497/606 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 77/683 variables, 34/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 942/1625 variables, 204/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1625 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 37/1662 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1662 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2667/4329 variables, 1662/1953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4329 variables, 65/2018 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4329 variables, 0/2018 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/4329 variables, 0/2018 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4329/4329 variables, and 2018 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5781 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 213/213 constraints, State Equation: 1662/1662 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 497/606 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 77/683 variables, 34/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 942/1625 variables, 204/282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:09] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:09] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:09] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:09] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1625 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:10] [INFO ] Deduced a trap composed of 78 places in 483 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:10] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1625 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1625 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 37/1662 variables, 9/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:12] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 37 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1662 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1662 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2667/4329 variables, 1662/1960 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4329 variables, 65/2025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4329 variables, 5/2030 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:44] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:44] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:45] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 23 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4329 variables, 3/2033 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:52] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 19 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4329 variables, 1/2034 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:58:55] [INFO ] Deduced a trap along path composed of 18 places in 82 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4329 variables, 1/2035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4329 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/4329 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4329/4329 variables, and 2035 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53467 ms.
Refiners :[Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 213/213 constraints, State Equation: 1662/1662 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59324ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 39328 ms.
Support contains 109 out of 1662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1662/1662 places, 2667/2667 transitions.
Applied a total of 0 rules in 66 ms. Remains 1662 /1662 variables (removed 0) and now considering 2667/2667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1662/1662 places, 2667/2667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1662/1662 places, 2667/2667 transitions.
Applied a total of 0 rules in 64 ms. Remains 1662 /1662 variables (removed 0) and now considering 2667/2667 (removed 0) transitions.
[2025-05-30 15:59:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:59:42] [INFO ] Implicit Places using invariants in 1346 ms returned [2, 20, 21, 24, 34, 51, 70, 133, 156, 169, 170, 171, 172, 176, 195, 213, 254, 255, 292, 319, 320, 321, 322, 324, 341, 359, 444, 461, 462, 464, 483, 501, 547, 595, 608, 611, 612, 613, 617, 654, 693, 745, 759, 760, 761, 762, 765, 783, 802, 871, 891, 904, 905, 906, 907, 911, 928, 947, 1049, 1050, 1051, 1052, 1054, 1071, 1091, 1134, 1178, 1196, 1197, 1199, 1218, 1236, 1295, 1327, 1340, 1341, 1342, 1343, 1346, 1366, 1385, 1443, 1456, 1457, 1468, 1486, 1497, 1500, 1501, 1524, 1528, 1547, 1548, 1566, 1572, 1578, 1590, 1596, 1602, 1608, 1614, 1620, 1626]
[2025-05-30 15:59:42] [INFO ] Actually due to overlaps returned [1596, 1614, 1626, 1566, 1572, 1602, 1620, 34, 51, 176, 195, 324, 341, 464, 483, 617, 765, 783, 911, 928, 1054, 1071, 1218, 1346, 1366, 1528, 1199, 170, 171, 320, 321, 461, 611, 612, 760, 761, 905, 906, 1050, 1051, 1196, 1341, 1342, 1500, 172, 322, 462, 613, 762, 907, 1052, 1197, 1343, 1501, 1524, 1547, 2, 20, 444, 595, 745, 891, 1178, 1327, 70, 169, 213, 319, 359, 501, 608, 654, 759, 802, 904, 947, 1049, 1091, 1236, 1340, 1385, 1497, 1548, 21, 24, 156, 292, 1134, 1295, 1486, 1578, 1590, 1608]
Discarding 93 places :
Implicit Place search using SMT only with invariants took 1360 ms to find 93 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1569/1662 places, 2667/2667 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1564 transition count 2533
Reduce places removed 134 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 152 rules applied. Total rules applied 291 place count 1430 transition count 2515
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 309 place count 1412 transition count 2515
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 309 place count 1412 transition count 2455
Deduced a syphon composed of 60 places in 13 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 429 place count 1352 transition count 2455
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 27 rules applied. Total rules applied 456 place count 1337 transition count 2443
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 469 place count 1325 transition count 2442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 470 place count 1324 transition count 2442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 470 place count 1324 transition count 2441
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 472 place count 1323 transition count 2441
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 484 place count 1311 transition count 2397
Iterating global reduction 6 with 12 rules applied. Total rules applied 496 place count 1311 transition count 2397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 496 place count 1311 transition count 2396
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 498 place count 1310 transition count 2396
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 501 place count 1307 transition count 2393
Iterating global reduction 6 with 3 rules applied. Total rules applied 504 place count 1307 transition count 2393
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 507 place count 1304 transition count 2387
Iterating global reduction 6 with 3 rules applied. Total rules applied 510 place count 1304 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 511 place count 1303 transition count 2386
Iterating global reduction 6 with 1 rules applied. Total rules applied 512 place count 1303 transition count 2386
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 513 place count 1302 transition count 2385
Iterating global reduction 6 with 1 rules applied. Total rules applied 514 place count 1302 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 515 place count 1301 transition count 2383
Iterating global reduction 6 with 1 rules applied. Total rules applied 516 place count 1301 transition count 2383
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 4 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 664 place count 1227 transition count 2309
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 669 place count 1222 transition count 2304
Iterating global reduction 6 with 5 rules applied. Total rules applied 674 place count 1222 transition count 2304
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 679 place count 1222 transition count 2299
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 686 place count 1222 transition count 2292
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 696 place count 1215 transition count 2289
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 8 with 33 rules applied. Total rules applied 729 place count 1215 transition count 2256
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 762 place count 1182 transition count 2256
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 764 place count 1182 transition count 2254
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 783 place count 1182 transition count 2254
Partial Post-agglomeration rule applied 21 times.
Drop transitions (Partial Post agglomeration) removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 804 place count 1182 transition count 2254
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 806 place count 1180 transition count 2248
Iterating global reduction 9 with 2 rules applied. Total rules applied 808 place count 1180 transition count 2248
Applied a total of 808 rules in 751 ms. Remains 1180 /1569 variables (removed 389) and now considering 2248/2667 (removed 419) transitions.
// Phase 1: matrix 2248 rows 1180 cols
[2025-05-30 15:59:43] [INFO ] Computed 178 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:59:44] [INFO ] Implicit Places using invariants in 879 ms returned [76, 93, 104, 107, 172, 184, 185, 194, 200, 203, 211, 217, 218, 291, 297, 300, 303, 311, 318, 319, 379, 395, 413, 416, 418, 420, 425, 426, 487, 513, 521, 529, 531, 537, 538, 596, 615, 626, 628, 629, 714, 723, 726, 729, 740, 741, 821, 827, 832, 840, 848, 849, 938, 944, 946, 1044, 1045, 1048, 1060, 1154]
[2025-05-30 15:59:44] [INFO ] Actually due to overlaps returned [420, 629, 946, 531, 217, 740, 741, 218, 211, 93, 107, 194, 200, 291, 297, 303, 413, 418, 615, 628, 729, 1044, 76, 172, 184, 203, 311, 379, 395, 487, 513, 521, 529, 596, 714, 723, 821, 827, 832, 840, 938, 944, 1048, 1060, 1154]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 881 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1135/1662 places, 2248/2667 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1135 transition count 2247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1134 transition count 2247
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 19 place count 1117 transition count 2230
Iterating global reduction 2 with 17 rules applied. Total rules applied 36 place count 1117 transition count 2230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 1115 transition count 2228
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1115 transition count 2228
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 68 place count 1101 transition count 2214
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1101 transition count 2213
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 1101 transition count 2193
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 109 place count 1081 transition count 2193
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 1081 transition count 2188
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 119 place count 1076 transition count 2188
Applied a total of 119 rules in 274 ms. Remains 1076 /1135 variables (removed 59) and now considering 2188/2248 (removed 60) transitions.
// Phase 1: matrix 2188 rows 1076 cols
[2025-05-30 15:59:44] [INFO ] Computed 133 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:59:45] [INFO ] Implicit Places using invariants in 690 ms returned [172, 282, 283, 377, 378, 476, 477, 755, 756, 944]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 692 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1066/1662 places, 2188/2667 transitions.
Applied a total of 0 rules in 41 ms. Remains 1066 /1066 variables (removed 0) and now considering 2188/2188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 4063 ms. Remains : 1066/1662 places, 2188/2667 transitions.
RANDOM walk for 40000 steps (345 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (57 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 193934 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 6
Probabilistic random walk after 193934 steps, saw 45593 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 2188 rows 1066 cols
[2025-05-30 15:59:48] [INFO ] Computed 123 invariants in 18 ms
[2025-05-30 15:59:48] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 122/231 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/250 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 814/1064 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/1066 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2188/3254 variables, 1066/1189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3254 variables, 13/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3254 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3254 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3254/3254 variables, and 1202 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2747 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 1066/1066 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 122/231 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/250 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 814/1064 variables, 99/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:52] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:52] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:52] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:52] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:52] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:53] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:53] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:59:53] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1064 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/1066 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2188/3254 variables, 1066/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3254 variables, 13/1211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3254 variables, 5/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:01:01] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:01:01] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:01:04] [INFO ] Deduced a trap composed of 34 places in 344 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3254/3254 variables, and 1219 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90020 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 1066/1066 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92812ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 109 out of 1066 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1066/1066 places, 2188/2188 transitions.
Applied a total of 0 rules in 48 ms. Remains 1066 /1066 variables (removed 0) and now considering 2188/2188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1066/1066 places, 2188/2188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1066/1066 places, 2188/2188 transitions.
Applied a total of 0 rules in 37 ms. Remains 1066 /1066 variables (removed 0) and now considering 2188/2188 (removed 0) transitions.
[2025-05-30 16:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:01:22] [INFO ] Implicit Places using invariants in 685 ms returned []
[2025-05-30 16:01:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 16:01:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-05-30 16:01:25] [INFO ] Implicit Places using invariants and state equation in 3040 ms returned []
Implicit Place search using SMT with State Equation took 3727 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 16:01:25] [INFO ] Redundant transitions in 162 ms returned []
Running 2177 sub problems to find dead transitions.
[2025-05-30 16:01:25] [INFO ] Invariant cache hit.
[2025-05-30 16:01:25] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 2177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/3254 variables, and 70 constraints, problems are : Problem set: 0 solved, 2177 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/23 constraints, Generalized P Invariants (flows): 70/100 constraints, State Equation: 0/1066 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 2177/2177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 2177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/3254 variables, and 70 constraints, problems are : Problem set: 0 solved, 2177 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/23 constraints, Generalized P Invariants (flows): 70/100 constraints, State Equation: 0/1066 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/2177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60977ms problems are : Problem set: 0 solved, 2177 unsolved
Search for dead transitions found 0 dead transitions in 60986ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64930 ms. Remains : 1066/1066 places, 2188/2188 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 5358 edges and 1066 vertex of which 1065 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 1065 transition count 2180
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 1057 transition count 2180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 1056 transition count 2179
Applied a total of 19 rules in 83 ms. Remains 1056 /1066 variables (removed 10) and now considering 2179/2188 (removed 9) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2179 rows 1056 cols
[2025-05-30 16:02:26] [INFO ] Computed 122 invariants in 30 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 16:02:26] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 16:02:26] [INFO ] [Nat]Absence check using 24 positive place invariants in 9 ms returned sat
[2025-05-30 16:02:26] [INFO ] [Nat]Absence check using 24 positive and 98 generalized place invariants in 52 ms returned sat
[2025-05-30 16:02:34] [INFO ] After 7724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-05-30 16:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 16:02:36] [INFO ] After 1957ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:37] [INFO ] Deduced a trap composed of 20 places in 350 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:37] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:38] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:38] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:39] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:39] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:39] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:40] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 34 ms to minimize.
[2025-05-30 16:02:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3036 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:47] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 10 ms to minimize.
[2025-05-30 16:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:47] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:47] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 20 ms to minimize.
[2025-05-30 16:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:02:48] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 37 ms to minimize.
[2025-05-30 16:02:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:03:04] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 16:03:04] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 17 ms to minimize.
[2025-05-30 16:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 591 ms
TRAPS : Iteration 2
[2025-05-30 16:03:13] [INFO ] After 38520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-05-30 16:03:16] [INFO ] After 49892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 50250 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 16:03:16] [INFO ] Flatten gal took : 166 ms
[2025-05-30 16:03:16] [INFO ] Applying decomposition
[2025-05-30 16:03:16] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3527020880045901496.txt' '-o' '/tmp/graph3527020880045901496.bin' '-w' '/tmp/graph3527020880045901496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3527020880045901496.bin' '-l' '-1' '-v' '-w' '/tmp/graph3527020880045901496.weights' '-q' '0' '-e' '0.001'
[2025-05-30 16:03:17] [INFO ] Decomposing Gal with order
[2025-05-30 16:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 16:03:18] [INFO ] Removed a total of 3806 redundant transitions.
[2025-05-30 16:03:18] [INFO ] Flatten gal took : 335 ms
[2025-05-30 16:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 51 ms.
[2025-05-30 16:03:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14654597490488152873.gal : 44 ms
[2025-05-30 16:03:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7918899607254958173.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14654597490488152873.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7918899607254958173.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7918899607254958173.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1 after 1.14511e+08
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.14511e+08 after 1.5109e+14
Detected timeout of ITS tools.
[2025-05-30 16:33:19] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1970065259636302490
[2025-05-30 16:33:19] [INFO ] Too many transitions (2188) to apply POR reductions. Disabling POR matrices.
[2025-05-30 16:33:19] [INFO ] Applying decomposition
[2025-05-30 16:33:19] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1970065259636302490
Running compilation step : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 16:33:19] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13927352765012086717.txt' '-o' '/tmp/graph13927352765012086717.bin' '-w' '/tmp/graph13927352765012086717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13927352765012086717.bin' '-l' '-1' '-v' '-w' '/tmp/graph13927352765012086717.weights' '-q' '0' '-e' '0.001'
[2025-05-30 16:33:19] [INFO ] Decomposing Gal with order
[2025-05-30 16:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 16:33:19] [INFO ] Removed a total of 3786 redundant transitions.
[2025-05-30 16:33:19] [INFO ] Flatten gal took : 111 ms
[2025-05-30 16:33:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 45 ms.
[2025-05-30 16:33:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1961158378171543578.gal : 15 ms
[2025-05-30 16:33:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6059830068640668411.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1961158378171543578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6059830068640668411.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6059830068640668411.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1548
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1548 after 37512
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :37512 after 5.45561e+10
Compilation finished in 4690 ms.
Running link step : cd /tmp/ltsmin1970065259636302490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202500==true'
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :3.73214e+15 after 3.77574e+15
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3.77574e+15 after 4.96729e+15
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :4.96729e+15 after 5.76588e+15
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5.76588e+15 after 6.79264e+15
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :6.79264e+15 after 9.63702e+15
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :9.63702e+15 after 2.41237e+16
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.41237e+16 after 3.36104e+17
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202501==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202501==true'
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202503==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202407==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202407==true'
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202511==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202511==true'
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202513==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202513==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin1970065259636302490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityCardinality202500==true'

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
+ [[ 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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ASLink-PT-10b"
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-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10b, 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 r002-tall-174853729300438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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