Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K 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.8K 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.3M 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-09b-ReachabilityFireability-2023-15
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-00
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-01
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-02
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-03
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-04
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-05
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-06
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-07
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-10
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-11
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-12
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-13
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2025-14

=== Now, execution of the tool begins

BK_START 1748613349122

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 13:55:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 13:55:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:55:50] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2025-05-30 13:55:50] [INFO ] Transformed 4014 places.
[2025-05-30 13:55:50] [INFO ] Transformed 4932 transitions.
[2025-05-30 13:55:50] [INFO ] Found NUPN structural information;
[2025-05-30 13:55:50] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (48 resets) in 1887 ms. (21 steps per ms) remains 12/16 properties
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
[2025-05-30 13:55:51] [INFO ] Flatten gal took : 521 ms
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
[2025-05-30 13:55:52] [INFO ] Flatten gal took : 264 ms
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
[2025-05-30 13:55:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17739915192782084074.gal : 117 ms
[2025-05-30 13:55:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3184706733150034708.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17739915192782084074.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3184706733150034708.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 4932 rows 4014 cols
[2025-05-30 13:55:52] [INFO ] Computed 394 invariants in 323 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 381/492 variables, 35/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 381/527 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Loading property file /tmp/ReachabilityCardinality3184706733150034708.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 575/1067 variables, 58/585 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1067 variables, 575/1160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1067 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2872/3939 variables, 287/1447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3939 variables, 2872/4319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3939/8946 variables, and 4319 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5047 ms.
Refiners :[Domain max(s): 3939/4014 constraints, Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 287/301 constraints, State Equation: 0/4014 constraints, PredecessorRefiner: 12/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 381/492 variables, 35/146 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 381/527 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 575/1067 variables, 58/585 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1067 variables, 575/1160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1067 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2872/3939 variables, 287/1447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3939 variables, 2872/4319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:03] [INFO ] Deduced a trap composed of 46 places in 1220 ms of which 225 ms to minimize.
SMT process timed out in 11623ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 111 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 881 transitions
Trivial Post-agglo rules discarded 881 transitions
Performed 881 trivial Post agglomeration. Transition count delta: 881
Iterating post reduction 0 with 881 rules applied. Total rules applied 881 place count 4014 transition count 4051
Reduce places removed 881 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 919 rules applied. Total rules applied 1800 place count 3133 transition count 4013
Reduce places removed 10 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 22 rules applied. Total rules applied 1822 place count 3123 transition count 4001
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 1838 place count 3111 transition count 3997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1839 place count 3110 transition count 3997
Performed 915 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 915 Pre rules applied. Total rules applied 1839 place count 3110 transition count 3082
Deduced a syphon composed of 915 places in 8 ms
Ensure Unique test removed 90 places
Reduce places removed 1005 places and 0 transitions.
Iterating global reduction 5 with 1920 rules applied. Total rules applied 3759 place count 2105 transition count 3082
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 5 with 57 rules applied. Total rules applied 3816 place count 2092 transition count 3038
Reduce places removed 44 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 6 with 59 rules applied. Total rules applied 3875 place count 2048 transition count 3023
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 3890 place count 2033 transition count 3023
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 35 Pre rules applied. Total rules applied 3890 place count 2033 transition count 2988
Deduced a syphon composed of 35 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 8 with 103 rules applied. Total rules applied 3993 place count 1965 transition count 2988
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 33 Pre rules applied. Total rules applied 3993 place count 1965 transition count 2955
Deduced a syphon composed of 33 places in 22 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 4059 place count 1932 transition count 2955
Discarding 124 places :
Symmetric choice reduction at 8 with 124 rule applications. Total rules 4183 place count 1808 transition count 2831
Iterating global reduction 8 with 124 rules applied. Total rules applied 4307 place count 1808 transition count 2831
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4308 place count 1808 transition count 2830
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 34 Pre rules applied. Total rules applied 4308 place count 1808 transition count 2796
Deduced a syphon composed of 34 places in 21 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 69 rules applied. Total rules applied 4377 place count 1773 transition count 2796
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4377 place count 1773 transition count 2795
Deduced a syphon composed of 1 places in 21 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 4380 place count 1771 transition count 2795
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 4387 place count 1764 transition count 2750
Iterating global reduction 9 with 7 rules applied. Total rules applied 4394 place count 1764 transition count 2750
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 4394 place count 1764 transition count 2744
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 4406 place count 1758 transition count 2744
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4407 place count 1757 transition count 2736
Iterating global reduction 9 with 1 rules applied. Total rules applied 4408 place count 1757 transition count 2736
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4409 place count 1756 transition count 2728
Iterating global reduction 9 with 1 rules applied. Total rules applied 4410 place count 1756 transition count 2728
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4411 place count 1755 transition count 2720
Iterating global reduction 9 with 1 rules applied. Total rules applied 4412 place count 1755 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4413 place count 1754 transition count 2712
SDD proceeding with computation,12 properties remain. new max is 4
Iterating global reduction 9 with 1 rules applied. Total rules applied 4414 place count 1754 transition count 2712
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4415 place count 1753 transition count 2704
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 15
Iterating global reduction 9 with 1 rules applied. Total rules applied 4416 place count 1753 transition count 2704
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :15 after 21
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :21 after 153
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4417 place count 1752 transition count 2696
Iterating global reduction 9 with 1 rules applied. Total rules applied 4418 place count 1752 transition count 2696
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :153 after 352
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :352 after 960
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4419 place count 1751 transition count 2688
Iterating global reduction 9 with 1 rules applied. Total rules applied 4420 place count 1751 transition count 2688
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :960 after 12499
Performed 221 Post agglomeration using F-continuation condition.Transition count delta: 221
Deduced a syphon composed of 221 places in 9 ms
SDD proceeding with computation,12 properties remain. new max is 1024
Ensure Unique test removed 1 places
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 9 with 443 rules applied. Total rules applied 4863 place count 1529 transition count 2467
SDD size :12499 after 32460
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4864 place count 1528 transition count 2466
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 4866 place count 1527 transition count 2466
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4867 place count 1526 transition count 2465
Iterating global reduction 9 with 1 rules applied. Total rules applied 4868 place count 1526 transition count 2465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 4870 place count 1526 transition count 2463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4871 place count 1525 transition count 2463
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :32460 after 625239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4873 place count 1524 transition count 2472
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 4884 place count 1524 transition count 2461
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 4895 place count 1513 transition count 2461
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 4901 place count 1513 transition count 2455
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4907 place count 1507 transition count 2455
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 4908 place count 1507 transition count 2455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4909 place count 1506 transition count 2454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4911 place count 1504 transition count 2454
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 3 Pre rules applied. Total rules applied 4911 place count 1504 transition count 2451
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 4917 place count 1501 transition count 2451
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :625239 after 7.18249e+10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 4921 place count 1499 transition count 2449
Applied a total of 4921 rules in 2366 ms. Remains 1499 /4014 variables (removed 2515) and now considering 2449/4932 (removed 2483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2377 ms. Remains : 1499/4014 places, 2449/4932 transitions.
RANDOM walk for 40000 steps (235 resets) in 512 ms. (77 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 227 ms. (175 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (28 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 337 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (27 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (39 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 323 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (28 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (29 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :7.18249e+10 after 1.26402e+17
BEST_FIRST walk for 40004 steps (29 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :1.26402e+17 after 1.14019e+23
Interrupted probabilistic random walk after 128214 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 12
Probabilistic random walk after 128214 steps, saw 35670 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 2449 rows 1499 cols
[2025-05-30 13:56:10] [INFO ] Computed 252 invariants in 61 ms
[2025-05-30 13:56:10] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 364/475 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 113/588 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 884/1472 variables, 179/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.14019e+23 after 8.92423e+34
At refinement iteration 6 (INCLUDED_ONLY) 0/1472 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/1473 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1473 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 26/1499 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2449/3948 variables, 1499/1751 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3948 variables, 35/1786 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3948 variables, 0/1786 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/3948 variables, 0/1786 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3948/3948 variables, and 1786 constraints, problems are : Problem set: 0 solved, 12 unsolved in 7073 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 184/184 constraints, State Equation: 1499/1499 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 12/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 364/475 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 113/588 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 884/1472 variables, 179/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:19] [INFO ] Deduced a trap composed of 20 places in 525 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:19] [INFO ] Deduced a trap composed of 56 places in 530 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:19] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1472 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:21] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1472 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:21] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 16 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 65536
At refinement iteration 8 (INCLUDED_ONLY) 0/1472 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD size :8.92423e+34 after 3.29285e+55
At refinement iteration 9 (INCLUDED_ONLY) 0/1472 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/1473 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1473 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 26/1499 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1499 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem ASLink-PT-09b-ReachabilityFireability-2025-01 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09b-ReachabilityFireability-2025-03 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09b-ReachabilityFireability-2025-06 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09b-ReachabilityFireability-2025-14 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 2449/3948 variables, 1499/1756 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3948 variables, 35/1791 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3948 variables, 5/1796 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:53] [INFO ] Deduced a trap composed of 8 places in 382 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:54] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 29 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3948 variables, 2/1798 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3948/3948 variables, and 1798 constraints, problems are : Problem set: 4 solved, 8 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 184/184 constraints, State Equation: 1499/1499 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52208ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 104 out of 1499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1499/1499 places, 2449/2449 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 1499 transition count 2443
Deduced a syphon composed of 6 places in 17 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1493 transition count 2443
Applied a total of 12 rules in 104 ms. Remains 1493 /1499 variables (removed 6) and now considering 2443/2449 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1493/1499 places, 2443/2449 transitions.
RANDOM walk for 40000 steps (238 resets) in 850 ms. (47 steps per ms) remains 7/8 properties
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (32 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (31 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (27 resets) in 145 ms. (273 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (33 resets) in 253 ms. (157 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (30 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (31 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
// Phase 1: matrix 2443 rows 1493 cols
[2025-05-30 13:57:03] [INFO ] Computed 252 invariants in 28 ms
[2025-05-30 13:57:03] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 375/477 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 83/560 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 900/1460 variables, 175/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1460 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/1462 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1462 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 31/1493 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1493 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2443/3936 variables, 1493/1745 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3936 variables, 35/1780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3936 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/3936 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3936/3936 variables, and 1780 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4162 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 184/184 constraints, State Equation: 1493/1493 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 375/477 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 83/560 variables, 30/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 900/1460 variables, 175/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:08] [INFO ] Deduced a trap composed of 23 places in 506 ms of which 61 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1460 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:09] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 45 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1460 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1460 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/1462 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:11] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1462 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1462 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 31/1493 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1493 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2443/3936 variables, 1493/1748 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3936 variables, 35/1783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3936 variables, 4/1787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3936 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/3936 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3936/3936 variables, and 1787 constraints, problems are : Problem set: 0 solved, 7 unsolved in 18696 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 184/184 constraints, State Equation: 1493/1493 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22924ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 31293 ms.
Support contains 100 out of 1493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1493/1493 places, 2443/2443 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1493 transition count 2441
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1491 transition count 2441
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1489 transition count 2439
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1489 transition count 2438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 1488 transition count 2438
Applied a total of 10 rules in 200 ms. Remains 1488 /1493 variables (removed 5) and now considering 2438/2443 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 1488/1493 places, 2438/2443 transitions.
RANDOM walk for 40000 steps (243 resets) in 421 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (33 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (27 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (30 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (30 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 141841 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 6
Probabilistic random walk after 141841 steps, saw 40221 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 2438 rows 1488 cols
[2025-05-30 13:58:01] [INFO ] Computed 252 invariants in 27 ms
[2025-05-30 13:58:01] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 371/471 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 91/562 variables, 31/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 887/1449 variables, 173/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1449 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/1450 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1450 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 38/1488 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1488 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2438/3926 variables, 1488/1740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3926 variables, 35/1775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3926 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/3926 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3926/3926 variables, and 1775 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4729 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 1488/1488 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 371/471 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 91/562 variables, 31/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 887/1449 variables, 173/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:06] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:07] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1449 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:07] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:07] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:08] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:08] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:09] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:09] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1449 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1449 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/1450 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 38/1488 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1488 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2438/3926 variables, 1488/1748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3926 variables, 35/1783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3926 variables, 3/1786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:36] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:37] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:37] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 22 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3926 variables, 3/1789 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3926 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:40] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 51 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/3926 variables, 1/1790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3926 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/3926 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3926/3926 variables, and 1790 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40026 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 1488/1488 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44815ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39602 ms.
Support contains 100 out of 1488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1488/1488 places, 2438/2438 transitions.
Applied a total of 0 rules in 59 ms. Remains 1488 /1488 variables (removed 0) and now considering 2438/2438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1488/1488 places, 2438/2438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1488/1488 places, 2438/2438 transitions.
Applied a total of 0 rules in 58 ms. Remains 1488 /1488 variables (removed 0) and now considering 2438/2438 (removed 0) transitions.
[2025-05-30 13:59:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:59:26] [INFO ] Implicit Places using invariants in 1100 ms returned [2, 20, 21, 24, 34, 51, 70, 153, 167, 170, 171, 193, 211, 310, 311, 312, 313, 335, 354, 440, 454, 455, 456, 457, 460, 477, 495, 536, 595, 599, 602, 622, 641, 725, 739, 740, 741, 745, 767, 785, 871, 884, 889, 895, 914, 932, 1031, 1034, 1035, 1038, 1057, 1075, 1152, 1157, 1171, 1173, 1174, 1198, 1216, 1289, 1299, 1318, 1319, 1353, 1358, 1376, 1377, 1378, 1379, 1392, 1398, 1404, 1410, 1416, 1422, 1428, 1440, 1446, 1452]
[2025-05-30 13:59:26] [INFO ] Actually due to overlaps returned [34, 51, 193, 335, 460, 477, 602, 622, 745, 767, 895, 914, 1038, 1057, 1198, 1358, 170, 311, 312, 455, 456, 740, 741, 889, 1034, 1173, 1318, 1376, 171, 313, 457, 599, 1035, 1174, 1319, 1353, 1377, 2, 20, 440, 725, 871, 1157, 1299, 70, 167, 211, 310, 354, 454, 495, 595, 641, 739, 785, 884, 932, 1031, 1075, 1171, 1216, 1378, 1422, 1440, 1452, 21, 24, 153, 1289, 1379, 1392, 1398, 1404, 1410, 1416, 1428, 1446]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1124 ms to find 77 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1411/1488 places, 2438/2438 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 1409 transition count 2324
Reduce places removed 114 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 126 rules applied. Total rules applied 242 place count 1295 transition count 2312
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 254 place count 1283 transition count 2312
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 254 place count 1283 transition count 2266
Deduced a syphon composed of 46 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 347 place count 1236 transition count 2266
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 16 rules applied. Total rules applied 363 place count 1224 transition count 2262
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 367 place count 1220 transition count 2262
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 383 place count 1204 transition count 2246
Iterating global reduction 5 with 16 rules applied. Total rules applied 399 place count 1204 transition count 2246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 400 place count 1204 transition count 2245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 400 place count 1204 transition count 2244
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 402 place count 1203 transition count 2244
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 409 place count 1196 transition count 2237
Iterating global reduction 6 with 7 rules applied. Total rules applied 416 place count 1196 transition count 2237
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 422 place count 1190 transition count 2229
Iterating global reduction 6 with 6 rules applied. Total rules applied 428 place count 1190 transition count 2229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 432 place count 1190 transition count 2225
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 7 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 586 place count 1113 transition count 2148
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 589 place count 1110 transition count 2144
Iterating global reduction 7 with 3 rules applied. Total rules applied 592 place count 1110 transition count 2144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 593 place count 1110 transition count 2143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 594 place count 1109 transition count 2142
Iterating global reduction 8 with 1 rules applied. Total rules applied 595 place count 1109 transition count 2142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 596 place count 1109 transition count 2141
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 602 place count 1109 transition count 2135
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 609 place count 1103 transition count 2134
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 10 with 19 rules applied. Total rules applied 628 place count 1103 transition count 2115
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 647 place count 1084 transition count 2115
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 11 with 28 rules applied. Total rules applied 675 place count 1084 transition count 2115
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 677 place count 1084 transition count 2115
Applied a total of 677 rules in 530 ms. Remains 1084 /1411 variables (removed 327) and now considering 2115/2438 (removed 323) transitions.
// Phase 1: matrix 2115 rows 1084 cols
[2025-05-30 13:59:27] [INFO ] Computed 160 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:59:28] [INFO ] Implicit Places using invariants in 768 ms returned [94, 100, 103, 105, 108, 181, 202, 208, 210, 214, 215, 221, 226, 227, 288, 311, 317, 320, 322, 329, 425, 431, 440, 441, 501, 534, 538, 546, 639, 744, 750, 753, 755, 759, 832, 850, 856, 859, 861, 873, 874, 959, 966, 969, 971, 975, 1080]
[2025-05-30 13:59:28] [INFO ] Actually due to overlaps returned [538, 329, 873, 546, 874, 221, 94, 100, 105, 202, 208, 214, 311, 317, 322, 744, 750, 755, 850, 856, 861, 959, 966, 971, 108, 181, 215, 288, 425, 431, 501, 534, 639, 759, 832, 975, 1080]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 771 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1047/1488 places, 2115/2438 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1019 transition count 2087
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1019 transition count 2087
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 1014 transition count 2082
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 1014 transition count 2082
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 1005 transition count 2073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1004 transition count 2071
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1004 transition count 2071
Free-agglomeration rule applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 102 place count 1004 transition count 2055
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 118 place count 988 transition count 2055
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 988 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 987 transition count 2054
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 987 transition count 2054
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 987 transition count 2054
Applied a total of 122 rules in 299 ms. Remains 987 /1047 variables (removed 60) and now considering 2054/2115 (removed 61) transitions.
// Phase 1: matrix 2054 rows 987 cols
[2025-05-30 13:59:28] [INFO ] Computed 123 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:59:29] [INFO ] Implicit Places using invariants in 652 ms returned [197, 198, 393, 394]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 657 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 983/1488 places, 2054/2438 transitions.
Applied a total of 0 rules in 36 ms. Remains 983 /983 variables (removed 0) and now considering 2054/2054 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3478 ms. Remains : 983/1488 places, 2054/2438 transitions.
RANDOM walk for 40000 steps (231 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 257088 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 6
Probabilistic random walk after 257088 steps, saw 50912 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 2054 rows 983 cols
[2025-05-30 13:59:32] [INFO ] Computed 119 invariants in 18 ms
[2025-05-30 13:59:32] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 177/277 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 680/959 variables, 87/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 24/983 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2054/3037 variables, 983/1102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3037 variables, 6/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3037 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3037 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 1108 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 93/93 constraints, State Equation: 983/983 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 177/277 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/279 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 680/959 variables, 87/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:59:35] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:59:35] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:59:36] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:59:36] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 24/983 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2054/3037 variables, 983/1106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3037 variables, 6/1112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3037 variables, 3/1115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3037 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/3037 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 1115 constraints, problems are : Problem set: 0 solved, 6 unsolved in 15777 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 93/93 constraints, State Equation: 983/983 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18011ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18172 ms.
Support contains 100 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 2054/2054 transitions.
Applied a total of 0 rules in 36 ms. Remains 983 /983 variables (removed 0) and now considering 2054/2054 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 983/983 places, 2054/2054 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 2054/2054 transitions.
Applied a total of 0 rules in 36 ms. Remains 983 /983 variables (removed 0) and now considering 2054/2054 (removed 0) transitions.
[2025-05-30 14:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:00:09] [INFO ] Implicit Places using invariants in 574 ms returned []
[2025-05-30 14:00:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:00:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 14:00:12] [INFO ] Implicit Places using invariants and state equation in 2969 ms returned []
Implicit Place search using SMT with State Equation took 3569 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 14:00:12] [INFO ] Redundant transitions in 141 ms returned []
Running 2043 sub problems to find dead transitions.
[2025-05-30 14:00:12] [INFO ] Invariant cache hit.
[2025-05-30 14:00:12] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/980 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/980 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:42] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/3037 variables, and 76 constraints, problems are : Problem set: 0 solved, 2043 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 5/26 constraints, Generalized P Invariants (flows): 70/93 constraints, State Equation: 0/983 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 2043/2043 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2043 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/980 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/980 variables, 70/75 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/980 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2043 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:45] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 17)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(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 3)
(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 2)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/3037 variables, and 77 constraints, problems are : Problem set: 0 solved, 2043 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/26 constraints, Generalized P Invariants (flows): 70/93 constraints, State Equation: 0/983 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/2043 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 2043 unsolved
Search for dead transitions found 0 dead transitions in 61109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64873 ms. Remains : 983/983 places, 2054/2054 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 983 transition count 2053
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 982 transition count 2053
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 981 transition count 2052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 981 transition count 2051
Applied a total of 5 rules in 76 ms. Remains 981 /983 variables (removed 2) and now considering 2051/2054 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2051 rows 981 cols
[2025-05-30 14:01:13] [INFO ] Computed 119 invariants in 23 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 14:01:14] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-05-30 14:01:14] [INFO ] [Real]Absence check using 26 positive and 93 generalized place invariants in 33 ms returned sat
[2025-05-30 14:01:14] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 14:01:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 16 ms returned sat
[2025-05-30 14:01:14] [INFO ] [Nat]Absence check using 26 positive and 93 generalized place invariants in 59 ms returned sat
[2025-05-30 14:01:20] [INFO ] After 5652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:20] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 18 ms to minimize.
[2025-05-30 14:01:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:23] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:23] [INFO ] Deduced a trap composed of 8 places in 528 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:24] [INFO ] Deduced a trap composed of 14 places in 308 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:24] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 20 ms to minimize.
[2025-05-30 14:01:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1616 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:28] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 13 ms to minimize.
[2025-05-30 14:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:30] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 22 ms to minimize.
[2025-05-30 14:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:34] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 11 ms to minimize.
[2025-05-30 14:01:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:01:36] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 16 ms to minimize.
[2025-05-30 14:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
TRAPS : Iteration 4
[2025-05-30 14:01:41] [INFO ] After 27263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-05-30 14:01:44] [INFO ] After 30281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 30826 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 14:01:44] [INFO ] Flatten gal took : 181 ms
[2025-05-30 14:01:44] [INFO ] Applying decomposition
[2025-05-30 14:01:44] [INFO ] Flatten gal took : 152 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2336893745267700644.txt' '-o' '/tmp/graph2336893745267700644.bin' '-w' '/tmp/graph2336893745267700644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2336893745267700644.bin' '-l' '-1' '-v' '-w' '/tmp/graph2336893745267700644.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:01:45] [INFO ] Decomposing Gal with order
[2025-05-30 14:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:01:46] [INFO ] Removed a total of 3500 redundant transitions.
[2025-05-30 14:01:46] [INFO ] Flatten gal took : 389 ms
[2025-05-30 14:01:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 48 ms.
[2025-05-30 14:01:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4515848349549743135.gal : 46 ms
[2025-05-30 14:01:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1728218845624995848.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4515848349549743135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1728218845624995848.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1728218845624995848.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :15 after 6.64948e+09
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :6.64948e+09 after 3.16405e+19
Reachability property ASLink-PT-09b-ReachabilityFireability-2025-11 is true.
FORMULA ASLink-PT-09b-ReachabilityFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2025-05-30 14:31:47] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12415843305945910345
[2025-05-30 14:31:47] [INFO ] Too many transitions (2054) to apply POR reductions. Disabling POR matrices.
[2025-05-30 14:31:47] [INFO ] Applying decomposition
[2025-05-30 14:31:47] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12415843305945910345
Running compilation step : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 14:31:47] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5743707289905862516.txt' '-o' '/tmp/graph5743707289905862516.bin' '-w' '/tmp/graph5743707289905862516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5743707289905862516.bin' '-l' '-1' '-v' '-w' '/tmp/graph5743707289905862516.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:31:47] [INFO ] Decomposing Gal with order
[2025-05-30 14:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:31:47] [INFO ] Removed a total of 3660 redundant transitions.
[2025-05-30 14:31:47] [INFO ] Flatten gal took : 102 ms
[2025-05-30 14:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 25 ms.
[2025-05-30 14:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7333772701058404350.gal : 14 ms
[2025-05-30 14:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3594936537816955448.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7333772701058404350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3594936537816955448.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability3594936537816955448.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 37
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :37 after 1777
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1777 after 3.02012e+07
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3.02012e+07 after 2.76556e+09
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.00067e+15 after 1.95312e+17
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.95312e+17 after 3.1607e+18
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :3.1607e+18 after 2.23449e+19
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :2.23449e+19 after 9.39608e+20
Compilation finished in 4271 ms.
Running link step : cd /tmp/ltsmin12415843305945910345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202502==true'
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :9.39608e+20 after 6.04337e+23
WARNING : LTSmin timed out (>120 s) on command cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202502==true'
Running LTSmin : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202507==true'
WARNING : LTSmin timed out (>120 s) on command cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202507==true'
Running LTSmin : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202408==true'
WARNING : LTSmin timed out (>120 s) on command cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202409==true'
WARNING : LTSmin timed out (>120 s) on command cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202315==true'
WARNING : LTSmin timed out (>120 s) on command cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202315==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin12415843305945910345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability202502==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729200423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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