Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.7K 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 956K 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 AutoFlight-PT-48b-ReachabilityCardinality-2025-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748640847997

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 21:34:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 21:34:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 21:34:09] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-05-30 21:34:09] [INFO ] Transformed 3950 places.
[2025-05-30 21:34:09] [INFO ] Transformed 3936 transitions.
[2025-05-30 21:34:09] [INFO ] Found NUPN structural information;
[2025-05-30 21:34:09] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (20 resets) in 2499 ms. (16 steps per ms) remains 7/13 properties
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
[2025-05-30 21:34:10] [INFO ] Flatten gal took : 452 ms
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
[2025-05-30 21:34:10] [INFO ] Flatten gal took : 310 ms
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
[2025-05-30 21:34:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6016626897468009782.gal : 122 ms
[2025-05-30 21:34:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1740259948555847768.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6016626897468009782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1740259948555847768.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 7/7 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 3936 rows 3950 cols
[2025-05-30 21:34:11] [INFO ] Computed 258 invariants in 80 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality1740259948555847768.prop.
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/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3713/3832 variables, 257/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3832 variables, 3713/4089 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3832 variables, 0/4089 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 118/3950 variables, 1/4090 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5468ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 3950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1569 transitions
Trivial Post-agglo rules discarded 1569 transitions
Performed 1569 trivial Post agglomeration. Transition count delta: 1569
Iterating post reduction 0 with 1569 rules applied. Total rules applied 1569 place count 3950 transition count 2367
Reduce places removed 1569 places and 0 transitions.
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 1 with 1811 rules applied. Total rules applied 3380 place count 2381 transition count 2125
Reduce places removed 75 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 114 rules applied. Total rules applied 3494 place count 2306 transition count 2086
Reduce places removed 39 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 43 rules applied. Total rules applied 3537 place count 2267 transition count 2082
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3538 place count 2266 transition count 2082
Performed 475 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 475 Pre rules applied. Total rules applied 3538 place count 2266 transition count 1607
Deduced a syphon composed of 475 places in 22 ms
Reduce places removed 475 places and 0 transitions.
Iterating global reduction 5 with 950 rules applied. Total rules applied 4488 place count 1791 transition count 1607
Discarding 321 places :
Symmetric choice reduction at 5 with 321 rule applications. Total rules 4809 place count 1470 transition count 1286
Iterating global reduction 5 with 321 rules applied. Total rules applied 5130 place count 1470 transition count 1286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 6 rules applied. Total rules applied 5136 place count 1470 transition count 1280
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 5138 place count 1469 transition count 1279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 5139 place count 1468 transition count 1279
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 99 Pre rules applied. Total rules applied 5139 place count 1468 transition count 1180
Deduced a syphon composed of 99 places in 5 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 8 with 198 rules applied. Total rules applied 5337 place count 1369 transition count 1180
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 3 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 8 with 632 rules applied. Total rules applied 5969 place count 1053 transition count 864
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 5977 place count 1049 transition count 866
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 5990 place count 1049 transition count 853
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 5996 place count 1046 transition count 850
Free-agglomeration rule applied 135 times.
Iterating global reduction 8 with 135 rules applied. Total rules applied 6131 place count 1046 transition count 715
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 8 with 135 rules applied. Total rules applied 6266 place count 911 transition count 715
Applied a total of 6266 rules in 1142 ms. Remains 911 /3950 variables (removed 3039) and now considering 715/3936 (removed 3221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 911/3950 places, 715/3936 transitions.
RANDOM walk for 40000 steps (241 resets) in 795 ms. (50 steps per ms) remains 5/7 properties
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (22 resets) in 283 ms. (140 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (21 resets) in 386 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (25 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (19 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (23 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
// Phase 1: matrix 715 rows 911 cols
[2025-05-30 21:34:18] [INFO ] Computed 258 invariants in 14 ms
[2025-05-30 21:34:18] [INFO ] State equation strengthened by 319 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/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 568/653 variables, 222/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 186/839 variables, 34/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/839 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 72/911 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 715/1626 variables, 911/1169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1626 variables, 319/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1626 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1626 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1626/1626 variables, and 1488 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 911/911 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 568/653 variables, 222/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 12 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :1 after 3
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:20] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 8
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:21] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/653 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 186/839 variables, 34/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:22] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:23] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:23] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:23] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:23] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 16
[2025-05-30 21:34:23] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 7 ms to minimize.
SDD size :8 after 17
At refinement iteration 5 (INCLUDED_ONLY) 0/839 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:23] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 72/911 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:24] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:25] [INFO ] Deduced a trap composed of 271 places in 243 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:25] [INFO ] Deduced a trap composed of 273 places in 237 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:25] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:25] [INFO ] Deduced a trap composed of 273 places in 225 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:26] [INFO ] Deduced a trap composed of 273 places in 222 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:26] [INFO ] Deduced a trap composed of 273 places in 244 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:26] [INFO ] Deduced a trap composed of 275 places in 240 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:26] [INFO ] Deduced a trap composed of 275 places in 238 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:27] [INFO ] Deduced a trap composed of 275 places in 242 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:27] [INFO ] Deduced a trap composed of 273 places in 237 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :17 after 34
[2025-05-30 21:34:27] [INFO ] Deduced a trap composed of 273 places in 242 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:28] [INFO ] Deduced a trap composed of 275 places in 241 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:28] [INFO ] Deduced a trap composed of 275 places in 247 ms of which 76 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:28] [INFO ] Deduced a trap composed of 273 places in 284 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:28] [INFO ] Deduced a trap composed of 273 places in 245 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:29] [INFO ] Deduced a trap composed of 275 places in 241 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:29] [INFO ] Deduced a trap composed of 275 places in 235 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:29] [INFO ] Deduced a trap composed of 275 places in 241 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:30] [INFO ] Deduced a trap composed of 275 places in 250 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:30] [INFO ] Deduced a trap composed of 275 places in 249 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:30] [INFO ] Deduced a trap composed of 277 places in 250 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:30] [INFO ] Deduced a trap composed of 277 places in 256 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:31] [INFO ] Deduced a trap composed of 275 places in 233 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:31] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:31] [INFO ] Deduced a trap composed of 275 places in 238 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:31] [INFO ] Deduced a trap composed of 276 places in 242 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:32] [INFO ] Deduced a trap composed of 275 places in 242 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:32] [INFO ] Deduced a trap composed of 275 places in 235 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:32] [INFO ] Deduced a trap composed of 275 places in 242 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:32] [INFO ] Deduced a trap composed of 274 places in 242 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:33] [INFO ] Deduced a trap composed of 275 places in 241 ms of which 74 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 18/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:33] [INFO ] Deduced a trap composed of 275 places in 242 ms of which 78 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/911 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/911 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 715/1626 variables, 911/1239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1626 variables, 319/1558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :34 after 67
At refinement iteration 15 (INCLUDED_ONLY) 0/1626 variables, 3/1561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 21:34:36] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 23 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1626 variables, 1/1562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :67 after 132
At refinement iteration 17 (INCLUDED_ONLY) 0/1626 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :132 after 655
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :655 after 1.70644e+13
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.70644e+13 after 2.71242e+33
At refinement iteration 18 (OVERLAPS) 0/1626 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1626/1626 variables, and 1562 constraints, problems are : Problem set: 0 solved, 4 unsolved in 22554 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 911/911 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23900ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES PARIKH_WALK
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :2.71242e+33 after 1.25874e+73
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 701 ms.
Support contains 9 out of 911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 911/911 places, 715/715 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 911 transition count 656
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 852 transition count 656
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 118 place count 852 transition count 625
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 180 place count 821 transition count 625
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 182 place count 819 transition count 623
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 819 transition count 623
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 187 place count 819 transition count 620
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 187 place count 819 transition count 619
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 818 transition count 619
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 313 place count 756 transition count 556
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 317 place count 756 transition count 552
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 327 place count 756 transition count 542
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 337 place count 746 transition count 542
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 338 place count 745 transition count 541
Reduce places removed 27 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 32 rules applied. Total rules applied 370 place count 718 transition count 536
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 375 place count 713 transition count 536
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 375 place count 713 transition count 514
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 419 place count 691 transition count 514
Applied a total of 419 rules in 156 ms. Remains 691 /911 variables (removed 220) and now considering 514/715 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 691/911 places, 514/715 transitions.
RANDOM walk for 40000 steps (162 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (17 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 235872 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 235872 steps, saw 78689 distinct states, run finished after 3006 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 514 rows 691 cols
[2025-05-30 21:34:46] [INFO ] Computed 231 invariants in 4 ms
[2025-05-30 21:34:46] [INFO ] State equation strengthened by 345 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/196 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/245 variables, 196/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 133/378 variables, 58/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 70/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 180/558 variables, 23/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 147/705 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 78/783 variables, 29/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/783 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 392/1175 variables, 406/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1175 variables, 1/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1175 variables, 275/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1175 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 30/1205 variables, 30/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1205 variables, 15/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1205 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1205 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 1267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 229/229 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 691/691 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/196 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/245 variables, 196/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 133/378 variables, 58/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 70/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 180/558 variables, 23/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 147/705 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/783 variables, 29/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/783 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 392/1175 variables, 406/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1175 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1175 variables, 275/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1175 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 30/1205 variables, 30/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1205 variables, 15/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1205 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1205 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 1268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 229/229 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 691/691 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1132 steps, including 24 resets, run visited all 1 properties in 14 ms. (steps per millisecond=80 )
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 38619 ms.

BK_STOP 1748640887812

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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