Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K 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.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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.8M 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 DoubleExponent-PT-100-ReachabilityCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2024-15
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748748778818

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-01 03:32:59] [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-06-01 03:33:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 03:33:00] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-06-01 03:33:00] [INFO ] Transformed 5304 places.
[2025-06-01 03:33:00] [INFO ] Transformed 4998 transitions.
[2025-06-01 03:33:00] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1309 resets) in 2105 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 93 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 65 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (119 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 90 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (109 resets) in 111 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (104 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (108 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (109 resets) in 79 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 57 ms. (68 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
[2025-06-01 03:33:02] [INFO ] Flatten gal took : 580 ms
BEST_FIRST walk for 4000 steps (119 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
[2025-06-01 03:33:02] [INFO ] Flatten gal took : 215 ms
[2025-06-01 03:33:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16787467903501730105.gal : 116 ms
[2025-06-01 03:33:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18417589958698442419.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/ReachabilityCardinality16787467903501730105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18417589958698442419.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 ...330
Loading property file /tmp/ReachabilityCardinality18417589958698442419.prop.
Interrupted probabilistic random walk after 57826 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 16
Probabilistic random walk after 57826 steps, saw 28922 distinct states, run finished after 3008 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 4998 rows 5304 cols
[2025-06-01 03:33:05] [INFO ] Invariants computation overflowed in 190 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/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 417/584 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1889/2473 variables, 713/880 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2473 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3261/5734 variables, 1634/2514 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5734 variables, 0/2514 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2769/8503 variables, 1604/4118 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8503/10302 variables, and 4118 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5049 ms.
Refiners :[State Equation: 4118/5304 constraints, PredecessorRefiner: 16/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 417/584 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1889/2473 variables, 713/880 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2473 variables, 14/894 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2473 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 3261/5734 variables, 1634/2528 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:33:14] [INFO ] Deduced a trap along path composed of 17 places in 50 ms of which 10 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5734/10302 variables, and 2529 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5014 ms.
Refiners :[State Equation: 2514/5304 constraints, PredecessorRefiner: 16/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10418ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1054 transitions
Trivial Post-agglo rules discarded 1054 transitions
Performed 1054 trivial Post agglomeration. Transition count delta: 1054
Iterating post reduction 0 with 1057 rules applied. Total rules applied 1058 place count 5297 transition count 3942
Reduce places removed 1054 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 1 with 1101 rules applied. Total rules applied 2159 place count 4243 transition count 3895
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 2206 place count 4196 transition count 3895
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 2206 place count 4196 transition count 3692
Deduced a syphon composed of 203 places in 205 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2612 place count 3993 transition count 3692
Performed 815 Post agglomeration using F-continuation condition.Transition count delta: 815
Deduced a syphon composed of 815 places in 164 ms
Reduce places removed 815 places and 0 transitions.
Iterating global reduction 3 with 1630 rules applied. Total rules applied 4242 place count 3178 transition count 2877
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 114 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4444 place count 3077 transition count 2877
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 180 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 4590 place count 3004 transition count 2877
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 4597 place count 3004 transition count 2870
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 4604 place count 2997 transition count 2870
Free-agglomeration rule (complex) applied 413 times.
Iterating global reduction 4 with 413 rules applied. Total rules applied 5017 place count 2997 transition count 2457
Reduce places removed 413 places and 0 transitions.
Iterating post reduction 4 with 413 rules applied. Total rules applied 5430 place count 2584 transition count 2457
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 5 with 400 rules applied. Total rules applied 5830 place count 2584 transition count 2457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5831 place count 2583 transition count 2456
Applied a total of 5831 rules in 2956 ms. Remains 2583 /5304 variables (removed 2721) and now considering 2456/4998 (removed 2542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2962 ms. Remains : 2583/5304 places, 2456/4998 transitions.
RANDOM walk for 40000 steps (5065 resets) in 676 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (342 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (330 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (358 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (357 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (320 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (330 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (331 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (339 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (313 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (331 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (341 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (339 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (327 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (339 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (332 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (338 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :11 after 20
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :20 after 31
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :31 after 63
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :63 after 115
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :115 after 310
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :310 after 2444
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :2444 after 21116
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :21116 after 202385
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :202385 after 876441
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :876441 after 2.3132e+06
Interrupted probabilistic random walk after 87541 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 16
Probabilistic random walk after 87541 steps, saw 43934 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2456 rows 2583 cols
[2025-06-01 03:33:22] [INFO ] Invariants computation overflowed in 58 ms
[2025-06-01 03:33:22] [INFO ] State equation strengthened by 349 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :2.3132e+06 after 1.25458e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 551/718 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2490/3208 variables, 1047/1221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :1.25458e+08 after 8.23755e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/3208 variables, 164/1385 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3208 variables, 0/1385 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 262144
SDD size :8.23755e+08 after 3.23753e+09
SDD proceeding with computation,16 properties remain. new max is 524288
SDD size :3.23753e+09 after 1.08416e+10
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4946/5039 variables, and 2673 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45036 ms.
Refiners :[State Equation: 2502/2583 constraints, ReadFeed: 171/349 constraints, PredecessorRefiner: 16/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 551/718 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2490/3208 variables, 1047/1221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3208 variables, 164/1385 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3208 variables, 11/1396 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 1048576
SDD size :1.08416e+10 after 4.5947e+10
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:34:17] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:34:17] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:34:17] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:34:17] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 4/1400 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4946/5039 variables, and 2688 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45042 ms.
Refiners :[State Equation: 2502/2583 constraints, ReadFeed: 171/349 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 90200ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 2583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2583/2583 places, 2456/2456 transitions.
Applied a total of 0 rules in 151 ms. Remains 2583 /2583 variables (removed 0) and now considering 2456/2456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 2583/2583 places, 2456/2456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2583/2583 places, 2456/2456 transitions.
Applied a total of 0 rules in 149 ms. Remains 2583 /2583 variables (removed 0) and now considering 2456/2456 (removed 0) transitions.
// Phase 1: matrix 2456 rows 2583 cols
[2025-06-01 03:34:52] [INFO ] Invariants computation overflowed in 71 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:34:54] [INFO ] Implicit Places using invariants in 1705 ms returned []
// Phase 1: matrix 2456 rows 2583 cols
[2025-06-01 03:34:54] [INFO ] Invariants computation overflowed in 56 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:34:55] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:35:26] [INFO ] Performed 3/2583 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,16 properties remain. new max is 2097152
SDD size :4.5947e+10 after 1.64473e+11
[2025-06-01 03:36:08] [INFO ] Performed 19/2583 implicitness test of which 1 returned IMPLICIT in 72 seconds.
[2025-06-01 03:36:38] [INFO ] Performed 208/2583 implicitness test of which 14 returned IMPLICIT in 103 seconds.
[2025-06-01 03:37:34] [INFO ] Performed 432/2583 implicitness test of which 29 returned IMPLICIT in 158 seconds.
[2025-06-01 03:37:34] [INFO ] Implicit Places using invariants and state equation in 160117 ms returned [19, 25, 47, 54, 77, 106, 113, 137, 142, 166, 172, 193, 195, 199, 223, 229, 253, 260, 265, 282, 288, 309, 316, 340, 348, 372, 377, 427, 432]
[2025-06-01 03:37:34] [INFO ] Actually due to overlaps returned [432, 172, 265, 25, 113, 19, 106, 166, 427, 195]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 161843 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2573/2583 places, 2456/2456 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2573 transition count 2452
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 2569 transition count 2452
Applied a total of 8 rules in 349 ms. Remains 2569 /2573 variables (removed 4) and now considering 2452/2456 (removed 4) transitions.
// Phase 1: matrix 2452 rows 2569 cols
[2025-06-01 03:37:35] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:37:36] [INFO ] Implicit Places using invariants in 1660 ms returned []
// Phase 1: matrix 2452 rows 2569 cols
[2025-06-01 03:37:36] [INFO ] Invariants computation overflowed in 62 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:37:37] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:38:17] [INFO ] Performed 40/2569 implicitness test of which 0 returned IMPLICIT in 39 seconds.
SDD proceeding with computation,16 properties remain. new max is 4194304
SDD size :1.64473e+11 after 3.31085e+11
[2025-06-01 03:39:30] [INFO ] Performed 41/2569 implicitness test of which 0 returned IMPLICIT in 112 seconds.
[2025-06-01 03:40:16] [INFO ] Performed 44/2569 implicitness test of which 1 returned IMPLICIT in 158 seconds.
[2025-06-01 03:40:16] [INFO ] Implicit Places using invariants and state equation in 160128 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 161795 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2568/2583 places, 2452/2456 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2568 transition count 2452
Applied a total of 1 rules in 332 ms. Remains 2568 /2568 variables (removed 0) and now considering 2452/2452 (removed 0) transitions.
// Phase 1: matrix 2452 rows 2568 cols
[2025-06-01 03:40:17] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:40:18] [INFO ] Implicit Places using invariants in 1641 ms returned []
// Phase 1: matrix 2452 rows 2568 cols
[2025-06-01 03:40:18] [INFO ] Invariants computation overflowed in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:40:20] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:40:53] [INFO ] Performed 3/2568 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2025-06-01 03:41:48] [INFO ] Performed 17/2568 implicitness test of which 0 returned IMPLICIT in 88 seconds.
[2025-06-01 03:42:26] [INFO ] Performed 197/2568 implicitness test of which 6 returned IMPLICIT in 126 seconds.
[2025-06-01 03:42:58] [INFO ] Performed 198/2568 implicitness test of which 6 returned IMPLICIT in 158 seconds.
[2025-06-01 03:42:58] [INFO ] Implicit Places using invariants and state equation in 160144 ms returned [50, 73, 130, 135, 184, 189]
[2025-06-01 03:42:58] [INFO ] Actually due to overlaps returned [189, 50, 130, 184, 135]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 161790 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2563/2583 places, 2452/2456 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2563 transition count 2449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 2560 transition count 2449
Applied a total of 6 rules in 298 ms. Remains 2560 /2563 variables (removed 3) and now considering 2449/2452 (removed 3) transitions.
// Phase 1: matrix 2449 rows 2560 cols
[2025-06-01 03:42:59] [INFO ] Invariants computation overflowed in 69 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:43:00] [INFO ] Implicit Places using invariants in 1617 ms returned []
// Phase 1: matrix 2449 rows 2560 cols
[2025-06-01 03:43:00] [INFO ] Invariants computation overflowed in 65 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:43:02] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:43:32] [INFO ] Performed 5/2560 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 03:44:02] [INFO ] Performed 278/2560 implicitness test of which 7 returned IMPLICIT in 60 seconds.
[2025-06-01 03:44:32] [INFO ] Performed 470/2560 implicitness test of which 18 returned IMPLICIT in 90 seconds.
[2025-06-01 03:45:02] [INFO ] Performed 636/2560 implicitness test of which 30 returned IMPLICIT in 120 seconds.
[2025-06-01 03:45:33] [INFO ] Performed 781/2560 implicitness test of which 39 returned IMPLICIT in 150 seconds.
[2025-06-01 03:45:40] [INFO ] Implicit Places using invariants and state equation in 160109 ms returned [71, 205, 211, 235, 242, 262, 268, 289, 296, 320, 328, 352, 357, 433, 439, 459, 461, 466, 486, 492, 522, 526, 546, 552, 573, 579, 601, 608, 631, 636, 659, 665, 687, 693, 716, 722, 744, 746, 750, 805, 810]
[2025-06-01 03:45:40] [INFO ] Actually due to overlaps returned [439, 810, 211, 526, 205, 433, 461, 805, 71]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 161753 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 2551/2583 places, 2449/2456 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2551 transition count 2446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 2548 transition count 2446
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 2548 transition count 2446
Applied a total of 8 rules in 449 ms. Remains 2548 /2551 variables (removed 3) and now considering 2446/2449 (removed 3) transitions.
// Phase 1: matrix 2446 rows 2548 cols
[2025-06-01 03:45:41] [INFO ] Invariants computation overflowed in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:45:42] [INFO ] Implicit Places using invariants in 1547 ms returned []
// Phase 1: matrix 2446 rows 2548 cols
[2025-06-01 03:45:42] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:45:44] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:46:14] [INFO ] Performed 7/2548 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 03:46:55] [INFO ] Performed 245/2548 implicitness test of which 2 returned IMPLICIT in 71 seconds.
SDD proceeding with computation,16 properties remain. new max is 8388608
SDD size :3.31085e+11 after 7.34743e+11
[2025-06-01 03:48:23] [INFO ] Implicit Places using invariants and state equation in 160084 ms returned [232, 239]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161643 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 2546/2583 places, 2446/2456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2546 transition count 2445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2545 transition count 2445
Applied a total of 2 rules in 294 ms. Remains 2545 /2546 variables (removed 1) and now considering 2445/2446 (removed 1) transitions.
// Phase 1: matrix 2445 rows 2545 cols
[2025-06-01 03:48:23] [INFO ] Invariants computation overflowed in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:48:24] [INFO ] Implicit Places using invariants in 1556 ms returned []
// Phase 1: matrix 2445 rows 2545 cols
[2025-06-01 03:48:24] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:48:26] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:48:57] [INFO ] Performed 5/2545 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 03:50:47] [INFO ] Performed 58/2545 implicitness test of which 0 returned IMPLICIT in 141 seconds.
[2025-06-01 03:50:47] [INFO ] Timeout of Implicit test with SMT after 141 seconds.
[2025-06-01 03:50:47] [INFO ] Implicit Places using invariants and state equation in 142842 ms returned []
Implicit Place search using SMT with State Equation took 144416 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 2545/2583 places, 2445/2456 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 955118 ms. Remains : 2545/2583 places, 2445/2456 transitions.
RANDOM walk for 40000 steps (5172 resets) in 338 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (349 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (348 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (348 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (329 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (326 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (354 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (342 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (340 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (348 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (351 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (333 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (343 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (334 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (327 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (327 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (336 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 97917 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 16
Probabilistic random walk after 97917 steps, saw 48969 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 2445 rows 2545 cols
[2025-06-01 03:50:51] [INFO ] Invariants computation overflowed in 56 ms
[2025-06-01 03:50:51] [INFO ] State equation strengthened by 349 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/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 554/721 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/721 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/721 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2468/3189 variables, 1030/1204 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3189 variables, 169/1373 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3189 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4897/4990 variables, and 2639 constraints, problems are : Problem set: 0 solved, 16 unsolved in 75035 ms.
Refiners :[State Equation: 2463/2545 constraints, ReadFeed: 176/349 constraints, PredecessorRefiner: 16/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 554/721 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/721 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/721 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2468/3189 variables, 1030/1204 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3189 variables, 169/1373 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3189 variables, 11/1384 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:14] [INFO ] Deduced a trap along path composed of 2 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:15] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:15] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:15] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:15] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:15] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:16] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:17] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:18] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 03:52:18] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3189 variables, 6/1390 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3189 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4897/4990 variables, and 2656 constraints, problems are : Problem set: 0 solved, 16 unsolved in 75025 ms.
Refiners :[State Equation: 2463/2545 constraints, ReadFeed: 176/349 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/22 constraints]
After SMT, in 150166ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 2545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2545/2545 places, 2445/2445 transitions.
Applied a total of 0 rules in 146 ms. Remains 2545 /2545 variables (removed 0) and now considering 2445/2445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 2545/2545 places, 2445/2445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2545/2545 places, 2445/2445 transitions.
Applied a total of 0 rules in 133 ms. Remains 2545 /2545 variables (removed 0) and now considering 2445/2445 (removed 0) transitions.
// Phase 1: matrix 2445 rows 2545 cols
[2025-06-01 03:53:21] [INFO ] Invariants computation overflowed in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:53:24] [INFO ] Implicit Places using invariants in 2675 ms returned []
// Phase 1: matrix 2445 rows 2545 cols
[2025-06-01 03:53:24] [INFO ] Invariants computation overflowed in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 03:53:25] [INFO ] State equation strengthened by 349 read => feed constraints.
[2025-06-01 03:53:56] [INFO ] Performed 3/2545 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 03:54:28] [INFO ] Performed 57/2545 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2025-06-01 03:55:48] [INFO ] Performed 58/2545 implicitness test of which 0 returned IMPLICIT in 143 seconds.
[2025-06-01 03:55:48] [INFO ] Timeout of Implicit test with SMT after 143 seconds.
[2025-06-01 03:55:48] [INFO ] Implicit Places using invariants and state equation in 144565 ms returned []
Implicit Place search using SMT with State Equation took 147244 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 03:55:49] [INFO ] Redundant transitions in 146 ms returned []
Running 2444 sub problems to find dead transitions.
// Phase 1: matrix 2445 rows 2545 cols
[2025-06-01 03:55:49] [INFO ] Invariants computation overflowed in 62 ms
[2025-06-01 03:55:49] [INFO ] State equation strengthened by 349 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2544/4990 variables, and 0 constraints, problems are : Problem set: 0 solved, 2444 unsolved in 30075 ms.
Refiners :[State Equation: 0/2545 constraints, ReadFeed: 0/349 constraints, PredecessorRefiner: 2444/2415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2444 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2544/4990 variables, and 0 constraints, problems are : Problem set: 0 solved, 2444 unsolved in 30049 ms.
Refiners :[State Equation: 0/2545 constraints, ReadFeed: 0/349 constraints, PredecessorRefiner: 29/2415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61443ms problems are : Problem set: 0 solved, 2444 unsolved
Search for dead transitions found 0 dead transitions in 61457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209016 ms. Remains : 2545/2545 places, 2445/2445 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 2545 transition count 2437
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 2537 transition count 2437
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 16 place count 2537 transition count 2277
Deduced a syphon composed of 160 places in 76 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 336 place count 2377 transition count 2277
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 346 place count 2367 transition count 2267
Iterating global reduction 2 with 10 rules applied. Total rules applied 356 place count 2367 transition count 2267
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 362 place count 2367 transition count 2261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 368 place count 2361 transition count 2261
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 2361 transition count 2260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 370 place count 2360 transition count 2260
Applied a total of 370 rules in 831 ms. Remains 2360 /2545 variables (removed 185) and now considering 2260/2445 (removed 185) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 2260 rows 2360 cols
[2025-06-01 03:56:51] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 03:56:52] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 04:00:37] [INFO ] After 223986ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2025-06-01 04:00:37] [INFO ] State equation strengthened by 3 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-01 04:03:03] [INFO ] Flatten gal took : 187 ms
[2025-06-01 04:03:03] [INFO ] Applying decomposition
[2025-06-01 04:03:03] [INFO ] Flatten gal took : 229 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/graph12097972055685044162.txt' '-o' '/tmp/graph12097972055685044162.bin' '-w' '/tmp/graph12097972055685044162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12097972055685044162.bin' '-l' '-1' '-v' '-w' '/tmp/graph12097972055685044162.weights' '-q' '0' '-e' '0.001'
[2025-06-01 04:03:04] [INFO ] Decomposing Gal with order
[2025-06-01 04:03:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 04:03:06] [INFO ] Removed a total of 1435 redundant transitions.
[2025-06-01 04:03:07] [INFO ] Flatten gal took : 615 ms
[2025-06-01 04:03:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 274 ms.
[2025-06-01 04:03:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10546235796638679540.gal : 95 ms
[2025-06-01 04:03:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6722053817513387327.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/ReachabilityCardinality10546235796638679540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6722053817513387327.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
Loading property file /tmp/ReachabilityCardinality6722053817513387327.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 26
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :26 after 41
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :41 after 77
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :77 after 147
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :147 after 514
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :514 after 2700
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :2700 after 25300
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :25300 after 188822
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :188822 after 681213
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :681213 after 1.60335e+06
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :1.60335e+06 after 6.00069e+07
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :6.00069e+07 after 7.1083e+08
SDD proceeding with computation,16 properties remain. new max is 262144
SDD size :7.1083e+08 after 3.17417e+09
[2025-06-01 04:03:54] [INFO ] After 196704ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :5 sat :6
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:03:55] [INFO ] Deduced a trap composed of 10 places in 1001 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,16 properties remain. new max is 524288
SDD size :3.17417e+09 after 1.11055e+10
[2025-06-01 04:03:57] [INFO ] Deduced a trap composed of 13 places in 955 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:03:58] [INFO ] Deduced a trap composed of 16 places in 974 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:03:59] [INFO ] Deduced a trap composed of 20 places in 972 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:00] [INFO ] Deduced a trap composed of 21 places in 908 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:01] [INFO ] Deduced a trap composed of 24 places in 913 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:02] [INFO ] Deduced a trap composed of 27 places in 919 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:03] [INFO ] Deduced a trap composed of 28 places in 891 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:04] [INFO ] Deduced a trap composed of 31 places in 913 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:05] [INFO ] Deduced a trap composed of 35 places in 876 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:06] [INFO ] Deduced a trap composed of 37 places in 862 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:07] [INFO ] Deduced a trap composed of 43 places in 890 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:08] [INFO ] Deduced a trap composed of 45 places in 877 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:09] [INFO ] Deduced a trap composed of 46 places in 878 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:10] [INFO ] Deduced a trap composed of 51 places in 877 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:11] [INFO ] Deduced a trap composed of 57 places in 907 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:12] [INFO ] Deduced a trap composed of 58 places in 867 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:13] [INFO ] Deduced a trap composed of 64 places in 857 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 04:04:14] [INFO ] Deduced a trap composed of 83 places in 848 ms of which 75 ms to minimize.
[2025-06-01 04:04:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 19295 ms
TRAPS : Iteration 1
[2025-06-01 04:04:22] [INFO ] After 224767ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
[2025-06-01 04:04:22] [INFO ] After 450055ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2025-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2025-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2025-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2025-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-2025-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -5 properties in 452103 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 04:04:23] [INFO ] Flatten gal took : 182 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13796400284848267122
[2025-06-01 04:04:23] [INFO ] Too many transitions (2445) to apply POR reductions. Disabling POR matrices.
[2025-06-01 04:04:23] [INFO ] Applying decomposition
[2025-06-01 04:04:23] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13796400284848267122
Running compilation step : cd /tmp/ltsmin13796400284848267122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '65' '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-06-01 04:04:23] [INFO ] Flatten gal took : 212 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/graph803444217521612572.txt' '-o' '/tmp/graph803444217521612572.bin' '-w' '/tmp/graph803444217521612572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph803444217521612572.bin' '-l' '-1' '-v' '-w' '/tmp/graph803444217521612572.weights' '-q' '0' '-e' '0.001'
[2025-06-01 04:04:23] [INFO ] Decomposing Gal with order
[2025-06-01 04:04:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 04:04:24] [INFO ] Removed a total of 3945 redundant transitions.
[2025-06-01 04:04:24] [INFO ] Flatten gal took : 245 ms
[2025-06-01 04:04:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 797 labels/synchronizations in 243 ms.
[2025-06-01 04:04:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11246285389364249777.gal : 28 ms
[2025-06-01 04:04:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1549975443040591178.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/ReachabilityCardinality11246285389364249777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1549975443040591178.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
Loading property file /tmp/ReachabilityCardinality1549975443040591178.prop.
Compilation finished in 7291 ms.
Running link step : cd /tmp/ltsmin13796400284848267122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202501==true'
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :17 after 30
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :30 after 43
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :43 after 76
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :76 after 253
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :253 after 566
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :566 after 1333
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1333 after 5726
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :5726 after 22681
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :22681 after 60832
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :60832 after 160832
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :160832 after 355349
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :355349 after 753781
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202501==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202502==true'
SDD proceeding with computation,11 properties remain. new max is 262144
SDD size :753781 after 1.44287e+08
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202502==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202504==true'
SDD proceeding with computation,11 properties remain. new max is 524288
SDD size :1.44287e+08 after 8.59623e+08
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202508==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202508==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202510==true'
SDD proceeding with computation,11 properties remain. new max is 1048576
SDD size :8.59623e+08 after 2.82759e+09
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202510==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202511==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202511==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202312==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202312==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202313==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202313==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202414==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202414==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202415==true'
WARNING : LTSmin timed out (>29 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202415==true'
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202501==true'
SDD proceeding with computation,11 properties remain. new max is 2097152
SDD size :2.82759e+09 after 7.84078e+09
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202501==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202502==true'
SDD proceeding with computation,11 properties remain. new max is 4194304
SDD size :7.84078e+09 after 1.15807e+10
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202502==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202504==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202505==true'
SDD proceeding with computation,11 properties remain. new max is 8388608
SDD size :1.15807e+10 after 3.12695e+10
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202508==true'
WARNING : LTSmin timed out (>237 s) on command cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202508==true'
Running LTSmin : cd /tmp/ltsmin13796400284848267122;'/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' 'DoubleExponentPT100ReachabilityCardinality202510==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-100"
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 DoubleExponent-PT-100, 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 r072-tall-174860067600510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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