Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200403.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-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K 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 55K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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.2M 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-08b-LTLCardinality-00
FORMULA_NAME ASLink-PT-08b-LTLCardinality-01
FORMULA_NAME ASLink-PT-08b-LTLCardinality-02
FORMULA_NAME ASLink-PT-08b-LTLCardinality-03
FORMULA_NAME ASLink-PT-08b-LTLCardinality-04
FORMULA_NAME ASLink-PT-08b-LTLCardinality-05
FORMULA_NAME ASLink-PT-08b-LTLCardinality-06
FORMULA_NAME ASLink-PT-08b-LTLCardinality-07
FORMULA_NAME ASLink-PT-08b-LTLCardinality-08
FORMULA_NAME ASLink-PT-08b-LTLCardinality-09
FORMULA_NAME ASLink-PT-08b-LTLCardinality-10
FORMULA_NAME ASLink-PT-08b-LTLCardinality-11
FORMULA_NAME ASLink-PT-08b-LTLCardinality-12
FORMULA_NAME ASLink-PT-08b-LTLCardinality-13
FORMULA_NAME ASLink-PT-08b-LTLCardinality-14
FORMULA_NAME ASLink-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748604801067

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 11:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:33:22] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2025-05-30 11:33:22] [INFO ] Transformed 3618 places.
[2025-05-30 11:33:22] [INFO ] Transformed 4459 transitions.
[2025-05-30 11:33:22] [INFO ] Found NUPN structural information;
[2025-05-30 11:33:22] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ASLink-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 3618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 225 place count 3393 transition count 4234
Iterating global reduction 0 with 225 rules applied. Total rules applied 450 place count 3393 transition count 4234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 451 place count 3393 transition count 4233
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 539 place count 3305 transition count 4097
Iterating global reduction 1 with 88 rules applied. Total rules applied 627 place count 3305 transition count 4097
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 654 place count 3305 transition count 4070
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 666 place count 3293 transition count 4058
Iterating global reduction 2 with 12 rules applied. Total rules applied 678 place count 3293 transition count 4058
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 682 place count 3289 transition count 4047
Iterating global reduction 2 with 4 rules applied. Total rules applied 686 place count 3289 transition count 4047
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 689 place count 3286 transition count 4044
Iterating global reduction 2 with 3 rules applied. Total rules applied 692 place count 3286 transition count 4044
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 695 place count 3283 transition count 4034
Iterating global reduction 2 with 3 rules applied. Total rules applied 698 place count 3283 transition count 4034
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 699 place count 3282 transition count 4026
Iterating global reduction 2 with 1 rules applied. Total rules applied 700 place count 3282 transition count 4026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 701 place count 3281 transition count 4025
Iterating global reduction 2 with 1 rules applied. Total rules applied 702 place count 3281 transition count 4025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 703 place count 3280 transition count 4017
Iterating global reduction 2 with 1 rules applied. Total rules applied 704 place count 3280 transition count 4017
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 705 place count 3279 transition count 4009
Iterating global reduction 2 with 1 rules applied. Total rules applied 706 place count 3279 transition count 4009
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 707 place count 3278 transition count 4008
Iterating global reduction 2 with 1 rules applied. Total rules applied 708 place count 3278 transition count 4008
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 709 place count 3277 transition count 4000
Iterating global reduction 2 with 1 rules applied. Total rules applied 710 place count 3277 transition count 4000
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 711 place count 3276 transition count 3992
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 3276 transition count 3992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 713 place count 3275 transition count 3991
Iterating global reduction 2 with 1 rules applied. Total rules applied 714 place count 3275 transition count 3991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 715 place count 3274 transition count 3983
Iterating global reduction 2 with 1 rules applied. Total rules applied 716 place count 3274 transition count 3983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 717 place count 3273 transition count 3975
Iterating global reduction 2 with 1 rules applied. Total rules applied 718 place count 3273 transition count 3975
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 719 place count 3272 transition count 3974
Iterating global reduction 2 with 1 rules applied. Total rules applied 720 place count 3272 transition count 3974
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 721 place count 3271 transition count 3966
Iterating global reduction 2 with 1 rules applied. Total rules applied 722 place count 3271 transition count 3966
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 723 place count 3270 transition count 3958
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 3270 transition count 3958
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 725 place count 3269 transition count 3957
Iterating global reduction 2 with 1 rules applied. Total rules applied 726 place count 3269 transition count 3957
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 727 place count 3268 transition count 3949
Iterating global reduction 2 with 1 rules applied. Total rules applied 728 place count 3268 transition count 3949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 729 place count 3267 transition count 3941
Iterating global reduction 2 with 1 rules applied. Total rules applied 730 place count 3267 transition count 3941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 731 place count 3266 transition count 3940
Iterating global reduction 2 with 1 rules applied. Total rules applied 732 place count 3266 transition count 3940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 733 place count 3265 transition count 3932
Iterating global reduction 2 with 1 rules applied. Total rules applied 734 place count 3265 transition count 3932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 735 place count 3264 transition count 3924
Iterating global reduction 2 with 1 rules applied. Total rules applied 736 place count 3264 transition count 3924
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 737 place count 3263 transition count 3923
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 3263 transition count 3923
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 739 place count 3262 transition count 3915
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 3262 transition count 3915
Applied a total of 740 rules in 7090 ms. Remains 3262 /3618 variables (removed 356) and now considering 3915/4459 (removed 544) transitions.
// Phase 1: matrix 3915 rows 3262 cols
[2025-05-30 11:33:30] [INFO ] Computed 355 invariants in 150 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:33:32] [INFO ] Implicit Places using invariants in 2407 ms returned [3096, 3107, 3118, 3126, 3134, 3142, 3150, 3161, 3169, 3177, 3188]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2458 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3251/3618 places, 3915/4459 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3238 transition count 3902
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3238 transition count 3902
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3227 transition count 3891
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3227 transition count 3891
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3218 transition count 3882
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3218 transition count 3882
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3214 transition count 3878
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3214 transition count 3878
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3212 transition count 3876
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3212 transition count 3876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3210 transition count 3874
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3210 transition count 3874
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3208 transition count 3872
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3208 transition count 3872
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3206 transition count 3870
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3206 transition count 3870
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3205 transition count 3869
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3205 transition count 3869
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3204 transition count 3868
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3204 transition count 3868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3203 transition count 3867
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3203 transition count 3867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3202 transition count 3866
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3202 transition count 3866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3201 transition count 3865
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3201 transition count 3865
Applied a total of 100 rules in 3177 ms. Remains 3201 /3251 variables (removed 50) and now considering 3865/3915 (removed 50) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2025-05-30 11:33:35] [INFO ] Computed 344 invariants in 68 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:33:37] [INFO ] Implicit Places using invariants in 1883 ms returned []
[2025-05-30 11:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:02] [INFO ] Implicit Places using invariants and state equation in 24928 ms returned []
Implicit Place search using SMT with State Equation took 26819 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3201/3618 places, 3865/4459 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39561 ms. Remains : 3201/3618 places, 3865/4459 transitions.
Support contains 12 out of 3201 places after structural reductions.
[2025-05-30 11:34:02] [INFO ] Flatten gal took : 253 ms
[2025-05-30 11:34:03] [INFO ] Flatten gal took : 161 ms
[2025-05-30 11:34:03] [INFO ] Input system was already deterministic with 3865 transitions.
RANDOM walk for 40000 steps (60 resets) in 1226 ms. (32 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2025-05-30 11:34:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/181 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 750/931 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2268/3199 variables, 260/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:05] [INFO ] Deduced a trap composed of 22 places in 483 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:05] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:05] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:06] [INFO ] Deduced a trap composed of 86 places in 248 ms of which 35 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3199 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3199 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3201 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3201 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7066/7066 variables, and 3549 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 263/263 constraints, State Equation: 3201/3201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/181 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 750/931 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/931 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2268/3199 variables, 260/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3199 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:10] [INFO ] Deduced a trap composed of 48 places in 658 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:10] [INFO ] Deduced a trap composed of 49 places in 678 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:11] [INFO ] Deduced a trap composed of 78 places in 345 ms of which 50 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3199 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3199 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3201 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3201 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7066/7066 variables, and 3552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 263/263 constraints, State Equation: 3201/3201 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10103ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 3201 transition count 3268
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 600 rules applied. Total rules applied 1197 place count 2604 transition count 3265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1199 place count 2602 transition count 3265
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 866 Pre rules applied. Total rules applied 1199 place count 2602 transition count 2399
Deduced a syphon composed of 866 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 950 places and 0 transitions.
Iterating global reduction 3 with 1816 rules applied. Total rules applied 3015 place count 1652 transition count 2399
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 59 rules applied. Total rules applied 3074 place count 1645 transition count 2347
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3126 place count 1593 transition count 2347
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3126 place count 1593 transition count 2314
Deduced a syphon composed of 33 places in 6 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3225 place count 1527 transition count 2314
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3225 place count 1527 transition count 2282
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3289 place count 1495 transition count 2282
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Deduced a syphon composed of 255 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 5 with 512 rules applied. Total rules applied 3801 place count 1238 transition count 2027
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3805 place count 1234 transition count 2023
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3810 place count 1233 transition count 2023
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 5 with 1 rules applied. Total rules applied 3811 place count 1233 transition count 2022
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3812 place count 1232 transition count 2022
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3812 place count 1232 transition count 2021
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3814 place count 1231 transition count 2021
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3816 place count 1229 transition count 2019
Iterating global reduction 7 with 2 rules applied. Total rules applied 3818 place count 1229 transition count 2019
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 7 with 2 rules applied. Total rules applied 3820 place count 1229 transition count 2017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3821 place count 1228 transition count 2017
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3823 place count 1227 transition count 2022
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 3832 place count 1227 transition count 2013
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 3841 place count 1218 transition count 2013
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3847 place count 1218 transition count 2007
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3853 place count 1212 transition count 2007
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 3861 place count 1212 transition count 2007
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3862 place count 1211 transition count 2006
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 11 with 24 rules applied. Total rules applied 3886 place count 1195 transition count 1998
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3894 place count 1187 transition count 1998
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 24 Pre rules applied. Total rules applied 3894 place count 1187 transition count 1974
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 13 with 49 rules applied. Total rules applied 3943 place count 1162 transition count 1974
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 13 with 9 rules applied. Total rules applied 3952 place count 1153 transition count 1974
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3952 place count 1153 transition count 1973
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3954 place count 1152 transition count 1973
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 3988 place count 1135 transition count 1956
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 3996 place count 1127 transition count 1948
Iterating global reduction 14 with 8 rules applied. Total rules applied 4004 place count 1127 transition count 1948
Free-agglomeration rule applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 4012 place count 1127 transition count 1940
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 4020 place count 1119 transition count 1940
Applied a total of 4020 rules in 1059 ms. Remains 1119 /3201 variables (removed 2082) and now considering 1940/3865 (removed 1925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1059 ms. Remains : 1119/3201 places, 1940/3865 transitions.
RANDOM walk for 40000 steps (424 resets) in 351 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245825 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245825 steps, saw 52932 distinct states, run finished after 3005 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 1940 rows 1119 cols
[2025-05-30 11:34:18] [INFO ] Computed 191 invariants in 28 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/61 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/82 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 123/207 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/249 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/252 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 130/382 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/408 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/410 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 95/505 variables, 15/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 26/531 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/531 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/533 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/533 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 95/628 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/628 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 26/654 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/654 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/656 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/656 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 95/751 variables, 15/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/751 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 26/777 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/777 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/779 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/779 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 95/874 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/874 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 26/900 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/900 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/902 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/902 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 107/1009 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1009 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 40/1049 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1049 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 5/1054 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1054 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 65/1119 variables, 15/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1119 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1940/3059 variables, 1119/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 54 (INCLUDED_ONLY) 0/3059 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/3059 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3059/3059 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 1119/1119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/61 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/82 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 123/207 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/249 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/252 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 130/382 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/408 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/410 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 95/505 variables, 15/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 26/531 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/531 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/533 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/533 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 95/628 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/628 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 26/654 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/654 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/656 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/656 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 95/751 variables, 15/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/751 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 26/777 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/777 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/779 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/779 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 95/874 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/874 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 26/900 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/900 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/902 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/902 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 107/1009 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1009 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 40/1049 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1049 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 5/1054 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1054 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 65/1119 variables, 15/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1119 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1940/3059 variables, 1119/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/3059 variables, 1/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3059 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/3059 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3059/3059 variables, and 1311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 1119/1119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3754ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 401 ms.
Support contains 2 out of 1119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1119/1119 places, 1940/1940 transitions.
Applied a total of 0 rules in 45 ms. Remains 1119 /1119 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1119/1119 places, 1940/1940 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1119/1119 places, 1940/1940 transitions.
Applied a total of 0 rules in 45 ms. Remains 1119 /1119 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2025-05-30 11:34:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:23] [INFO ] Implicit Places using invariants in 834 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 152, 153, 155, 172, 190, 260, 264, 265, 276, 277, 279, 296, 314, 383, 387, 388, 399, 400, 402, 419, 437, 506, 510, 511, 522, 523, 525, 542, 560, 629, 633, 634, 645, 646, 648, 665, 683, 752, 756, 757, 768, 769, 771, 788, 806, 875, 879, 880, 891, 892, 894, 911, 929, 998, 1002, 1003, 1006, 1017, 1018, 1019, 1037, 1058, 1059, 1060, 1061]
[2025-05-30 11:34:23] [INFO ] Actually due to overlaps returned [1037, 1019, 48, 172, 296, 419, 542, 665, 788, 911, 31, 155, 279, 402, 525, 648, 771, 894, 152, 276, 399, 522, 645, 768, 891, 1017, 1058, 153, 277, 400, 523, 646, 769, 892, 1018, 1059, 1, 18, 264, 265, 387, 388, 510, 511, 633, 634, 756, 757, 879, 880, 1002, 1003, 66, 190, 314, 437, 560, 683, 806, 929, 1060, 19, 139, 1006, 1061]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 837 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1054/1119 places, 1940/1940 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1046 transition count 1800
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 906 transition count 1791
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 905 transition count 1791
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 298 place count 905 transition count 1752
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 377 place count 865 transition count 1752
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 389 place count 861 transition count 1744
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 397 place count 853 transition count 1744
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 400 place count 850 transition count 1741
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 850 transition count 1741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 406 place count 850 transition count 1738
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 516 place count 795 transition count 1683
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 524 place count 787 transition count 1675
Iterating global reduction 6 with 8 rules applied. Total rules applied 532 place count 787 transition count 1675
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 540 place count 787 transition count 1667
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 544 place count 785 transition count 1668
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 561 place count 785 transition count 1651
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 579 place count 767 transition count 1651
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 603 place count 767 transition count 1651
Applied a total of 603 rules in 274 ms. Remains 767 /1054 variables (removed 287) and now considering 1651/1940 (removed 289) transitions.
// Phase 1: matrix 1651 rows 767 cols
[2025-05-30 11:34:23] [INFO ] Computed 112 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:24] [INFO ] Implicit Places using invariants in 601 ms returned [73, 89, 95, 98, 100, 104, 105, 106, 159, 176, 182, 185, 187, 192, 193, 246, 262, 268, 271, 273, 278, 279, 332, 348, 354, 357, 359, 364, 365, 418, 434, 440, 443, 445, 450, 451, 504, 520, 526, 529, 531, 536, 537, 590, 606, 612, 615, 617, 622, 623, 676, 692, 698, 701, 703]
[2025-05-30 11:34:24] [INFO ] Actually due to overlaps returned [105, 192, 278, 364, 450, 536, 622, 106, 193, 279, 365, 451, 537, 623, 89, 95, 100, 176, 182, 187, 262, 268, 273, 348, 354, 359, 434, 440, 445, 520, 526, 531, 606, 612, 617, 692, 698, 703, 73, 104, 159, 246, 332, 418, 504, 590, 676]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 604 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 720/1119 places, 1651/1940 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 688 transition count 1619
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 688 transition count 1619
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 681 transition count 1612
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 681 transition count 1612
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 110 place count 665 transition count 1596
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 134 place count 665 transition count 1572
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 158 place count 641 transition count 1572
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 166 place count 641 transition count 1564
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 174 place count 633 transition count 1564
Applied a total of 174 rules in 150 ms. Remains 633 /720 variables (removed 87) and now considering 1564/1651 (removed 87) transitions.
// Phase 1: matrix 1564 rows 633 cols
[2025-05-30 11:34:24] [INFO ] Computed 65 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:24] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-05-30 11:34:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:26] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 633/1119 places, 1564/1940 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3795 ms. Remains : 633/1119 places, 1564/1940 transitions.
RANDOM walk for 40000 steps (659 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (110 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 378745 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 378745 steps, saw 85234 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-05-30 11:34:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/169 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 141/310 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/312 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/446 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/450 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 100/550 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2197/2197 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/169 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 141/310 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/312 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/446 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/450 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 100/550 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2197 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2197 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2197 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2197/2197 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1910ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 23 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 633/633 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 23 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2025-05-30 11:34:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:32] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-05-30 11:34:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:33] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:34:33] [INFO ] Redundant transitions in 107 ms returned []
Running 1523 sub problems to find dead transitions.
[2025-05-30 11:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2197 variables, and 61 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 1523/1523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/2197 variables, and 61 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 0/1523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60701ms problems are : Problem set: 0 solved, 1523 unsolved
Search for dead transitions found 0 dead transitions in 60714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62769 ms. Remains : 633/633 places, 1564/1564 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 25 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 11:35:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 11:35:34] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-30 11:35:34] [INFO ] [Real]Absence check using 13 positive and 52 generalized place invariants in 21 ms returned sat
[2025-05-30 11:35:35] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 11:35:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-30 11:35:35] [INFO ] [Nat]Absence check using 13 positive and 52 generalized place invariants in 21 ms returned sat
[2025-05-30 11:35:35] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:35:35] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
[2025-05-30 11:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
TRAPS : Iteration 1
[2025-05-30 11:35:35] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 11:35:35] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1668 ms.
Computed a total of 131 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0||G(p1)))))))'
Support contains 4 out of 3201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Applied a total of 0 rules in 201 ms. Remains 3201 /3201 variables (removed 0) and now considering 3865/3865 (removed 0) transitions.
// Phase 1: matrix 3865 rows 3201 cols
[2025-05-30 11:35:36] [INFO ] Computed 344 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:35:38] [INFO ] Implicit Places using invariants in 2066 ms returned []
[2025-05-30 11:35:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:35:57] [INFO ] Implicit Places using invariants and state equation in 18658 ms returned []
Implicit Place search using SMT with State Equation took 20728 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2025-05-30 11:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 13)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 7)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 1)
(s50 3)
(s51 1)
(s52 1)
(s53 6)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 34)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 0)
(s96 1)
(s97 1)
(s98 1)
(s99 0)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 1)
(s111 1)
(s112 0)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 6)
(s123 0)
(s124 0)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 5)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 1)
(s276 0)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 0)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 0)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 0)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 0)
(s355 1)
(s356 1)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 4)
(s365 1)
(s366 0)
(s367 1)
(s368 1)
(s369 0)
(s370 0)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 23)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 29)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 29)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 26)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 3)
(s417 1)
(s418 93)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 6)
(s454 0)
(s455 1)
(s456 1)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 1)
(s462 0)
(s463 0)
(s464 1)
(s465 1)
(s466 0)
(s467 0)
(s468 1)
(s469 1)
(s470 0)
(s471 0)
(s472 1)
(s473 1)
(s474 0)
(s475 0)
(s476 1)
(s477 1)
(s478 0)
(s479 1)
(s480 1)
(s481 1)
(s482 0)
(s483 0)
(s484 5)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 23)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 0)
(s613 0)
(s614 1)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 1)
(s620 1)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 1)
(s626 0)
(s627 1)
(s628 0)
(s629 1)
(s630 1)
(s631 0)
(s632 0)
(s633 1)
(s634 1)
(s635 0)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 0)
(s646 1)
(s647 1)
(s648 1)
(s649 0)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 0)
(s655 0)
(s656 1)
(s657 0)
(s658 0)
(s659 1)
(s660 0)
(s661 1)
(s662 1)
(s663 0)
(s664 1)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 1)
(s670 1)
(s671 0)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 0)
(s681 1)
(s682 1)
(s683 1)
(s684 0)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 0)
(s691 0)
(s692 1)
(s693 1)
(s694 0)
(s695 0)
(s696 0)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 0)
(s715 1)
(s716 1)
(s717 1)
(s718 0)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 4)
(s724 0)
(s725 0)
(s726 1)
(s727 1)
(s728 0)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 25)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 25)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 22)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 4)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 93)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 0)
(s850 1)
(s851 0)
(s852 0)
(s853 1)
(s854 0)
(s855 0)
(s856 1)
(s857 0)
(s858 0)
(s859 1)
(s860 0)
(s861 1)
(s862 1)
(s863 1)
(s864 0)
(s865 1)
(s866 1)
(s867 0)
(s868 1)
(s869 1)
(s870 0)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61672ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61686ms
Finished structural reductions in LTL mode , in 1 iterations and 82636 ms. Remains : 3201/3201 places, 3865/3865 transitions.
Stuttering acceptance computed with spot in 436 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-04 finished in 83153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 3201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Applied a total of 0 rules in 219 ms. Remains 3201 /3201 variables (removed 0) and now considering 3865/3865 (removed 0) transitions.
[2025-05-30 11:36:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:37:01] [INFO ] Implicit Places using invariants in 1908 ms returned []
[2025-05-30 11:37:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:37:18] [INFO ] Implicit Places using invariants and state equation in 17042 ms returned []
Implicit Place search using SMT with State Equation took 18958 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2025-05-30 11:37:18] [INFO ] Invariant cache hit.
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/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61824ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61837ms
Finished structural reductions in LTL mode , in 1 iterations and 81032 ms. Remains : 3201/3201 places, 3865/3865 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 196 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-08b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-08 finished in 81223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Applied a total of 0 rules in 208 ms. Remains 3201 /3201 variables (removed 0) and now considering 3865/3865 (removed 0) transitions.
[2025-05-30 11:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:38:22] [INFO ] Implicit Places using invariants in 1863 ms returned []
[2025-05-30 11:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:38:39] [INFO ] Implicit Places using invariants and state equation in 16554 ms returned []
Implicit Place search using SMT with State Equation took 18419 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2025-05-30 11:38:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 13)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 196 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 196/263 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61705ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61717ms
Finished structural reductions in LTL mode , in 1 iterations and 80360 ms. Remains : 3201/3201 places, 3865/3865 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 12289 steps with 16 reset in 86 ms.
FORMULA ASLink-PT-08b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-09 finished in 80587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3201/3201 places, 3865/3865 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 3200 transition count 3267
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 600 rules applied. Total rules applied 1197 place count 2603 transition count 3264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1199 place count 2601 transition count 3264
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 866 Pre rules applied. Total rules applied 1199 place count 2601 transition count 2398
Deduced a syphon composed of 866 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 950 places and 0 transitions.
Iterating global reduction 3 with 1816 rules applied. Total rules applied 3015 place count 1651 transition count 2398
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 59 rules applied. Total rules applied 3074 place count 1644 transition count 2346
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3126 place count 1592 transition count 2346
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3126 place count 1592 transition count 2313
Deduced a syphon composed of 33 places in 6 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3225 place count 1526 transition count 2313
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3225 place count 1526 transition count 2281
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3289 place count 1494 transition count 2281
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 253
Deduced a syphon composed of 253 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 5 with 508 rules applied. Total rules applied 3797 place count 1239 transition count 2028
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3801 place count 1235 transition count 2024
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3806 place count 1234 transition count 2024
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 5 with 1 rules applied. Total rules applied 3807 place count 1234 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3808 place count 1233 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3808 place count 1233 transition count 2022
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3810 place count 1232 transition count 2022
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3812 place count 1230 transition count 2020
Iterating global reduction 7 with 2 rules applied. Total rules applied 3814 place count 1230 transition count 2020
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 7 with 2 rules applied. Total rules applied 3816 place count 1230 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3817 place count 1229 transition count 2018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3819 place count 1228 transition count 2023
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3821 place count 1226 transition count 2021
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 24 rules applied. Total rules applied 3845 place count 1210 transition count 2013
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3853 place count 1202 transition count 2013
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3853 place count 1202 transition count 1989
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3902 place count 1177 transition count 1989
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3919 place count 1160 transition count 1989
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3919 place count 1160 transition count 1988
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3921 place count 1159 transition count 1988
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 44 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 3971 place count 1134 transition count 1963
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 3987 place count 1118 transition count 1947
Iterating global reduction 12 with 16 rules applied. Total rules applied 4003 place count 1118 transition count 1947
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4011 place count 1110 transition count 1939
Iterating global reduction 12 with 8 rules applied. Total rules applied 4019 place count 1110 transition count 1939
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4027 place count 1110 transition count 1931
Applied a total of 4027 rules in 844 ms. Remains 1110 /3201 variables (removed 2091) and now considering 1931/3865 (removed 1934) transitions.
// Phase 1: matrix 1931 rows 1110 cols
[2025-05-30 11:39:41] [INFO ] Computed 183 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:42] [INFO ] Implicit Places using invariants in 831 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 150, 151, 153, 170, 188, 208, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 749, 761, 762, 764, 781, 799, 819, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 996, 1007, 1008, 1009, 1027, 1048, 1049, 1050, 1051]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 833 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1037/3201 places, 1931/3865 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 1037 transition count 1800
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 906 transition count 1799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 905 transition count 1799
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 264 place count 905 transition count 1760
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 343 place count 865 transition count 1760
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 355 place count 861 transition count 1752
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 363 place count 853 transition count 1752
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 366 place count 850 transition count 1749
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 850 transition count 1749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 372 place count 850 transition count 1746
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 498 place count 787 transition count 1683
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 502 place count 785 transition count 1684
Applied a total of 502 rules in 144 ms. Remains 785 /1037 variables (removed 252) and now considering 1684/1931 (removed 247) transitions.
// Phase 1: matrix 1684 rows 785 cols
[2025-05-30 11:39:42] [INFO ] Computed 105 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:43] [INFO ] Implicit Places using invariants in 586 ms returned [88, 94, 99, 178, 184, 189, 266, 272, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 618, 624, 629, 706, 712, 717, 782]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 589 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/3201 places, 1684/3865 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 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 759 transition count 1683
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 743 transition count 1667
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 743 transition count 1667
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 727 transition count 1651
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 727 transition count 1651
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 720 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 720 transition count 1644
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 96 place count 712 transition count 1636
Applied a total of 96 rules in 104 ms. Remains 712 /760 variables (removed 48) and now considering 1636/1684 (removed 48) transitions.
// Phase 1: matrix 1636 rows 712 cols
[2025-05-30 11:39:43] [INFO ] Computed 80 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:44] [INFO ] Implicit Places using invariants in 528 ms returned []
[2025-05-30 11:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:45] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 712/3201 places, 1636/3865 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4678 ms. Remains : 712/3201 places, 1636/3865 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-10
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-10 finished in 4775 ms.
All properties solved by simple procedures.
Total runtime 383589 ms.

BK_STOP 1748605185946

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-08b"
export BK_EXAMINATION="LTLCardinality"
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-08b, examination is LTLCardinality"
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-174853729200403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;