Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700089.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 13K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 203K Mar 3 18:30 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 IBM703-PT-none-CTLCardinality-2024-00
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-01
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-02
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-03
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-04
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-05
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-06
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-07
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-08
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-09
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-11
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779723226968

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 15:33:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:33:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:33:49] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2026-05-25 15:33:49] [INFO ] Transformed 262 places.
[2026-05-25 15:33:49] [INFO ] Transformed 284 transitions.
[2026-05-25 15:33:49] [INFO ] Found NUPN structural information;
[2026-05-25 15:33:49] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 101 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 257 transition count 284
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 13 place count 249 transition count 276
Iterating global reduction 1 with 8 rules applied. Total rules applied 21 place count 249 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 247 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 247 transition count 274
Applied a total of 25 rules in 174 ms. Remains 247 /262 variables (removed 15) and now considering 274/284 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12791689410084249176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13676324019723974587.kers'
[2026-05-25 15:33:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12791689410084249176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13676324019723974587.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 274 rows 247 cols 548 entries
Finished phase 1 with 247 SingleSign rule and 0 generalized
[2026-05-25 15:33:50] [INFO ] Computed 0 invariants in 3 ms
Computed 0 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13676324019723974587.kers
Total runtime 5 ms.
[2026-05-25 15:33:50] [INFO ] Implicit Places using invariants in 543 ms returned []
[2026-05-25 15:33:50] [INFO ] Invariant cache hit.
[2026-05-25 15:33:51] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2026-05-25 15:33:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 274/519 variables, 245/245 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 2/521 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 247 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30044 ms.
Refiners :[State Equation: 247/247 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 274/519 variables, 245/245 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 272/517 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 2/521 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 520 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30028 ms.
Refiners :[State Equation: 247/247 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Starting structural reductions in LTL mode, iteration 1 : 247/262 places, 274/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61789 ms. Remains : 247/262 places, 274/284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Applied a total of 0 rules in 11 ms. Remains 247 /247 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2026-05-25 15:34:51] [INFO ] Invariant cache hit.
[2026-05-25 15:34:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 15:34:51] [INFO ] Invariant cache hit.
[2026-05-25 15:34:52] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 247/247 places, 274/274 transitions.
Support contains 101 out of 247 places after structural reductions.
[2026-05-25 15:34:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 15:34:52] [INFO ] Flatten gal took : 86 ms
[2026-05-25 15:34:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM703-PT-none-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:34:52] [INFO ] Flatten gal took : 37 ms
[2026-05-25 15:34:52] [INFO ] Input system was already deterministic with 274 transitions.
Support contains 76 out of 247 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (709 resets) in 1744 ms. (22 steps per ms) remains 7/48 properties
BEST_FIRST walk for 40003 steps (465 resets) in 494 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (458 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (477 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (461 resets) in 280 ms. (142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (467 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (446 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (444 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
[2026-05-25 15:34:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 57/84 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 113/197 variables, 51/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 104/301 variables, 50/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 75/376 variables, 41/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 50/426 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 40/466 variables, 21/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 13 (OVERLAPS) 23/489 variables, 13/229 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/489 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 13/502 variables, 7/236 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/502 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 17 (OVERLAPS) 6/508 variables, 4/240 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/508 variables, 0/240 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/510 variables, 1/241 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/510 variables, 0/241 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/512 variables, 1/242 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/512 variables, 0/242 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/514 variables, 1/243 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/521 variables, and 243 constraints, problems are : Problem set: 4 solved, 3 unsolved in 5007 ms.
Refiners :[State Equation: 243/247 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/55 variables, 17/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 35/52 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/55 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/55 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/228 variables, 44/99 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/99 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 76/304 variables, 36/135 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 63/367 variables, 33/168 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/168 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 49/416 variables, 25/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 36/452 variables, 19/212 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/212 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 25/477 variables, 13/225 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 18 (OVERLAPS) 17/494 variables, 10/235 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/235 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 9/503 variables, 5/240 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/240 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Int declared 508/521 variables, and 243 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1853 ms.
Refiners :[State Equation: 240/247 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6884ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA IBM703-PT-none-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:35:00] [INFO ] Flatten gal took : 24 ms
[2026-05-25 15:35:00] [INFO ] Flatten gal took : 24 ms
[2026-05-25 15:35:00] [INFO ] Input system was already deterministic with 274 transitions.
Support contains 46 out of 247 places (down from 53) after GAL structural reductions.
Computed a total of 247 stabilizing places and 274 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 247 transition count 274
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA IBM703-PT-none-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 274
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 221 transition count 249
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 221 transition count 249
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 209 transition count 237
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 209 transition count 237
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 201 transition count 229
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 201 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 94 place count 201 transition count 226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 197 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 197 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 193 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 193 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 189 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 189 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 187 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 187 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 186 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 186 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 185 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 185 transition count 210
Applied a total of 126 rules in 91 ms. Remains 185 /247 variables (removed 62) and now considering 210/274 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10712759621221230148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16820206204619845218.kers'
[2026-05-25 15:35:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10712759621221230148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16820206204619845218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 185 cols 421 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-25 15:35:01] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16820206204619845218.kers
Total runtime 2 ms.
[2026-05-25 15:35:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 15:35:01] [INFO ] Invariant cache hit.
[2026-05-25 15:35:01] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2026-05-25 15:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 210/394 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 1/395 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/395 variables, and 185 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30020 ms.
Refiners :[State Equation: 185/185 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 210/394 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 209/393 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 1/395 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 394 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30012 ms.
Refiners :[State Equation: 185/185 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 185/247 places, 210/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 185/247 places, 210/274 transitions.
[2026-05-25 15:36:01] [INFO ] Flatten gal took : 11 ms
[2026-05-25 15:36:01] [INFO ] Flatten gal took : 11 ms
[2026-05-25 15:36:01] [INFO ] Input system was already deterministic with 210 transitions.
[2026-05-25 15:36:01] [INFO ] Flatten gal took : 12 ms
[2026-05-25 15:36:01] [INFO ] Flatten gal took : 12 ms
[2026-05-25 15:36:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality6291239966244541844.gal : 9 ms
[2026-05-25 15:36:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8619081041799605477.ctl : 10 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6291239966244541844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8619081041799605477.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4436,0.138493,6392,2,849,5,7022,6,0,949,10288,0


Converting to forward existential form...Done !
original formula: ((AG(AF(((task_s00000752_output_s00000264==0)&&(task_s00000754_inputCriterion_s00000257_used==1)))) + (AX((((merge_s00000445_activated==0...483
=> equivalent forward existential formula: ([(FwdU((Init * !((!(E(TRUE U !(!(EG(!(((task_s00000752_output_s00000264==0)&&(task_s00000754_inputCriterion_s00...977
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t28, t29, t30, t34, t36, t37, t41, t42, t46, t48, t53, t56, t57, t63, t71, t80, t12...306
Hit Full ! (commute/partial/dont) 208/0/2
(forward)formula 0,0,2.98049,72696,1,0,702,393796,460,371,5571,379980,879
FORMULA IBM703-PT-none-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Graph (complete) has 274 edges and 247 vertex of which 126 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.2 ms
Discarding 121 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 125 transition count 60
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 101 rules applied. Total rules applied 190 place count 38 transition count 46
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 200 place count 29 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 28 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 201 place count 28 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 24 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 210 place count 23 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 23 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 22 transition count 38
Ensure Unique test 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 4 with 3 rules applied. Total rules applied 216 place count 22 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 218 place count 21 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 21 transition count 30
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 224 place count 21 transition count 28
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 227 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 228 place count 18 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 229 place count 18 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 230 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 231 place count 17 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 232 place count 17 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 233 place count 17 transition count 24
Applied a total of 233 rules in 54 ms. Remains 17 /247 variables (removed 230) and now considering 24/274 (removed 250) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4746654114376118820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7758634112313308465.kers'
[2026-05-25 15:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4746654114376118820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7758634112313308465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 17 cols 40 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 15:36:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7758634112313308465.kers
Total runtime 10 ms.
[2026-05-25 15:36:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 15:36:04] [INFO ] Invariant cache hit.
[2026-05-25 15:36:04] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2026-05-25 15:36:04] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2026-05-25 15:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 17 constraints, problems are : Problem set: 0 solved, 22 unsolved in 549 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/41 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 39 constraints, problems are : Problem set: 0 solved, 22 unsolved in 345 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 903ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/247 places, 24/274 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1111 ms. Remains : 17/247 places, 24/274 transitions.
[2026-05-25 15:36:05] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:36:05] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:36:05] [INFO ] Input system was already deterministic with 24 transitions.
[2026-05-25 15:36:05] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:36:05] [INFO ] Flatten gal took : 2 ms
[2026-05-25 15:36:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11540178758783613573.gal : 1 ms
[2026-05-25 15:36:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality14058283068442171509.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11540178758783613573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14058283068442171509.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,18,0.005639,3868,2,34,5,191,6,0,86,167,0


Converting to forward existential form...Done !
original formula: AG(((AG((decision_s00000803_activated==1)) + E((task_s00000748_output_s00000264!=1) U EF((task_s00000728_input_s00000263==0)))) + ((task_...239
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((task_s00000727_output_s00000264==0)||(task_s00000762_inputCriterion_s00000257_use...312
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t8, t13, t14, t19, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,1,0.011386,4148,1,0,49,989,75,28,454,1039,65
FORMULA IBM703-PT-none-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 274
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 220 transition count 248
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 220 transition count 248
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 206 transition count 234
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 206 transition count 234
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 91 place count 196 transition count 224
Iterating global reduction 1 with 10 rules applied. Total rules applied 101 place count 196 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 196 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 191 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 191 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 186 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 186 transition count 211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 181 transition count 206
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 181 transition count 206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 176 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 176 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 172 transition count 197
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 172 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 169 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 168 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 167 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 166 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 166 transition count 190
Applied a total of 165 rules in 66 ms. Remains 166 /247 variables (removed 81) and now considering 190/274 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17230478207150418499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1939204555304571588.kers'
[2026-05-25 15:36:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17230478207150418499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1939204555304571588.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 166 cols 381 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-25 15:36:05] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1939204555304571588.kers
Total runtime 1 ms.
[2026-05-25 15:36:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 15:36:05] [INFO ] Invariant cache hit.
[2026-05-25 15:36:05] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-25 15:36:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30014 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30016 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 166/247 places, 190/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60305 ms. Remains : 166/247 places, 190/274 transitions.
[2026-05-25 15:37:06] [INFO ] Flatten gal took : 11 ms
[2026-05-25 15:37:06] [INFO ] Flatten gal took : 15 ms
[2026-05-25 15:37:06] [INFO ] Input system was already deterministic with 190 transitions.
[2026-05-25 15:37:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:37:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 15:37:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8862078075731895063.gal : 3 ms
[2026-05-25 15:37:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality12523666316079378706.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8862078075731895063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12523666316079378706.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2326,0.082692,5956,2,638,5,5493,6,0,854,7855,0


Converting to forward existential form...Done !
original formula: AX(AF(EG((decision_s00000778_activated==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((decision_s00000778_activated==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t31, t32, t33, t38, t39, t43, t45, t50, t53, t54, t59, t67, t75, t11...282
(forward)formula 0,0,0.828471,26148,1,0,336,83331,402,179,4549,105358,495
FORMULA IBM703-PT-none-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Graph (complete) has 274 edges and 247 vertex of which 7 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.1 ms
Discarding 240 places :
Also discarding 263 output transitions
Drop transitions (Output transitions of discarded places.) removed 263 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 4 transition count 4
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 10 place count 3 transition count 4
Applied a total of 10 rules in 4 ms. Remains 3 /247 variables (removed 244) and now considering 4/274 (removed 270) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11109174618422914359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6771127199194172496.kers'
[2026-05-25 15:37:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11109174618422914359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6771127199194172496.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:37:06] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6771127199194172496.kers
Total runtime 0 ms.
[2026-05-25 15:37:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 15:37:07] [INFO ] Invariant cache hit.
[2026-05-25 15:37:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2026-05-25 15:37:07] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/247 places, 4/274 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 186 ms. Remains : 3/247 places, 4/274 transitions.
[2026-05-25 15:37:07] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:37:07] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:37:07] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-25 15:37:07] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:37:07] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:37:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11571403247236896195.gal : 1 ms
[2026-05-25 15:37:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14994558557669936827.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11571403247236896195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14994558557669936827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.002313,3736,2,6,5,22,6,0,16,17,0


Converting to forward existential form...Done !
original formula: AG(EF((task_s00000714_inputCriterion_s00000257_used==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (task_s00000714_inputCriterion_s00000257_used==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.003433,4012,1,0,18,63,29,8,71,79,21
FORMULA IBM703-PT-none-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 274
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 223 transition count 251
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 223 transition count 251
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 212 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 212 transition count 240
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 205 transition count 233
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 205 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 205 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 201 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 201 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 198 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 198 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 195 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 195 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 192 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 192 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 190 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 190 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 188 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 188 transition count 213
Applied a total of 120 rules in 30 ms. Remains 188 /247 variables (removed 59) and now considering 213/274 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16850665555366995169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5765504618233369574.kers'
[2026-05-25 15:37:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16850665555366995169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5765504618233369574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 188 cols 428 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-25 15:37:07] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5765504618233369574.kers
Total runtime 1 ms.
[2026-05-25 15:37:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 15:37:07] [INFO ] Invariant cache hit.
[2026-05-25 15:37:07] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 15:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 213/400 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 188 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30016 ms.
Refiners :[State Equation: 188/188 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 213/400 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 212/399 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 1/401 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/401 variables, and 400 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30017 ms.
Refiners :[State Equation: 188/188 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 188/247 places, 213/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60320 ms. Remains : 188/247 places, 213/274 transitions.
[2026-05-25 15:38:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:38:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:38:07] [INFO ] Input system was already deterministic with 213 transitions.
[2026-05-25 15:38:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:38:07] [INFO ] Flatten gal took : 9 ms
[2026-05-25 15:38:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality10425296707174608986.gal : 2 ms
[2026-05-25 15:38:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2743390370796446845.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10425296707174608986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2743390370796446845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4644,0.140014,7148,2,1035,5,9328,6,0,965,14326,0


Converting to forward existential form...Done !
original formula: A((EG(((task_s00000729_inputCriterion_s00000257_used==0)||(task_s00000727_input_s00000263==1))) * !(EX(!(((task_s00000743_output_s0000026...438
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!((!(E(TRUE U (task_s00000750_output_s00000264==0))) * EG(((task_s00000719_input_...1031
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t26, t28, t29, t30, t31, t34, t36, t37, t41, t42, t47, t48, t56, t57, t63, t71, t79,...325
(forward)formula 0,0,4.30892,122792,1,0,1245,775106,463,784,5289,663849,1509
FORMULA IBM703-PT-none-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 274
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 222 transition count 250
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 222 transition count 250
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 208 transition count 236
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 208 transition count 236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 199 transition count 227
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 199 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 199 transition count 225
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 194 transition count 220
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 194 transition count 220
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 189 transition count 215
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 189 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 184 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 184 transition count 210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 179 transition count 205
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 179 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 176 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 176 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 174 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 174 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 173 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 173 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 172 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 172 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 171 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 171 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 171 transition count 196
Applied a total of 154 rules in 40 ms. Remains 171 /247 variables (removed 76) and now considering 196/274 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10492320046639826490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2767514690443157405.kers'
[2026-05-25 15:38:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10492320046639826490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2767514690443157405.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 171 cols 393 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-25 15:38:11] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2767514690443157405.kers
Total runtime 1 ms.
[2026-05-25 15:38:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 15:38:12] [INFO ] Invariant cache hit.
[2026-05-25 15:38:12] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-25 15:38:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 196/366 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/367 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/367 variables, and 171 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30017 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 196/366 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 195/365 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 1/367 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 366 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30018 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 171/247 places, 196/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60298 ms. Remains : 171/247 places, 196/274 transitions.
[2026-05-25 15:39:12] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:39:12] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:39:12] [INFO ] Input system was already deterministic with 196 transitions.
[2026-05-25 15:39:12] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:39:12] [INFO ] Flatten gal took : 10 ms
[2026-05-25 15:39:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10980082183184354564.gal : 3 ms
[2026-05-25 15:39:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality4233717727944157689.ctl : 14 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10980082183184354564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4233717727944157689.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2396,0.143576,6360,2,732,5,6458,6,0,880,10100,0


Converting to forward existential form...Done !
original formula: AF(((AX((decision_s00000804_activated==0)) * EX((task_s00000720_output_s00000264==1))) * !(E(((task_s00000709_input_s00000263==0)||(merge...229
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((decision_s00000804_activated==0)))) * EX((task_s00000720_output_s00000264==1))) * !(E(((t...280
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t29, t30, t33, t34, t35, t40, t41, t45, t47, t52, t56, t61, t69, t77, t87...281
(forward)formula 0,0,1.18657,30240,1,0,351,96980,417,187,4834,131493,519
FORMULA IBM703-PT-none-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 274
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 224 transition count 252
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 224 transition count 252
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 212 transition count 240
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 212 transition count 240
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 204 transition count 232
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 204 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 204 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 201 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 201 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 198 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 198 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 195 transition count 221
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 195 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 192 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 192 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 190 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 190 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 188 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 188 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 187 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 187 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 186 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 186 transition count 212
Applied a total of 123 rules in 49 ms. Remains 186 /247 variables (removed 61) and now considering 212/274 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4644901004984821646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15157156969104928105.kers'
[2026-05-25 15:39:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4644901004984821646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15157156969104928105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 186 cols 426 entries
Finished phase 1 with 186 SingleSign rule and 0 generalized
[2026-05-25 15:39:13] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15157156969104928105.kers
Total runtime 2 ms.
[2026-05-25 15:39:13] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 15:39:13] [INFO ] Invariant cache hit.
[2026-05-25 15:39:13] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 15:39:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 212/397 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/398 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 0/398 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 186 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30014 ms.
Refiners :[State Equation: 186/186 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 212/397 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 211/396 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 1/398 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 397 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30019 ms.
Refiners :[State Equation: 186/186 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 186/247 places, 212/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60335 ms. Remains : 186/247 places, 212/274 transitions.
[2026-05-25 15:40:13] [INFO ] Flatten gal took : 15 ms
[2026-05-25 15:40:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:40:13] [INFO ] Input system was already deterministic with 212 transitions.
[2026-05-25 15:40:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 15:40:13] [INFO ] Flatten gal took : 12 ms
[2026-05-25 15:40:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8671069792345709079.gal : 3 ms
[2026-05-25 15:40:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13279164892385034098.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8671069792345709079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13279164892385034098.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2492,0.117248,6652,2,799,5,6973,6,0,956,10973,0


Converting to forward existential form...Done !
original formula: AF((((EG(EF(((decision_s00000780_input_s00000263==0)||(task_s00000719_input_s00000263==1)))) * ((merge_s00000461_activated==0)||(task_s00...735
=> equivalent forward existential formula: [FwdG(Init,!((((EG(E(TRUE U ((decision_s00000780_input_s00000263==0)||(task_s00000719_input_s00000263==1)))) * (...804
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t24, t27, t29, t30, t31, t34, t41, t46, t48, t56, t71, t94, t96, t129, t142, t151, t1...277
dead was empty
(forward)formula 0,1,1.63907,44080,1,0,407,186878,462,233,5257,196520,614
FORMULA IBM703-PT-none-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 247/247 places, 274/274 transitions.
Graph (complete) has 274 edges and 247 vertex of which 69 are kept as prefixes of interest. Removing 178 places using SCC suffix rule.2 ms
Discarding 178 places :
Also discarding 193 output transitions
Drop transitions (Output transitions of discarded places.) removed 193 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 68 transition count 29
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 18 transition count 25
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 15 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 110 place count 15 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 116 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 11 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 11 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 10 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 124 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 9 transition count 13
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 6 with 1 rules applied. Total rules applied 127 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 128 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 128 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 130 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 132 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 132 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 134 place count 6 transition count 8
Applied a total of 134 rules in 15 ms. Remains 6 /247 variables (removed 241) and now considering 8/274 (removed 266) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5621484131243157621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5374415147247441414.kers'
[2026-05-25 15:40:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5621484131243157621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5374415147247441414.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 14 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-25 15:40:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5374415147247441414.kers
Total runtime 0 ms.
[2026-05-25 15:40:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 15:40:15] [INFO ] Invariant cache hit.
[2026-05-25 15:40:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-25 15:40:15] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 15:40:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 121 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 214ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/247 places, 8/274 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 281 ms. Remains : 6/247 places, 8/274 transitions.
[2026-05-25 15:40:15] [INFO ] Flatten gal took : 1 ms
[2026-05-25 15:40:15] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:40:15] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-25 15:40:15] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:40:15] [INFO ] Flatten gal took : 0 ms
[2026-05-25 15:40:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9296992034932857384.gal : 0 ms
[2026-05-25 15:40:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality15634171101478548918.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9296992034932857384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15634171101478548918.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7,0.003781,3764,2,12,5,47,6,0,32,36,0


Converting to forward existential form...Done !
original formula: EG(AF(((task_s00000717_output_s00000264==0)&&(task_s00000744_inputCriterion_s00000257_used==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((task_s00000717_output_s00000264==0)&&(task_s00000744_inputCriterion_s00000257_used==1))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t1, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,0,0.007567,4048,1,0,37,222,38,22,159,312,51
FORMULA IBM703-PT-none-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 15:40:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:40:15] [INFO ] Flatten gal took : 8 ms
Total runtime 386685 ms.

BK_STOP 1779723616036

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="IBM703-PT-none"
export BK_EXAMINATION="CTLCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is IBM703-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;