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

About the Execution of ITS-Tools for Peterson-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1720290.00 0.00 0.00 TFFTTFTTFFTTTTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 234K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 469K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-ReachabilityFireability-2025-00
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-01
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-02
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-03
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-04
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-05
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-06
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-07
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-08
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-09
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-10
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-11
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-12
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-13
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-14
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748943381711

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 09:36:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 09:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:36:23] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-06-03 09:36:23] [INFO ] Transformed 480 places.
[2025-06-03 09:36:23] [INFO ] Transformed 690 transitions.
[2025-06-03 09:36:23] [INFO ] Found NUPN structural information;
[2025-06-03 09:36:23] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
[2025-06-03 09:36:24] [INFO ] Flatten gal took : 181 ms
[2025-06-03 09:36:24] [INFO ] Flatten gal took : 82 ms
RANDOM walk for 40000 steps (8 resets) in 3131 ms. (12 steps per ms) remains 11/15 properties
FORMULA Peterson-PT-4-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 09:36:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11705280665887359211.gal : 82 ms
[2025-06-03 09:36:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3229898690828745057.prop : 24 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/ReachabilityCardinality11705280665887359211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3229898690828745057.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/ReachabilityCardinality3229898690828745057.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 3129 ms. (12 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :11 after 33
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :33 after 51
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :51 after 156
BEST_FIRST walk for 40004 steps (8 resets) in 779 ms. (51 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :156 after 247
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :247 after 1253
BEST_FIRST walk for 40004 steps (8 resets) in 1355 ms. (29 steps per ms) remains 9/11 properties
FORMULA Peterson-PT-4-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1253 after 4497
BEST_FIRST walk for 40004 steps (8 resets) in 1417 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
[2025-06-03 09:36:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2025-06-03 09:36:26] [INFO ] Computed 19 invariants in 36 ms
[2025-06-03 09:36:26] [INFO ] State equation strengthened by 116 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :4497 after 8990
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 447/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 5/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 33/480 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 33/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 630/1110 variables, 480/979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 116/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :8990 after 50849
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1095 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5435 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 447/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 5/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 33/480 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 33/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:34] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:34] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:34] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:34] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:34] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:35] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:35] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:35] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:35] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:35] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:36] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:36] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:36] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:36] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:37] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:37] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:37] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 25 ms to minimize.
SMT process timed out in 10737ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 447 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 33 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 480/480 places, 690/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 704 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4120 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1233 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :50849 after 185355
Interrupted probabilistic random walk after 694566 steps, run timeout after 6001 ms. (steps per millisecond=115 ) properties seen :0 out of 9
Probabilistic random walk after 694566 steps, saw 135504 distinct states, run finished after 6006 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-03 09:36:45] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-03 09:36:45] [INFO ] Invariant cache hit.
[2025-06-03 09:36:45] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 447/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 5/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 33/480 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 33/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 630/1110 variables, 480/979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 116/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1095 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3967 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 447/447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 5/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 33/480 variables, 5/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 33/499 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:50] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:50] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:51] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:51] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:51] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:51] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:52] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:52] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:52] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:52] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:52] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:52] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:53] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:53] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:53] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:53] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:54] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:54] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:54] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:54] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:56] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:56] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:56] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:56] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:56] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:57] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:57] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:57] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:57] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:58] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:36:58] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:02] [INFO ] Deduced a trap composed of 43 places in 3498 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:02] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:02] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:08] [INFO ] Deduced a trap composed of 70 places in 5857 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:12] [INFO ] Deduced a trap composed of 65 places in 3933 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :185355 after 447551
[2025-06-03 09:37:17] [INFO ] Deduced a trap composed of 66 places in 4820 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:20] [INFO ] Deduced a trap composed of 45 places in 2027 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:27] [INFO ] Deduced a trap composed of 42 places in 7224 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:27] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:30] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:31] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:31] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:32] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:37:38] [INFO ] Deduced a trap composed of 78 places in 6629 ms of which 80 ms to minimize.
SMT process timed out in 53342ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 447 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 29 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2025-06-03 09:37:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-03 09:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:37:39] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-03 09:37:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-03 09:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:37:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-03 09:37:39] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:37:39] [INFO ] Redundant transitions in 50 ms returned []
Running 685 sub problems to find dead transitions.
[2025-06-03 09:37:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-03 09:37:39] [INFO ] Invariant cache hit.
[2025-06-03 09:37:39] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:01] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:01] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:01] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:01] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:01] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:02] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:02] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:02] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:02] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:02] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:02] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:03] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:04] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30050 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:24] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:25] [INFO ] Deduced a trap composed of 88 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:25] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:25] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:25] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:26] [INFO ] Deduced a trap composed of 58 places in 193 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:26] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:26] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:26] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:26] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:27] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:27] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:27] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:27] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:27] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:28] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:28] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:28] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:28] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:29] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 11 ms to minimize.
Invariant property Peterson-PT-4-ReachabilityFireability-2025-05 does not hold.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:35] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:35] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:36] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:36] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:36] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:37] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:37] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:37] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:37] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:38] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:38] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:38] [INFO ] Deduced a trap composed of 91 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:38] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:39] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:39] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:39] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:39] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:39] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:38:40] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 15 ms to minimize.
SMT process timed out in 60312ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61142 ms. Remains : 480/480 places, 690/690 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 480 transition count 630
Applied a total of 60 rules in 30 ms. Remains 480 /480 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 630 rows 480 cols
[2025-06-03 09:38:40] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 09:38:40] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 09:38:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2025-06-03 09:38:40] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-03 09:38:42] [INFO ] After 818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2025-06-03 09:38:43] [INFO ] After 1692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2025-06-03 09:38:43] [INFO ] After 3217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2025-06-03 09:38:43] [INFO ] Flatten gal took : 36 ms
[2025-06-03 09:38:43] [INFO ] Flatten gal took : 38 ms
[2025-06-03 09:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16525160599215088915.gal : 11 ms
[2025-06-03 09:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16770700185826327111.prop : 3 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/ReachabilityCardinality16525160599215088915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16770700185826327111.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/ReachabilityCardinality16770700185826327111.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :12 after 18
Invariant property Peterson-PT-4-ReachabilityFireability-2025-09 does not hold.
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :18 after 21
Reachability property Peterson-PT-4-ReachabilityFireability-2025-10 is true.
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :21 after 23
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :23 after 237
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :237 after 362
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :362 after 844
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :844 after 7155
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :7155 after 149657
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :149657 after 1.03099e+06
Detected timeout of ITS tools.
[2025-06-03 09:38:59] [INFO ] Flatten gal took : 29 ms
[2025-06-03 09:38:59] [INFO ] Applying decomposition
[2025-06-03 09:38:59] [INFO ] Flatten gal took : 21 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/graph11366253156425936102.txt' '-o' '/tmp/graph11366253156425936102.bin' '-w' '/tmp/graph11366253156425936102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11366253156425936102.bin' '-l' '-1' '-v' '-w' '/tmp/graph11366253156425936102.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:38:59] [INFO ] Decomposing Gal with order
[2025-06-03 09:38:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:38:59] [INFO ] Removed a total of 230 redundant transitions.
[2025-06-03 09:38:59] [INFO ] Flatten gal took : 90 ms
[2025-06-03 09:38:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2025-06-03 09:38:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4358346065650258554.gal : 10 ms
[2025-06-03 09:38:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16002375961812025223.prop : 9 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/ReachabilityCardinality4358346065650258554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16002375961812025223.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16002375961812025223.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 23
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :23 after 529
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :529 after 529
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.69056e+12,0.461997,19720,1069,25,33143,810,2524,28787,83,2381,0
Total reachable state count : 3690562500000

Verifying 7 reachability properties.
Invariant property Peterson-PT-4-ReachabilityFireability-2025-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-02,6.06272e+09,2.18266,89864,10528,100,185011,810,4740,307139,103,2381,279987
Invariant property Peterson-PT-4-ReachabilityFireability-2025-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-03,1.6311e+10,2.61469,106248,3298,47,219221,810,5927,374819,103,2381,316205
Invariant property Peterson-PT-4-ReachabilityFireability-2025-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-08,6.37672e+08,2.62787,106504,713,26,221010,810,5951,376403,103,2381,320005
Reachability property Peterson-PT-4-ReachabilityFireability-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-12,13824,2.62857,106760,160,21,221027,810,5951,376403,103,2381,320005
Reachability property Peterson-PT-4-ReachabilityFireability-2025-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-13,5.31693e+06,2.64031,106888,404,28,222544,810,5995,377754,104,2381,323643
Reachability property Peterson-PT-4-ReachabilityFireability-2025-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-14,288,2.64633,107144,150,17,223240,810,6050,378308,104,2381,324851
Reachability property Peterson-PT-4-ReachabilityFireability-2025-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-15,331776,2.64669,107272,167,21,223259,810,6050,378308,104,2381,324851
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 22228 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 09:39:02] [INFO ] Flatten gal took : 30 ms
[2025-06-03 09:39:02] [INFO ] Applying decomposition
[2025-06-03 09:39:02] [INFO ] Flatten gal took : 23 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/graph17802096522822516690.txt' '-o' '/tmp/graph17802096522822516690.bin' '-w' '/tmp/graph17802096522822516690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17802096522822516690.bin' '-l' '-1' '-v' '-w' '/tmp/graph17802096522822516690.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:39:02] [INFO ] Decomposing Gal with order
[2025-06-03 09:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:39:02] [INFO ] Removed a total of 500 redundant transitions.
[2025-06-03 09:39:02] [INFO ] Flatten gal took : 45 ms
[2025-06-03 09:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 7 ms.
[2025-06-03 09:39:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5302745651603984625.gal : 7 ms
[2025-06-03 09:39:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10941102428368398061.prop : 3 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/ReachabilityCardinality5302745651603984625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10941102428368398061.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality10941102428368398061.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 958
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :958 after 2487
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :2487 after 2934
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :2934 after 72540
Reachability property Peterson-PT-4-ReachabilityFireability-2025-10 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Peterson-PT-4-ReachabilityFireability-2025-09 does not hold.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :72540 after 8.7849e+06
Invariant property Peterson-PT-4-ReachabilityFireability-2025-08 does not hold.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :8.7849e+06 after 5.06939e+07
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :5.06939e+07 after 5.23731e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :5.23731e+07 after 5.4193e+07
Invariant property Peterson-PT-4-ReachabilityFireability-2025-02 does not hold.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :5.4193e+07 after 1.57334e+08
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.57334e+08 after 1.66345e+08
Reachability property Peterson-PT-4-ReachabilityFireability-2025-15 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Peterson-PT-4-ReachabilityFireability-2025-13 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4.38446e+08 after 4.38446e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.29947e+08,1495.11,7706120,41514,442,2.91402e+06,11968,1699,9.03902e+07,181,90410,0
Total reachable state count : 629946518

Verifying 9 reachability properties.
Invariant property Peterson-PT-4-ReachabilityFireability-2025-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-02,159549,1529.17,7706120,15292,353,2.91402e+06,11968,5795,9.03902e+07,297,90410,2485624
Invariant property Peterson-PT-4-ReachabilityFireability-2025-03 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-03,0,1550.95,7706120,1,0,2.91402e+06,11968,7049,9.03902e+07,300,90410,3108164
Invariant property Peterson-PT-4-ReachabilityFireability-2025-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-08,4288,1554.23,7706120,435,83,2.91402e+06,11968,7097,9.03902e+07,300,90410,3227267
Invariant property Peterson-PT-4-ReachabilityFireability-2025-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-09,104256,1554.56,7706120,1244,121,2.91402e+06,11968,7101,9.03902e+07,300,90410,3241420
Reachability property Peterson-PT-4-ReachabilityFireability-2025-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-10,147,1554.56,7706120,151,36,2.91402e+06,11968,7104,9.03902e+07,300,90410,3241422
Reachability property Peterson-PT-4-ReachabilityFireability-2025-12 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-12,96,1554.56,7706120,144,31,2.91402e+06,11968,7104,9.03902e+07,300,90410,3241427
Reachability property Peterson-PT-4-ReachabilityFireability-2025-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-13,582308,1556.06,7706120,3676,170,2.91402e+06,11968,7166,9.03902e+07,302,90410,3284552
Reachability property Peterson-PT-4-ReachabilityFireability-2025-14 does not hold.
FORMULA Peterson-PT-4-ReachabilityFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : Peterson-PT-4-ReachabilityFireability-2025-14

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-14,0,1556.1,7706120,1,0,2.91402e+06,11968,7225,9.03902e+07,303,90410,3299878
Reachability property Peterson-PT-4-ReachabilityFireability-2025-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-2025-15,192,1556.11,7706120,156,38,2.91402e+06,11968,7227,9.03902e+07,303,90410,3299878
All properties solved without resorting to model-checking.
Total runtime 1719027 ms.

BK_STOP 1748945102001

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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