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.r034-tall-177946842000570.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 BusinessProcesses-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 5 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K 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 BusinessProcesses-PT-16-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779624246085

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 12:04:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:04:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:04:07] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2026-05-24 12:04:07] [INFO ] Transformed 638 places.
[2026-05-24 12:04:07] [INFO ] Transformed 578 transitions.
[2026-05-24 12:04:07] [INFO ] Found NUPN structural information;
[2026-05-24 12:04:07] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Support contains 100 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 89 place count 541 transition count 486
Iterating global reduction 1 with 84 rules applied. Total rules applied 173 place count 541 transition count 486
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 208 place count 506 transition count 451
Iterating global reduction 1 with 35 rules applied. Total rules applied 243 place count 506 transition count 451
Applied a total of 243 rules in 141 ms. Remains 506 /630 variables (removed 124) and now considering 451/570 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11695241809364731397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8692581424468315337.kers'
[2026-05-24 12:04:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11695241809364731397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8692581424468315337.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 451 rows 506 cols 1435 entries
Finished phase 1 with 336 SingleSign rule and 75 generalized
[2026-05-24 12:04:07] [INFO ] Computed 95 invariants in 4 ms
Computed 95 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8692581424468315337.kers
Total runtime 6 ms.
[2026-05-24 12:04:08] [INFO ] Implicit Places using invariants in 468 ms returned []
[2026-05-24 12:04:08] [INFO ] Invariant cache hit.
[2026-05-24 12:04:09] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2026-05-24 12:04:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/506 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 506/957 variables, and 155 constraints, problems are : Problem set: 4 solved, 446 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/506 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 15/15 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/506 variables, 77/92 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 3/95 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 60/155 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 20/175 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 20/195 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 20/215 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 20/235 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 20/255 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 20/275 constraints. Problems are: Problem set: 4 solved, 446 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 20/295 constraints. Problems are: Problem set: 4 solved, 446 unsolved
SMT process timed out in 60200ms, After SMT, problems are : Problem set: 4 solved, 446 unsolved
Search for dead transitions found 4 dead transitions in 60218ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 506/630 places, 447/570 transitions.
Applied a total of 0 rules in 35 ms. Remains 506 /506 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62080 ms. Remains : 506/630 places, 447/570 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Applied a total of 0 rules in 20 ms. Remains 506 /506 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1509646483470905248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16860513752000934310.kers'
[2026-05-24 12:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1509646483470905248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16860513752000934310.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 447 rows 506 cols 1411 entries
Finished phase 1 with 335 SingleSign rule and 76 generalized
[2026-05-24 12:05:09] [INFO ] Computed 95 invariants in 6 ms
Computed 95 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16860513752000934310.kers
Total runtime 8 ms.
[2026-05-24 12:05:09] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-24 12:05:09] [INFO ] Invariant cache hit.
[2026-05-24 12:05:10] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2026-05-24 12:05:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/506 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 446 unsolved
SMT process timed out in 30152ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Finished structural reductions in LTL mode , in 1 iterations and 31486 ms. Remains : 506/506 places, 447/447 transitions.
Support contains 100 out of 506 places after structural reductions.
[2026-05-24 12:05:41] [INFO ] Flatten gal took : 59 ms
[2026-05-24 12:05:41] [INFO ] Flatten gal took : 36 ms
[2026-05-24 12:05:41] [INFO ] Input system was already deterministic with 447 transitions.
Support contains 99 out of 506 places (down from 100) after GAL structural reductions.
RANDOM walk for 40000 steps (264 resets) in 2197 ms. (18 steps per ms) remains 44/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
[2026-05-24 12:05:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 288/351 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 61/412 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp56 is UNSAT
At refinement iteration 5 (OVERLAPS) 84/496 variables, 20/94 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 2/498 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 442/940 variables, 498/593 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/613 constraints. Problems are: Problem set: 2 solved, 42 unsolved
SMT process timed out in 5064ms, After SMT, problems are : Problem set: 2 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 447/447 transitions.
Graph (complete) has 1132 edges and 506 vertex of which 505 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 505 transition count 408
Reduce places removed 38 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 45 rules applied. Total rules applied 84 place count 467 transition count 401
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 91 place count 460 transition count 401
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 91 place count 460 transition count 310
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 286 place count 356 transition count 310
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 295 place count 347 transition count 301
Iterating global reduction 3 with 9 rules applied. Total rules applied 304 place count 347 transition count 301
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 522 place count 237 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 237 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 525 place count 236 transition count 196
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 534 place count 236 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 535 place count 235 transition count 195
Applied a total of 535 rules in 99 ms. Remains 235 /506 variables (removed 271) and now considering 195/447 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 235/506 places, 195/447 transitions.
RANDOM walk for 40000 steps (2152 resets) in 997 ms. (40 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (45 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (40 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (45 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (46 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (45 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (44 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (47 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (45 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (47 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (47 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (44 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (32 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (44 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (47 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (46 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (41 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (43 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (47 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 523523 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :22 out of 42
Probabilistic random walk after 523523 steps, saw 91221 distinct states, run finished after 3006 ms. (steps per millisecond=174 ) properties seen :22
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18326245691867400502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5705256354571179168.kers'
[2026-05-24 12:05:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18326245691867400502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5705256354571179168.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 195 rows 229 cols 877 entries
Finished phase 1 with 81 SingleSign rule and 74 generalized
[2026-05-24 12:05:51] [INFO ] Computed 80 invariants in 1 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5705256354571179168.kers
Total runtime 1 ms.
[2026-05-24 12:05:51] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 113/144 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 13/157 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 63/220 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/222 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 195/417 variables, 222/297 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/303 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 3/306 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 11/317 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 6/323 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/323 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 16 (OVERLAPS) 13/430 variables, 13/336 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 5/341 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 2/343 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/343 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/343 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 343 constraints, problems are : Problem set: 8 solved, 12 unsolved in 3564 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 235/235 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/78 variables, 23/23 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/89 variables, 6/29 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 65/154 variables, 9/38 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/38 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 42/196 variables, 22/60 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/63 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/63 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 16/212 variables, 12/75 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/76 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/76 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 191/403 variables, 212/288 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 5/293 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 10/303 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 1/304 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/305 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/305 constraints. Problems are: Problem set: 9 solved, 11 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 19 (OVERLAPS) 26/429 variables, 22/327 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 7/334 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 19/353 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 1/354 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 0/354 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 1/430 variables, 1/355 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/430 variables, 1/356 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/430 variables, 0/356 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 0/430 variables, 5/361 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/430 variables, 0/361 constraints. Problems are: Problem set: 11 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 0/430 variables, 0/361 constraints. Problems are: Problem set: 11 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 361 constraints, problems are : Problem set: 11 solved, 9 unsolved in 3407 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 235/235 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6982ms problems are : Problem set: 11 solved, 9 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 394 ms.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 12:05:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 12:05:58] [INFO ] Flatten gal took : 26 ms
[2026-05-24 12:05:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 12:05:58] [INFO ] Flatten gal took : 21 ms
[2026-05-24 12:05:58] [INFO ] Input system was already deterministic with 447 transitions.
Support contains 53 out of 506 places (down from 70) after GAL structural reductions.
Computed a total of 138 stabilizing places and 131 stable transitions
Graph (complete) has 1132 edges and 506 vertex of which 505 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 482 transition count 423
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 482 transition count 423
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 473 transition count 414
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 473 transition count 414
Applied a total of 66 rules in 25 ms. Remains 473 /506 variables (removed 33) and now considering 414/447 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5062290105046423504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17340918670598184407.kers'
[2026-05-24 12:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5062290105046423504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17340918670598184407.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 414 rows 473 cols 1345 entries
Finished phase 1 with 302 SingleSign rule and 76 generalized
[2026-05-24 12:05:58] [INFO ] Computed 95 invariants in 5 ms
Computed 95 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17340918670598184407.kers
Total runtime 6 ms.
[2026-05-24 12:05:59] [INFO ] Implicit Places using invariants in 491 ms returned []
[2026-05-24 12:05:59] [INFO ] Invariant cache hit.
[2026-05-24 12:06:00] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-24 12:06:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 16 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/135 constraints. Problems are: Problem set: 16 solved, 397 unsolved
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/155 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/175 constraints. Problems are: Problem set: 24 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/887 variables, and 175 constraints, problems are : Problem set: 24 solved, 389 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 15/15 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/15 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 74/89 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 6/95 constraints. Problems are: Problem set: 24 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 80/175 constraints. Problems are: Problem set: 24 solved, 389 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/195 constraints. Problems are: Problem set: 26 solved, 387 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/215 constraints. Problems are: Problem set: 26 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/235 constraints. Problems are: Problem set: 26 solved, 387 unsolved
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 20/255 constraints. Problems are: Problem set: 28 solved, 385 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/275 constraints. Problems are: Problem set: 28 solved, 385 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/295 constraints. Problems are: Problem set: 28 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/887 variables, and 303 constraints, problems are : Problem set: 28 solved, 385 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 0/413 constraints, Known Traps: 208/208 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 28 solved, 385 unsolved
Search for dead transitions found 28 dead transitions in 60078ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/506 places, 386/447 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 386
Applied a total of 1 rules in 9 ms. Remains 472 /473 variables (removed 1) and now considering 386/386 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16428250717527477464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1640097814198179842.kers'
[2026-05-24 12:07:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16428250717527477464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1640097814198179842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 472 cols 1175 entries
Finished phase 1 with 302 SingleSign rule and 71 generalized
[2026-05-24 12:07:00] [INFO ] Computed 99 invariants in 2 ms
Computed 99 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1640097814198179842.kers
Total runtime 3 ms.
[2026-05-24 12:07:01] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-24 12:07:01] [INFO ] Invariant cache hit.
[2026-05-24 12:07:02] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned [149, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1377 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 470/506 places, 386/447 transitions.
Applied a total of 0 rules in 9 ms. Remains 470 /470 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63612 ms. Remains : 470/506 places, 386/447 transitions.
[2026-05-24 12:07:02] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:07:02] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:07:02] [INFO ] Input system was already deterministic with 386 transitions.
[2026-05-24 12:07:02] [INFO ] Flatten gal took : 27 ms
[2026-05-24 12:07:02] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:07:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11305350192896055761.gal : 20 ms
[2026-05-24 12:07:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1926891058813185065.ctl : 18 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/CTLFireability11305350192896055761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1926891058813185065.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.
Detected timeout of ITS tools.
[2026-05-24 12:07:32] [INFO ] Flatten gal took : 18 ms
[2026-05-24 12:07:32] [INFO ] Applying decomposition
[2026-05-24 12:07:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13461494149416704966.txt' '-o' '/tmp/graph13461494149416704966.bin' '-w' '/tmp/graph13461494149416704966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13461494149416704966.bin' '-l' '-1' '-v' '-w' '/tmp/graph13461494149416704966.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:07:32] [INFO ] Decomposing Gal with order
[2026-05-24 12:07:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:07:32] [INFO ] Removed a total of 139 redundant transitions.
[2026-05-24 12:07:32] [INFO ] Flatten gal took : 76 ms
[2026-05-24 12:07:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 13 ms.
[2026-05-24 12:07:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16264706665756713471.gal : 9 ms
[2026-05-24 12:07:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11405416537157567139.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/CTLFireability16264706665756713471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11405416537157567139.ctl'

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 -...264
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,1.07055e+27,2.54272,75876,4341,39,118668,754,1013,237675,67,1587,0


Converting to forward existential form...Done !
original formula: AG(((AX((i8.i2.u86.p269==1)) + EX((i17.u135.p509==1))) + (EF(((i10.i0.u40.p128==0)||(i10.i0.u41.p131==0))) + EG((i17.u128.p603==0)))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((E(TRUE U ((i10.i0.u40.p128==0)||(i10.i0.u41.p131==0))) + EG((i17.u128.p603==0))))) *...218
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t171, t243, t265, t279, t354, t355, t364, t371, t376, t378, t381, i0.i0.u76.t174, i0...1316
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 482 transition count 423
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 482 transition count 423
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 473 transition count 414
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 473 transition count 414
Applied a total of 66 rules in 18 ms. Remains 473 /506 variables (removed 33) and now considering 414/447 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5008253449975147071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2438823157110646164.kers'
[2026-05-24 12:08:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5008253449975147071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2438823157110646164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 414 rows 473 cols 1345 entries
Finished phase 1 with 302 SingleSign rule and 76 generalized
[2026-05-24 12:08:02] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2438823157110646164.kers
Total runtime 4 ms.
[2026-05-24 12:08:03] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-24 12:08:03] [INFO ] Invariant cache hit.
[2026-05-24 12:08:04] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-24 12:08:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Problem TDEAD328 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 10 solved, 403 unsolved
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/135 constraints. Problems are: Problem set: 19 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/155 constraints. Problems are: Problem set: 19 solved, 394 unsolved
Problem TDEAD331 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/175 constraints. Problems are: Problem set: 20 solved, 393 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/887 variables, and 176 constraints, problems are : Problem set: 20 solved, 393 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 15/15 constraints. Problems are: Problem set: 20 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/15 constraints. Problems are: Problem set: 20 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 74/89 constraints. Problems are: Problem set: 20 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 6/95 constraints. Problems are: Problem set: 20 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 81/176 constraints. Problems are: Problem set: 20 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/196 constraints. Problems are: Problem set: 20 solved, 393 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/216 constraints. Problems are: Problem set: 25 solved, 388 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/236 constraints. Problems are: Problem set: 25 solved, 388 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 20/256 constraints. Problems are: Problem set: 27 solved, 386 unsolved
Problem TDEAD314 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/276 constraints. Problems are: Problem set: 28 solved, 385 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/887 variables, and 281 constraints, problems are : Problem set: 28 solved, 385 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 0/413 constraints, Known Traps: 186/186 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 28 solved, 385 unsolved
Search for dead transitions found 28 dead transitions in 60061ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/506 places, 386/447 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 386
Applied a total of 1 rules in 8 ms. Remains 472 /473 variables (removed 1) and now considering 386/386 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7599250621997298983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14395896249405813419.kers'
[2026-05-24 12:09:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7599250621997298983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14395896249405813419.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 386 rows 472 cols 1175 entries
Finished phase 1 with 302 SingleSign rule and 71 generalized
[2026-05-24 12:09:04] [INFO ] Computed 99 invariants in 6 ms
Computed 99 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14395896249405813419.kers
Total runtime 7 ms.
[2026-05-24 12:09:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-24 12:09:04] [INFO ] Invariant cache hit.
[2026-05-24 12:09:05] [INFO ] Implicit Places using invariants and state equation in 929 ms returned [150, 422]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1141 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 470/506 places, 386/447 transitions.
Applied a total of 0 rules in 9 ms. Remains 470 /470 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62710 ms. Remains : 470/506 places, 386/447 transitions.
[2026-05-24 12:09:05] [INFO ] Flatten gal took : 10 ms
[2026-05-24 12:09:05] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:09:05] [INFO ] Input system was already deterministic with 386 transitions.
[2026-05-24 12:09:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:09:05] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13384258797451316613.gal : 3 ms
[2026-05-24 12:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7516975191313264027.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/CTLFireability13384258797451316613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7516975191313264027.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.
Detected timeout of ITS tools.
[2026-05-24 12:09:35] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:09:35] [INFO ] Applying decomposition
[2026-05-24 12:09:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18063082663139523795.txt' '-o' '/tmp/graph18063082663139523795.bin' '-w' '/tmp/graph18063082663139523795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18063082663139523795.bin' '-l' '-1' '-v' '-w' '/tmp/graph18063082663139523795.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:09:35] [INFO ] Decomposing Gal with order
[2026-05-24 12:09:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:09:35] [INFO ] Removed a total of 138 redundant transitions.
[2026-05-24 12:09:35] [INFO ] Flatten gal took : 26 ms
[2026-05-24 12:09:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 10 ms.
[2026-05-24 12:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1049726086606943597.gal : 5 ms
[2026-05-24 12:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8222506848777808264.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/CTLFireability1049726086606943597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8222506848777808264.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Graph (trivial) has 250 edges and 506 vertex of which 6 / 506 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1126 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 499 transition count 381
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 441 transition count 381
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 118 place count 441 transition count 278
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 341 place count 321 transition count 278
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 365 place count 297 transition count 254
Iterating global reduction 2 with 24 rules applied. Total rules applied 389 place count 297 transition count 254
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 389 place count 297 transition count 251
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 395 place count 294 transition count 251
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 640 place count 169 transition count 131
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 2 with 2 rules applied. Total rules applied 642 place count 168 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 643 place count 167 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 644 place count 166 transition count 129
Applied a total of 644 rules in 63 ms. Remains 166 /506 variables (removed 340) and now considering 129/447 (removed 318) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12751741689805551750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17472038104546669550.kers'
[2026-05-24 12:10:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12751741689805551750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17472038104546669550.kers]
Normalized transition count is 128 out of 129 initially.
Culling duplicate invariants (modulo rational): removing 52 columns.
Culled 52 columns in 0 ms.
// Phase 1: matrix 128 rows 114 cols 484 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-24 12:10:06] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17472038104546669550.kers
Total runtime 1 ms.
[2026-05-24 12:10:06] [INFO ] Implicit Places using invariants in 135 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 136 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/506 places, 129/447 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 207 ms. Remains : 147/506 places, 129/447 transitions.
[2026-05-24 12:10:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 12:10:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:10:06] [INFO ] Input system was already deterministic with 129 transitions.
[2026-05-24 12:10:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:10:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 12:10:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6075305938780754801.gal : 2 ms
[2026-05-24 12:10:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17619572923642086128.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/CTLFireability6075305938780754801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17619572923642086128.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,19608,0.415521,24752,2,8209,5,88979,6,0,716,47347,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p532==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p532==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t26, t27, t28, t29, t30, t54, t55, t56, t57, t58, t84, t85, t86, t121, t122, t123, Inter...249
(forward)formula 0,1,2.6734,97048,1,0,169,428792,247,92,5154,194989,249
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 481 transition count 422
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 481 transition count 422
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 471 transition count 412
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 471 transition count 412
Applied a total of 70 rules in 24 ms. Remains 471 /506 variables (removed 35) and now considering 412/447 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8750429463908051922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8492139559647405732.kers'
[2026-05-24 12:10:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8750429463908051922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8492139559647405732.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 471 cols 1341 entries
Finished phase 1 with 300 SingleSign rule and 76 generalized
[2026-05-24 12:10:08] [INFO ] Computed 95 invariants in 5 ms
Computed 95 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8492139559647405732.kers
Total runtime 7 ms.
[2026-05-24 12:10:09] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-24 12:10:09] [INFO ] Invariant cache hit.
[2026-05-24 12:10:10] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2026-05-24 12:10:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/115 constraints. Problems are: Problem set: 11 solved, 400 unsolved
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/135 constraints. Problems are: Problem set: 16 solved, 395 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/155 constraints. Problems are: Problem set: 18 solved, 393 unsolved
Problem TDEAD322 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/175 constraints. Problems are: Problem set: 21 solved, 390 unsolved
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 21 solved, 390 unsolved
Search for dead transitions found 21 dead transitions in 30173ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 471/506 places, 391/447 transitions.
Applied a total of 0 rules in 10 ms. Remains 471 /471 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31828 ms. Remains : 471/506 places, 391/447 transitions.
[2026-05-24 12:10:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:10:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:10:40] [INFO ] Input system was already deterministic with 391 transitions.
[2026-05-24 12:10:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:10:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16965284440043573567.gal : 2 ms
[2026-05-24 12:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15610569040423820601.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/CTLFireability16965284440043573567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15610569040423820601.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.
Detected timeout of ITS tools.
[2026-05-24 12:11:10] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:11:10] [INFO ] Applying decomposition
[2026-05-24 12:11:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15154140666833254142.txt' '-o' '/tmp/graph15154140666833254142.bin' '-w' '/tmp/graph15154140666833254142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15154140666833254142.bin' '-l' '-1' '-v' '-w' '/tmp/graph15154140666833254142.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:11:10] [INFO ] Decomposing Gal with order
[2026-05-24 12:11:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:11:10] [INFO ] Removed a total of 167 redundant transitions.
[2026-05-24 12:11:10] [INFO ] Flatten gal took : 22 ms
[2026-05-24 12:11:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2026-05-24 12:11:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10633711059515775548.gal : 15 ms
[2026-05-24 12:11:11] [INFO ] Time to serialize properties into /tmp/CTLFireability296440654727129523.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/CTLFireability10633711059515775548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability296440654727129523.ctl'

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 -...262
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,1.07055e+27,1.42435,46788,5185,56,81369,708,1062,181758,62,1779,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.43103,46788,1,0,81369,708,1480,181758,72,1779,1574
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 483 transition count 424
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 483 transition count 424
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 473 transition count 414
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 473 transition count 414
Applied a total of 66 rules in 25 ms. Remains 473 /506 variables (removed 33) and now considering 414/447 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2631471106281069897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14330111899815897732.kers'
[2026-05-24 12:11:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2631471106281069897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14330111899815897732.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 414 rows 473 cols 1345 entries
Finished phase 1 with 302 SingleSign rule and 76 generalized
[2026-05-24 12:11:12] [INFO ] Computed 95 invariants in 8 ms
Computed 95 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14330111899815897732.kers
Total runtime 9 ms.
[2026-05-24 12:11:12] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-24 12:11:12] [INFO ] Invariant cache hit.
[2026-05-24 12:11:14] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2026-05-24 12:11:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 9 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/135 constraints. Problems are: Problem set: 9 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/155 constraints. Problems are: Problem set: 9 solved, 404 unsolved
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/175 constraints. Problems are: Problem set: 12 solved, 401 unsolved
SMT process timed out in 30052ms, After SMT, problems are : Problem set: 12 solved, 401 unsolved
Search for dead transitions found 12 dead transitions in 30054ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/506 places, 402/447 transitions.
Applied a total of 0 rules in 11 ms. Remains 473 /473 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31669 ms. Remains : 473/506 places, 402/447 transitions.
[2026-05-24 12:11:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:11:44] [INFO ] Flatten gal took : 10 ms
[2026-05-24 12:11:44] [INFO ] Input system was already deterministic with 402 transitions.
[2026-05-24 12:11:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:11:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:11:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6832449217228739597.gal : 2 ms
[2026-05-24 12:11:44] [INFO ] Time to serialize properties into /tmp/CTLFireability47020393917131544.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/CTLFireability6832449217228739597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability47020393917131544.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 12:12:14] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:12:14] [INFO ] Applying decomposition
[2026-05-24 12:12:14] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8705455629845273953.txt' '-o' '/tmp/graph8705455629845273953.bin' '-w' '/tmp/graph8705455629845273953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8705455629845273953.bin' '-l' '-1' '-v' '-w' '/tmp/graph8705455629845273953.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:12:14] [INFO ] Decomposing Gal with order
[2026-05-24 12:12:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:12:14] [INFO ] Removed a total of 205 redundant transitions.
[2026-05-24 12:12:14] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:12:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2026-05-24 12:12:14] [INFO ] Time to serialize gal into /tmp/CTLFireability738752782408326569.gal : 4 ms
[2026-05-24 12:12:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4923222843075349300.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/CTLFireability738752782408326569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4923222843075349300.ctl'

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 -...261
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,1.18407e+27,1.48103,51016,6129,46,82806,648,1068,178210,70,1543,0


Converting to forward existential form...Done !
original formula: EG((AF(AX((i9.i0.u26.p83==0))) * (EF(AG((((i17.i0.u12.p28==1)&&(i13.i1.u124.p436==1))&&(i19.u128.p603==1)))) + ((EX((i10.i0.u68.p216==0))...260
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(EX(!((i9.i0.u26.p83==0))))))) * (E(TRUE U !(E(TRUE U !((((i17.i0.u12.p28==1)&&(i13.i1.u124....345
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t170, t264, t278, t369, t371, t379, t380, t387, t392, t394, t396, i0.t174, i...1343
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Graph (complete) has 1132 edges and 506 vertex of which 505 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 504 transition count 399
Reduce places removed 46 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 458 transition count 395
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 454 transition count 395
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 101 place count 454 transition count 293
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 321 place count 336 transition count 293
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 340 place count 317 transition count 274
Iterating global reduction 3 with 19 rules applied. Total rules applied 359 place count 317 transition count 274
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 359 place count 317 transition count 271
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 365 place count 314 transition count 271
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 600 place count 194 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 601 place count 193 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 192 transition count 155
Applied a total of 602 rules in 46 ms. Remains 192 /506 variables (removed 314) and now considering 155/447 (removed 292) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14887607250082367084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16033924606103936799.kers'
[2026-05-24 12:12:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14887607250082367084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16033924606103936799.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 6 ms.
// Phase 1: matrix 155 rows 163 cols 653 entries
Finished phase 1 with 94 SingleSign rule and 25 generalized
[2026-05-24 12:12:44] [INFO ] Computed 73 invariants in 7 ms
Computed 73 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16033924606103936799.kers
Total runtime 8 ms.
[2026-05-24 12:12:44] [INFO ] Implicit Places using invariants in 136 ms returned [28, 29, 55, 58, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 136 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 187/506 places, 155/447 transitions.
Applied a total of 0 rules in 6 ms. Remains 187 /187 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 188 ms. Remains : 187/506 places, 155/447 transitions.
[2026-05-24 12:12:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 12:12:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:12:44] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-24 12:12:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:12:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 12:12:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12332319394382452436.gal : 1 ms
[2026-05-24 12:12:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5938723956538601119.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/CTLFireability12332319394382452436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5938723956538601119.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,3.76111e+06,0.29024,16932,2,7967,5,44546,6,0,902,49019,0


Converting to forward existential form...Done !
original formula: A((AF((EF((p308==1)) + A(AG(((p187==1)&&(p583==1))) U ((p284==1)||(p93==1))))) + EF(((p516==1) * AG(((p348==1)||(p516==1)))))) U !((AG(!(...318
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U !(!(E(TRUE U (p119==1)))))) + (!(!(EG(!(((p554==1)&&(p225==1)))))) * ((p293==1) +...1253
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t13, t20, t47, t50, t56, t57, t60, t61, t62, t63, t64, t65, t79, t80, t81, t82, t...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 12:13:14] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:13:14] [INFO ] Applying decomposition
[2026-05-24 12:13:14] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11021558932531269795.txt' '-o' '/tmp/graph11021558932531269795.bin' '-w' '/tmp/graph11021558932531269795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11021558932531269795.bin' '-l' '-1' '-v' '-w' '/tmp/graph11021558932531269795.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:13:14] [INFO ] Decomposing Gal with order
[2026-05-24 12:13:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:13:14] [INFO ] Removed a total of 110 redundant transitions.
[2026-05-24 12:13:14] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:13:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 3 ms.
[2026-05-24 12:13:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3311513059230144672.gal : 2 ms
[2026-05-24 12:13:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1097079129847965840.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/CTLFireability3311513059230144672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1097079129847965840.ctl'

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 -...262
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,3.76111e+06,0.265684,16416,872,512,22994,2651,614,40082,179,11773,0


Converting to forward existential form...Done !
original formula: A((AF((EF((i2.i0.u19.p308==1)) + A(AG(((i6.u13.p187==1)&&(i7.u56.p583==1))) U ((i2.i0.u15.p284==1)||(i0.i2.u6.p93==1))))) + EF(((i9.i2.u4...467
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U !(!(E(TRUE U (i4.i0.u8.p119==1)))))) + (!(!(EG(!(((i9.i2.u55.p554==1)&&(i8.u14.p2...1742
Reverse transition relation is NOT exact ! Due to transitions t62, t63, t64, t65, t80, t81, t82, t83, t100, t110, t116, t117, t145, t146, t147, t150, i0.i2...409
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,3.36814,149740,1,0,337394,7179,3092,449358,1533,32428,489144
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 484 transition count 425
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 484 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 475 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 475 transition count 416
Applied a total of 62 rules in 19 ms. Remains 475 /506 variables (removed 31) and now considering 416/447 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1292364591238107812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11557299537230974093.kers'
[2026-05-24 12:13:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1292364591238107812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11557299537230974093.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 416 rows 475 cols 1349 entries
Finished phase 1 with 304 SingleSign rule and 76 generalized
[2026-05-24 12:13:18] [INFO ] Computed 95 invariants in 5 ms
Computed 95 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11557299537230974093.kers
Total runtime 7 ms.
[2026-05-24 12:13:18] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-24 12:13:18] [INFO ] Invariant cache hit.
[2026-05-24 12:13:19] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2026-05-24 12:13:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/155 constraints. Problems are: Problem set: 8 solved, 407 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/891 variables, and 170 constraints, problems are : Problem set: 8 solved, 407 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 15/15 constraints. Problems are: Problem set: 8 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 74/89 constraints. Problems are: Problem set: 8 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 6/95 constraints. Problems are: Problem set: 8 solved, 407 unsolved
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 75/170 constraints. Problems are: Problem set: 13 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/190 constraints. Problems are: Problem set: 13 solved, 402 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/210 constraints. Problems are: Problem set: 19 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/230 constraints. Problems are: Problem set: 19 solved, 396 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/891 variables, and 249 constraints, problems are : Problem set: 19 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 154/154 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 19 solved, 396 unsolved
Search for dead transitions found 19 dead transitions in 60072ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 475/506 places, 397/447 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61552 ms. Remains : 475/506 places, 397/447 transitions.
[2026-05-24 12:14:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:14:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:14:19] [INFO ] Input system was already deterministic with 397 transitions.
[2026-05-24 12:14:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:14:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:14:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18341229768653732424.gal : 2 ms
[2026-05-24 12:14:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13426164045148482812.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/CTLFireability18341229768653732424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13426164045148482812.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.
Detected timeout of ITS tools.
[2026-05-24 12:14:49] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:14:49] [INFO ] Applying decomposition
[2026-05-24 12:14:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13949735704382929450.txt' '-o' '/tmp/graph13949735704382929450.bin' '-w' '/tmp/graph13949735704382929450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13949735704382929450.bin' '-l' '-1' '-v' '-w' '/tmp/graph13949735704382929450.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:14:49] [INFO ] Decomposing Gal with order
[2026-05-24 12:14:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:14:49] [INFO ] Removed a total of 176 redundant transitions.
[2026-05-24 12:14:49] [INFO ] Flatten gal took : 15 ms
[2026-05-24 12:14:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-24 12:14:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12609055723810294257.gal : 4 ms
[2026-05-24 12:14:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10859775508374064268.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/CTLFireability12609055723810294257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10859775508374064268.ctl'

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 -...264
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,1.15751e+27,3.10903,94072,5693,54,153840,701,1062,326267,71,1594,0


Converting to forward existential form...Done !
original formula: EF(((i13.i2.u37.p122==1) + AF((((EX((i14.i0.u115.p389==1)) * (i9.u30.p109==0)) * ((i0.i3.u127.p448==0)&&(i6.i0.u13.p31==0))) * (((i10.i0....215
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i13.i2.u37.p122==1))] != FALSE + [(FwdU(Init,TRUE) * !(EG(!((((EX((i14.i0.u115.p389==1)) *...304
(forward)formula 0,1,3.12342,94072,1,0,153840,701,1067,326267,74,1594,3003
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 481 transition count 422
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 481 transition count 422
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 472 transition count 413
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 472 transition count 413
Applied a total of 68 rules in 17 ms. Remains 472 /506 variables (removed 34) and now considering 413/447 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5247860564847707734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6461300574765977797.kers'
[2026-05-24 12:14:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5247860564847707734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6461300574765977797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 472 cols 1343 entries
Finished phase 1 with 301 SingleSign rule and 76 generalized
[2026-05-24 12:14:53] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6461300574765977797.kers
Total runtime 3 ms.
[2026-05-24 12:14:53] [INFO ] Implicit Places using invariants in 268 ms returned []
[2026-05-24 12:14:53] [INFO ] Invariant cache hit.
[2026-05-24 12:14:54] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-24 12:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 20 solved, 392 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 24 solved, 388 unsolved
Problem TDEAD338 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 25 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 25 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/885 variables, and 186 constraints, problems are : Problem set: 25 solved, 387 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/472 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 15/15 constraints. Problems are: Problem set: 25 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/15 constraints. Problems are: Problem set: 25 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 74/89 constraints. Problems are: Problem set: 25 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/95 constraints. Problems are: Problem set: 25 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 91/186 constraints. Problems are: Problem set: 25 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/206 constraints. Problems are: Problem set: 25 solved, 387 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/226 constraints. Problems are: Problem set: 28 solved, 384 unsolved
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/246 constraints. Problems are: Problem set: 31 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/266 constraints. Problems are: Problem set: 31 solved, 381 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 20/286 constraints. Problems are: Problem set: 31 solved, 381 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 20/306 constraints. Problems are: Problem set: 31 solved, 381 unsolved
SMT process timed out in 60081ms, After SMT, problems are : Problem set: 31 solved, 381 unsolved
Search for dead transitions found 31 dead transitions in 60083ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/506 places, 382/447 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 382
Applied a total of 2 rules in 12 ms. Remains 470 /472 variables (removed 2) and now considering 382/382 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3780730550126618010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-283130270544298760.kers'
[2026-05-24 12:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3780730550126618010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-283130270544298760.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 382 rows 470 cols 1153 entries
Finished phase 1 with 302 SingleSign rule and 67 generalized
[2026-05-24 12:15:55] [INFO ] Computed 101 invariants in 2 ms
Computed 101 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-283130270544298760.kers
Total runtime 3 ms.
[2026-05-24 12:15:55] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-24 12:15:55] [INFO ] Invariant cache hit.
[2026-05-24 12:15:56] [INFO ] Implicit Places using invariants and state equation in 924 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 469/506 places, 382/447 transitions.
Applied a total of 0 rules in 12 ms. Remains 469 /469 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63073 ms. Remains : 469/506 places, 382/447 transitions.
[2026-05-24 12:15:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:15:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:15:56] [INFO ] Input system was already deterministic with 382 transitions.
[2026-05-24 12:15:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:15:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:15:56] [INFO ] Time to serialize gal into /tmp/CTLFireability18000052802957284546.gal : 2 ms
[2026-05-24 12:15:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5541598206846967277.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/CTLFireability18000052802957284546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5541598206846967277.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.
Detected timeout of ITS tools.
[2026-05-24 12:16:26] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:16:26] [INFO ] Applying decomposition
[2026-05-24 12:16:26] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8921065746968856473.txt' '-o' '/tmp/graph8921065746968856473.bin' '-w' '/tmp/graph8921065746968856473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8921065746968856473.bin' '-l' '-1' '-v' '-w' '/tmp/graph8921065746968856473.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:16:26] [INFO ] Decomposing Gal with order
[2026-05-24 12:16:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:16:26] [INFO ] Removed a total of 129 redundant transitions.
[2026-05-24 12:16:26] [INFO ] Flatten gal took : 28 ms
[2026-05-24 12:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2026-05-24 12:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10333579655085365969.gal : 3 ms
[2026-05-24 12:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13860861370278783122.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/CTLFireability10333579655085365969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13860861370278783122.ctl'

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 -...264
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,1.12318e+27,1.47384,51552,4766,30,91388,435,887,211977,48,1143,0


Converting to forward existential form...Done !
original formula: AG(AX(((i14.u33.p103==0)||(i0.u155.p600==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((i14.u33.p103==0)||(i0.u155.p600==1))))] = FALSE
(forward)formula 0,0,1.82089,51680,1,0,91388,435,1346,211977,62,1143,81011
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 482 transition count 423
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 482 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 472 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 472 transition count 413
Applied a total of 68 rules in 16 ms. Remains 472 /506 variables (removed 34) and now considering 413/447 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4091515357186338250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1549985023733026118.kers'
[2026-05-24 12:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4091515357186338250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1549985023733026118.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 413 rows 472 cols 1343 entries
Finished phase 1 with 301 SingleSign rule and 76 generalized
[2026-05-24 12:16:28] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1549985023733026118.kers
Total runtime 3 ms.
[2026-05-24 12:16:28] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-24 12:16:28] [INFO ] Invariant cache hit.
[2026-05-24 12:16:29] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2026-05-24 12:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 2 solved, 410 unsolved
Problem TDEAD350 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 3 solved, 409 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 6 solved, 406 unsolved
Problem TDEAD322 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 14 solved, 398 unsolved
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 14 solved, 398 unsolved
Search for dead transitions found 14 dead transitions in 30164ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/506 places, 399/447 transitions.
Applied a total of 0 rules in 8 ms. Remains 472 /472 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31819 ms. Remains : 472/506 places, 399/447 transitions.
[2026-05-24 12:17:00] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:17:00] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:17:00] [INFO ] Input system was already deterministic with 399 transitions.
[2026-05-24 12:17:00] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:17:00] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4344982159327774624.gal : 1 ms
[2026-05-24 12:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14217643365949391019.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/CTLFireability4344982159327774624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14217643365949391019.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.
Detected timeout of ITS tools.
[2026-05-24 12:17:30] [INFO ] Flatten gal took : 9 ms
[2026-05-24 12:17:30] [INFO ] Applying decomposition
[2026-05-24 12:17:30] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9816421126891719508.txt' '-o' '/tmp/graph9816421126891719508.bin' '-w' '/tmp/graph9816421126891719508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9816421126891719508.bin' '-l' '-1' '-v' '-w' '/tmp/graph9816421126891719508.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:17:30] [INFO ] Decomposing Gal with order
[2026-05-24 12:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:17:30] [INFO ] Removed a total of 198 redundant transitions.
[2026-05-24 12:17:30] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-24 12:17:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10038588848243796312.gal : 3 ms
[2026-05-24 12:17:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16532985877673951127.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/CTLFireability10038588848243796312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16532985877673951127.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Graph (trivial) has 250 edges and 506 vertex of which 6 / 506 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1126 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 499 transition count 381
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 441 transition count 381
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 118 place count 441 transition count 278
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 341 place count 321 transition count 278
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 365 place count 297 transition count 254
Iterating global reduction 2 with 24 rules applied. Total rules applied 389 place count 297 transition count 254
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 389 place count 297 transition count 251
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 395 place count 294 transition count 251
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 640 place count 169 transition count 131
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 2 with 2 rules applied. Total rules applied 642 place count 168 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 643 place count 167 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 644 place count 166 transition count 129
Applied a total of 644 rules in 51 ms. Remains 166 /506 variables (removed 340) and now considering 129/447 (removed 318) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2928122585018207717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3094147947862923105.kers'
[2026-05-24 12:18:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2928122585018207717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3094147947862923105.kers]
Normalized transition count is 128 out of 129 initially.
Culling duplicate invariants (modulo rational): removing 52 columns.
Culled 52 columns in 0 ms.
// Phase 1: matrix 128 rows 114 cols 486 entries
Finished phase 1 with 76 SingleSign rule and 18 generalized
[2026-05-24 12:18:00] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3094147947862923105.kers
Total runtime 1 ms.
[2026-05-24 12:18:00] [INFO ] Implicit Places using invariants in 135 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 146 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/506 places, 129/447 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 204 ms. Remains : 147/506 places, 129/447 transitions.
[2026-05-24 12:18:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:00] [INFO ] Input system was already deterministic with 129 transitions.
[2026-05-24 12:18:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:18:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11500878100522768380.gal : 1 ms
[2026-05-24 12:18:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4768291023282732506.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/CTLFireability11500878100522768380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4768291023282732506.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,20490,0.47722,23848,2,7893,5,87024,6,0,716,46098,0


Converting to forward existential form...Done !
original formula: EG(AG((p526==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p526==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t27, t28, t29, t30, t31, t55, t56, t57, t58, t59, t84, t85, t121, t122, t123, Intersecti...244
(forward)formula 0,0,3.28607,103928,1,0,165,510928,253,90,5203,223136,241
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Graph (trivial) has 248 edges and 506 vertex of which 6 / 506 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1126 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 499 transition count 382
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 116 place count 442 transition count 382
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 116 place count 442 transition count 279
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 339 place count 322 transition count 279
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 363 place count 298 transition count 255
Iterating global reduction 2 with 24 rules applied. Total rules applied 387 place count 298 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 387 place count 298 transition count 252
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 393 place count 295 transition count 252
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 634 place count 172 transition count 134
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 2 with 2 rules applied. Total rules applied 636 place count 171 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 637 place count 170 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 169 transition count 132
Applied a total of 638 rules in 40 ms. Remains 169 /506 variables (removed 337) and now considering 132/447 (removed 315) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6039626257546303498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-893631811687773540.kers'
[2026-05-24 12:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6039626257546303498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-893631811687773540.kers]
Normalized transition count is 131 out of 132 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 131 rows 134 cols 544 entries
Finished phase 1 with 86 SingleSign rule and 11 generalized
[2026-05-24 12:18:03] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-893631811687773540.kers
Total runtime 1 ms.
[2026-05-24 12:18:04] [INFO ] Implicit Places using invariants in 175 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 177 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/506 places, 132/447 transitions.
Applied a total of 0 rules in 18 ms. Remains 150 /150 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 238 ms. Remains : 150/506 places, 132/447 transitions.
[2026-05-24 12:18:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:18:04] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:04] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-24 12:18:04] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:04] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6944867439597338796.gal : 1 ms
[2026-05-24 12:18:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9874969316706231704.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/CTLFireability6944867439597338796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9874969316706231704.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,32910,0.217342,13856,2,5112,5,41603,6,0,732,35944,0


Converting to forward existential form...Done !
original formula: EF(AG(E((p379!=1) U (p527==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p379!=1) U (p527==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t29, t30, t31, t32, t33, t57, t58, t59, t60, t61, t81, t87, t88, t104, t111, t124, t1...265
(forward)formula 0,0,3.25526,127100,1,0,339,645276,256,177,5381,502978,415
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Graph (trivial) has 249 edges and 506 vertex of which 6 / 506 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1126 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 499 transition count 382
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 116 place count 442 transition count 382
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 116 place count 442 transition count 279
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 339 place count 322 transition count 279
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 363 place count 298 transition count 255
Iterating global reduction 2 with 24 rules applied. Total rules applied 387 place count 298 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 387 place count 298 transition count 252
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 393 place count 295 transition count 252
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 638 place count 170 transition count 132
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 2 with 2 rules applied. Total rules applied 640 place count 169 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 168 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 167 transition count 130
Applied a total of 642 rules in 34 ms. Remains 167 /506 variables (removed 339) and now considering 130/447 (removed 317) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5372033169778915500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12430624958958906061.kers'
[2026-05-24 12:18:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5372033169778915500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12430624958958906061.kers]
Normalized transition count is 129 out of 130 initially.
Culling duplicate invariants (modulo rational): removing 52 columns.
Culled 52 columns in 0 ms.
// Phase 1: matrix 129 rows 115 cols 486 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-24 12:18:07] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12430624958958906061.kers
Total runtime 1 ms.
[2026-05-24 12:18:07] [INFO ] Implicit Places using invariants in 126 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 141 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/506 places, 130/447 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 178 ms. Remains : 148/506 places, 130/447 transitions.
[2026-05-24 12:18:07] [INFO ] Flatten gal took : 2 ms
[2026-05-24 12:18:07] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:18:07] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-24 12:18:07] [INFO ] Flatten gal took : 3 ms
[2026-05-24 12:18:07] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 451 steps (89 resets) in 6 ms. (64 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 12:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16213358112435032704.gal : 1 ms
[2026-05-24 12:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11170205963449643558.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16213358112435032704.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11170205963449643558.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 447/447 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 481 transition count 422
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 481 transition count 422
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 471 transition count 412
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 471 transition count 412
Applied a total of 70 rules in 18 ms. Remains 471 /506 variables (removed 35) and now considering 412/447 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5232925305082899678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12084694207883081944.kers'
[2026-05-24 12:18:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5232925305082899678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12084694207883081944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 471 cols 1341 entries
Finished phase 1 with 300 SingleSign rule and 76 generalized
[2026-05-24 12:18:07] [INFO ] Computed 95 invariants in 2 ms
Computed 95 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12084694207883081944.kers
Total runtime 3 ms.
[2026-05-24 12:18:07] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-24 12:18:07] [INFO ] Invariant cache hit.
[2026-05-24 12:18:09] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2026-05-24 12:18:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/115 constraints. Problems are: Problem set: 11 solved, 400 unsolved
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/135 constraints. Problems are: Problem set: 16 solved, 395 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD337 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/155 constraints. Problems are: Problem set: 18 solved, 393 unsolved
Problem TDEAD322 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/175 constraints. Problems are: Problem set: 21 solved, 390 unsolved
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 21 solved, 390 unsolved
Search for dead transitions found 21 dead transitions in 30142ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 471/506 places, 391/447 transitions.
Applied a total of 0 rules in 10 ms. Remains 471 /471 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31732 ms. Remains : 471/506 places, 391/447 transitions.
[2026-05-24 12:18:39] [INFO ] Flatten gal took : 4 ms
[2026-05-24 12:18:39] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:18:39] [INFO ] Input system was already deterministic with 391 transitions.
[2026-05-24 12:18:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:18:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:18:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12717892547673691234.gal : 2 ms
[2026-05-24 12:18:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4589051843621123693.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/CTLFireability12717892547673691234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4589051843621123693.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.
Detected timeout of ITS tools.
[2026-05-24 12:19:09] [INFO ] Flatten gal took : 5 ms
[2026-05-24 12:19:09] [INFO ] Applying decomposition
[2026-05-24 12:19:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12771338714012276562.txt' '-o' '/tmp/graph12771338714012276562.bin' '-w' '/tmp/graph12771338714012276562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12771338714012276562.bin' '-l' '-1' '-v' '-w' '/tmp/graph12771338714012276562.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:19:09] [INFO ] Decomposing Gal with order
[2026-05-24 12:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:19:09] [INFO ] Removed a total of 165 redundant transitions.
[2026-05-24 12:19:09] [INFO ] Flatten gal took : 13 ms
[2026-05-24 12:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-24 12:19:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12625115642132595398.gal : 5 ms
[2026-05-24 12:19:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4954267856789557422.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/CTLFireability12625115642132595398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4954267856789557422.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 12:19:39] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:19:39] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:19:39] [INFO ] Applying decomposition
[2026-05-24 12:19:39] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5055583414484726175.txt' '-o' '/tmp/graph5055583414484726175.bin' '-w' '/tmp/graph5055583414484726175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5055583414484726175.bin' '-l' '-1' '-v' '-w' '/tmp/graph5055583414484726175.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:19:39] [INFO ] Decomposing Gal with order
[2026-05-24 12:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:19:39] [INFO ] Removed a total of 262 redundant transitions.
[2026-05-24 12:19:39] [INFO ] Flatten gal took : 14 ms
[2026-05-24 12:19:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 12:19:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10954565339612166553.gal : 4 ms
[2026-05-24 12:19:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10188793615519996555.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/CTLFireability10954565339612166553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10188793615519996555.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 5 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,1.63768e+27,8.96215,219808,9872,68,337953,988,1234,865428,65,3341,0


Converting to forward existential form...Done !
original formula: AG(((AX((i12.i0.u89.p269==1)) + EX((i18.i1.u145.p509==1))) + (EF(((i10.i0.u43.p128==0)||(i10.i0.u44.p131==0))) + EG((i18.i1.u149.p603==0)...159
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((E(TRUE U ((i10.i0.u43.p128==0)||(i10.i0.u44.p131==0))) + EG((i18.i1.u149.p603==0))))...225
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t194, t298, t307, t414, t425, t432, i0.t198, i0.u75.t205, i0.u77.t201, i1.i0...1713
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2026-05-24 12:44:49] [INFO ] Applying decomposition
[2026-05-24 12:44:49] [INFO ] Flatten gal took : 7 ms
[2026-05-24 12:44:49] [INFO ] Decomposing Gal with order
[2026-05-24 12:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:44:49] [INFO ] Removed a total of 126 redundant transitions.
[2026-05-24 12:44:49] [INFO ] Flatten gal took : 16 ms
[2026-05-24 12:44:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 75 ms.
[2026-05-24 12:44:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5320577563262894566.gal : 8 ms
[2026-05-24 12:44:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12943719738556843547.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/CTLFireability5320577563262894566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12943719738556843547.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="BusinessProcesses-PT-16"
export BK_EXAMINATION="CTLFireability"
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 BusinessProcesses-PT-16, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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