fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r100-smll-174867007800350
Last Updated
June 24, 2025

About the Execution of ITS-Tools for GPPP-PT-C0100N0000100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 387815.00 0.00 0.00 TTFFTFTTFT?TTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007800350.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 GPPP-PT-C0100N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007800350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-00
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-01
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-02
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-03
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-04
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-05
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-06
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-07
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-08
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-09
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748942648886

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000100000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-03 09:24:10] [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-03 09:24:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:24:11] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2025-06-03 09:24:11] [INFO ] Transformed 33 places.
[2025-06-03 09:24:11] [INFO ] Transformed 22 transitions.
[2025-06-03 09:24:11] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40942 steps (12 resets) in 417 ms. (97 steps per ms) remains 14/15 properties
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 09:24:11] [INFO ] Flatten gal took : 36 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1467 ms. (27 steps per ms) remains 14/14 properties
[2025-06-03 09:24:11] [INFO ] Flatten gal took : 21 ms
[2025-06-03 09:24:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3196237293308475972.gal : 12 ms
[2025-06-03 09:24:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3954864732756343602.prop : 12 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/ReachabilityCardinality3196237293308475972.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3954864732756343602.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 ...328
Loading property file /tmp/ReachabilityCardinality3954864732756343602.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2025-06-03 09:24:12] [INFO ] Flatten gal took : 28 ms
[2025-06-03 09:24:12] [INFO ] Applying decomposition
[2025-06-03 09:24:12] [INFO ] Flatten gal took : 13 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1184 ms. (33 steps per ms) remains 14/14 properties
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/graph11739273362750799865.txt' '-o' '/tmp/graph11739273362750799865.bin' '-w' '/tmp/graph11739273362750799865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11739273362750799865.bin' '-l' '-1' '-v' '-w' '/tmp/graph11739273362750799865.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:24:12] [INFO ] Decomposing Gal with order
[2025-06-03 09:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
BEST_FIRST walk for 40004 steps (8 resets) in 716 ms. (55 steps per ms) remains 14/14 properties
[2025-06-03 09:24:12] [INFO ] Removed a total of 12 redundant transitions.
[2025-06-03 09:24:12] [INFO ] Flatten gal took : 130 ms
[2025-06-03 09:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
BEST_FIRST walk for 40003 steps (8 resets) in 553 ms. (72 steps per ms) remains 14/14 properties
[2025-06-03 09:24:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15695957022051991350.gal : 5 ms
[2025-06-03 09:24:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6593841582612683760.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15695957022051991350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6593841582612683760.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/ReachabilityCardinality6593841582612683760.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 257 ms. (155 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 1131720 steps, run timeout after 6001 ms. (steps per millisecond=188 ) properties seen :0 out of 14
Probabilistic random walk after 1131720 steps, saw 193589 distinct states, run finished after 6007 ms. (steps per millisecond=188 ) properties seen :0
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 09:24:19] [INFO ] Computed 12 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-01 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-03 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-06 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-07 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-11 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-14 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-15 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 7 unsolved
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-02 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-04 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-05 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-08 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-09 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-13 is UNSAT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/12 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 13 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/22 variables, 5/5 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/31 variables, 6/11 constraints. Problems are: Problem set: 13 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 31/55 variables, and 11 constraints, problems are : Problem set: 13 solved, 1 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1529ms problems are : Problem set: 13 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Applied a total of 5 rules in 34 ms. Remains 30 /33 variables (removed 3) and now considering 18/22 (removed 4) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 30 cols
[2025-06-03 09:24:20] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem TDEAD14 is UNSAT
At refinement iteration 6 (OVERLAPS) 18/48 variables, 30/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 42 constraints, problems are : Problem set: 1 solved, 16 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 18/48 variables, 30/42 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 58 constraints, problems are : Problem set: 1 solved, 16 unsolved in 18769 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19257ms problems are : Problem set: 1 solved, 16 unsolved
Search for dead transitions found 1 dead transitions in 19258ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/33 places, 17/22 transitions.
Graph (complete) has 76 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 29 /30 variables (removed 1) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19319 ms. Remains : 29/33 places, 17/22 transitions.
RANDOM walk for 40578 steps (12 resets) in 124 ms. (324 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2699949 steps, run timeout after 3001 ms. (steps per millisecond=899 ) properties seen :0 out of 1
Probabilistic random walk after 2699949 steps, saw 458591 distinct states, run finished after 3001 ms. (steps per millisecond=899 ) properties seen :0
// Phase 1: matrix 17 rows 29 cols
[2025-06-03 09:24:43] [INFO ] Computed 12 invariants in 2 ms
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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/26 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/44 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/46 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/46 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 26/46 variables, and 10 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/29 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9150ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 17/17 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 29/29 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2025-06-03 09:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:24:52] [INFO ] Implicit Places using invariants in 107 ms returned [3, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/29 places, 17/17 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 15
Applied a total of 4 rules in 4 ms. Remains 25 /27 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 25 cols
[2025-06-03 09:24:52] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:24:52] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-03 09:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:24:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [1, 3, 5]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 180 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 22/29 places, 15/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 306 ms. Remains : 22/29 places, 15/17 transitions.
RANDOM walk for 40608 steps (12 resets) in 54 ms. (738 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3032106 steps, run timeout after 3001 ms. (steps per millisecond=1010 ) properties seen :0 out of 1
Probabilistic random walk after 3032106 steps, saw 592078 distinct states, run finished after 3001 ms. (steps per millisecond=1010 ) properties seen :0
// Phase 1: matrix 15 rows 22 cols
[2025-06-03 09:24:55] [INFO ] Computed 7 invariants in 4 ms
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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/21 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/36 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 21/37 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15058 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15136ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 22/22 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-03 09:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:25:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-03 09:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:25:11] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:25:11] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-03 09:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/37 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 22/37 variables, and 7 constraints, problems are : Problem set: 0 solved, 14 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30346ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 30347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30465 ms. Remains : 22/22 places, 15/15 transitions.
[2025-06-03 09:25:41] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16636367916858674564
[2025-06-03 09:25:41] [INFO ] Applying decomposition
[2025-06-03 09:25:41] [INFO ] Flatten gal took : 3 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/graph5190046856503151400.txt' '-o' '/tmp/graph5190046856503151400.bin' '-w' '/tmp/graph5190046856503151400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5190046856503151400.bin' '-l' '-1' '-v' '-w' '/tmp/graph5190046856503151400.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:25:41] [INFO ] Decomposing Gal with order
[2025-06-03 09:25:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:25:41] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2025-06-03 09:25:41] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 09:25:41] [INFO ] Flatten gal took : 7 ms
[2025-06-03 09:25:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 09:25:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality502579080990027165.gal : 2 ms
[2025-06-03 09:25:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14797619360243202629.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/ReachabilityCardinality502579080990027165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14797619360243202629.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-06-03 09:25:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:25:41] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2025-06-03 09:25:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:25:41] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2025-06-03 09:25:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality14797619360243202629.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2025-06-03 09:25:41] [INFO ] Flatten gal took : 3 ms
[2025-06-03 09:25:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7736137212621318090.gal : 0 ms
[2025-06-03 09:25:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11288717973932973627.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/ReachabilityCardinality7736137212621318090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11288717973932973627.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/ReachabilityCardinality11288717973932973627.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
[2025-06-03 09:25:41] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16636367916858674564
ITS-tools command line returned an error code 1
[2025-06-03 09:25:41] [INFO ] Flatten gal took : 2 ms
[2025-06-03 09:25:41] [INFO ] Input system was already deterministic with 15 transitions.
[2025-06-03 09:25:41] [INFO ] Transformed 22 places.
[2025-06-03 09:25:41] [INFO ] Transformed 15 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Running compilation step : cd /tmp/ltsmin16636367916858674564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 09:25:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15154204951649101341.gal : 1 ms
[2025-06-03 09:25:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13312165531958818982.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/ReachabilityCardinality15154204951649101341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13312165531958818982.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...375
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality13312165531958818982.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Compilation finished in 322 ms.
Running link step : cd /tmp/ltsmin16636367916858674564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16636367916858674564;'/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' 'GPPPPTC0100N0000100000ReachabilityCardinality202510==true'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 16, guards 15
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 0.010: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.010: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.020: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.011: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.011: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.020: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.020: State length is 22, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.020: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.020: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.020: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.020: Visible groups: 0 / 15, labels: 1 / 16
pins2lts-mc-linux64( 0/ 8), 0.020: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.020: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.011: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.011: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.021: "GPPPPTC0100N0000100000ReachabilityCardinality202510==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.051: ~11 levels ~960 states ~3680 transitions
pins2lts-mc-linux64( 0/ 8), 0.068: ~13 levels ~1920 states ~7872 transitions
pins2lts-mc-linux64( 0/ 8), 0.098: ~16 levels ~3840 states ~17008 transitions
pins2lts-mc-linux64( 0/ 8), 0.155: ~20 levels ~7680 states ~36536 transitions
pins2lts-mc-linux64( 0/ 8), 0.267: ~23 levels ~15360 states ~79440 transitions
pins2lts-mc-linux64( 0/ 8), 0.505: ~25 levels ~30720 states ~170840 transitions
pins2lts-mc-linux64( 2/ 8), 0.876: ~13 levels ~61440 states ~355312 transitions
pins2lts-mc-linux64( 5/ 8), 1.493: ~18 levels ~122880 states ~754864 transitions
pins2lts-mc-linux64( 5/ 8), 2.393: ~21 levels ~245760 states ~1555152 transitions
pins2lts-mc-linux64( 4/ 8), 3.454: ~29 levels ~491520 states ~3064008 transitions
pins2lts-mc-linux64( 4/ 8), 4.814: ~32 levels ~983040 states ~6190808 transitions
pins2lts-mc-linux64( 4/ 8), 6.283: ~38 levels ~1966080 states ~12352520 transitions
pins2lts-mc-linux64( 4/ 8), 9.852: ~42 levels ~3932160 states ~24993568 transitions
pins2lts-mc-linux64( 4/ 8), 16.522: ~48 levels ~7864320 states ~50083240 transitions
pins2lts-mc-linux64( 4/ 8), 30.109: ~54 levels ~15728640 states ~101033600 transitions
pins2lts-mc-linux64( 4/ 8), 59.008: ~61 levels ~31457280 states ~204803392 transitions
pins2lts-mc-linux64( 4/ 8), 117.437: ~70 levels ~62914560 states ~412753672 transitions
pins2lts-mc-linux64( 4/ 8), 244.202: ~80 levels ~125829120 states ~831341176 transitions
pins2lts-mc-linux64( 2/ 8), 294.384: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 294.438:
pins2lts-mc-linux64( 0/ 8), 294.438: mean standard work distribution: 4.3% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 294.438:
pins2lts-mc-linux64( 0/ 8), 294.438: Explored 124153930 states 869399220 transitions, fanout: 7.003
pins2lts-mc-linux64( 0/ 8), 294.438: Total exploration time 294.420 sec (294.370 sec minimum, 294.399 sec on average)
pins2lts-mc-linux64( 0/ 8), 294.438: States per second: 421690, Transitions per second: 2952922
pins2lts-mc-linux64( 0/ 8), 294.438: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 294.438:
pins2lts-mc-linux64( 0/ 8), 294.438: Queue width: 8B, total height: 11732198, memory: 89.51MB
pins2lts-mc-linux64( 0/ 8), 294.438: Tree memory: 1044.1MB, 8.2 B/state, compr.: 9.1%
pins2lts-mc-linux64( 0/ 8), 294.438: Tree fill ratio (roots/leafs): 99.0%/7.0%
pins2lts-mc-linux64( 0/ 8), 294.438: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 294.439: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 294.439: Est. total memory use: 1133.6MB (~1113.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16636367916858674564;'/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' 'GPPPPTC0100N0000100000ReachabilityCardinality202510==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16636367916858674564;'/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' 'GPPPPTC0100N0000100000ReachabilityCardinality202510==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Total runtime 385659 ms.

BK_STOP 1748943036701

--------------------
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="GPPP-PT-C0100N0000100000"
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 GPPP-PT-C0100N0000100000, 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 r100-smll-174867007800350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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