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.r146-tall-177961074200410.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 GPUForwardProgress-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K Mar 7 11:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 7 11:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 10:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 10:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 11:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Mar 7 11:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 11:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 7 11:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 20K 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 GPUForwardProgress-PT-12a-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779725471791

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 16:11:12] [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-25 16:11:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:11:13] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2026-05-25 16:11:13] [INFO ] Transformed 56 places.
[2026-05-25 16:11:13] [INFO ] Transformed 69 transitions.
[2026-05-25 16:11:13] [INFO ] Found NUPN structural information;
[2026-05-25 16:11:13] [INFO ] Parsed PT model containing 56 places and 69 transitions and 261 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (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-283760478304945318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16357492310126762189.kers'
[2026-05-25 16:11:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-283760478304945318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16357492310126762189.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 54 rows 55 cols 205 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-25 16:11:13] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16357492310126762189.kers
Total runtime 1 ms.
[2026-05-25 16:11:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-25 16:11:13] [INFO ] Invariant cache hit.
[2026-05-25 16:11:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:13] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2026-05-25 16:11:13] [INFO ] Invariant cache hit.
[2026-05-25 16:11:13] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/109 variables, 55/124 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/111 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 139 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1987 ms.
Refiners :[Domain max(s): 56/56 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 56/56 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/109 variables, 55/124 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 54/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/110 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/111 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/111 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 193 constraints, problems are : Problem set: 0 solved, 54 unsolved in 4670 ms.
Refiners :[Domain max(s): 56/56 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 56/56 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6725ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 6741ms
Finished structural reductions in LTL mode , in 1 iterations and 7107 ms. Remains : 56/56 places, 55/55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:20] [INFO ] Invariant cache hit.
[2026-05-25 16:11:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 16:11:20] [INFO ] Invariant cache hit.
[2026-05-25 16:11:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:20] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 56/56 places, 55/55 transitions.
Support contains 49 out of 56 places after structural reductions.
[2026-05-25 16:11:20] [INFO ] Flatten gal took : 22 ms
[2026-05-25 16:11:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 16:11:20] [INFO ] Input system was already deterministic with 55 transitions.
Reduction of identical properties reduced properties to check from 53 to 46
RANDOM walk for 40000 steps (196 resets) in 1541 ms. (25 steps per ms) remains 3/46 properties
BEST_FIRST walk for 40003 steps (445 resets) in 479 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 312 ms. (127 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
[2026-05-25 16:11:21] [INFO ] Invariant cache hit.
[2026-05-25 16:11:21] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem AtomicPropp38 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 13/34 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 35/69 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 54/109 variables, 55/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 12/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/138 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/111 variables, 1/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/111 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 139 constraints, problems are : Problem set: 2 solved, 1 unsolved in 106 ms.
Refiners :[Domain max(s): 56/56 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 56/56 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/55 variables, 13/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 41/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/109 variables, 55/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 12/136 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/138 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 1/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/111 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/111 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/111 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 140 constraints, problems are : Problem set: 2 solved, 1 unsolved in 113 ms.
Refiners :[Domain max(s): 56/56 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 56/56 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 141 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2026-05-25 16:11:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:11:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:11:21] [INFO ] Input system was already deterministic with 55 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 174 edges and 56 vertex of which 42 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 5 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (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-359987810754827006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8810709296273086891.kers'
[2026-05-25 16:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-359987810754827006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8810709296273086891.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 55 cols 205 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-25 16:11:21] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8810709296273086891.kers
Total runtime 0 ms.
[2026-05-25 16:11:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 16:11:21] [INFO ] Invariant cache hit.
[2026-05-25 16:11:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2026-05-25 16:11:21] [INFO ] Invariant cache hit.
[2026-05-25 16:11:21] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 136 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1411 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 54/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 190 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3626 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5052ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 5052ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5154 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:26] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:11:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:11:26] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:26] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8656933737280233363.gal : 2 ms
[2026-05-25 16:11:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14839331630627883959.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/CTLFireability8656933737280233363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14839331630627883959.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,9.96004e+07,0.097954,8104,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: EX(AG((EG((p6==1)) + EF((((p24==1)&&(p51==1))&&(p55==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((EG((p6==1)) + E(TRUE U (((p24==1)&&(p51==1))&&(p55==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.220588,10808,1,0,206,43082,137,99,1983,26757,289
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 55 transition count 42
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 42
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 0 with 2 rules applied. Total rules applied 26 place count 42 transition count 41
Applied a total of 26 rules in 22 ms. Remains 42 /56 variables (removed 14) and now considering 41/55 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4077423098280211404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16532905136249851795.kers'
[2026-05-25 16:11:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4077423098280211404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16532905136249851795.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 40 rows 41 cols 140 entries
Finished phase 1 with 27 SingleSign rule and 1 generalized
[2026-05-25 16:11:27] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16532905136249851795.kers
Total runtime 0 ms.
[2026-05-25 16:11:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 16:11:27] [INFO ] Invariant cache hit.
[2026-05-25 16:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:11:27] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 16:11:27] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2026-05-25 16:11:27] [INFO ] Invariant cache hit.
[2026-05-25 16:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 12/42 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 40/82 variables, 42/98 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 99 constraints, problems are : Problem set: 0 solved, 29 unsolved in 583 ms.
Refiners :[Domain max(s): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 12/42 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 40/82 variables, 42/98 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 29/127 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/83 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/83 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 128 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1031 ms.
Refiners :[Domain max(s): 42/42 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1622ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1623ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/56 places, 41/55 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1820 ms. Remains : 42/56 places, 41/55 transitions.
[2026-05-25 16:11:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:11:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:29] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-25 16:11:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:29] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16812152106208788300.gal : 1 ms
[2026-05-25 16:11:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10421767252756283941.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/CTLFireability16812152106208788300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10421767252756283941.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11757e+06,0.0595,6692,2,1034,5,16459,6,0,211,10521,0


Converting to forward existential form...Done !
original formula: EF(AG((((((p1==1)&&(p5==1))&&((p9==1)&&(p13==1)))&&(((p17==1)&&(p21==1))&&((p25==1)&&(p29==1))))&&((((p33==1)&&(p37==1))&&((p41==1)&&(p45...187
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((p1==1)&&(p5==1))&&((p9==1)&&(p13==1)))&&(((p17==1)&&(p21==1))&&((p25==1)&&...251
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,0,0.195231,11172,1,0,95,36873,103,45,1517,26364,94
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (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-8741653679981230271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11051985234949018491.kers'
[2026-05-25 16:11:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8741653679981230271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11051985234949018491.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 55 cols 205 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-25 16:11:29] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11051985234949018491.kers
Total runtime 0 ms.
[2026-05-25 16:11:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 16:11:29] [INFO ] Invariant cache hit.
[2026-05-25 16:11:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:29] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2026-05-25 16:11:29] [INFO ] Invariant cache hit.
[2026-05-25 16:11:29] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 136 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1415 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 54/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 190 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3615 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5040ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 5042ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5167 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:11:34] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability814894148875330835.gal : 1 ms
[2026-05-25 16:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12186617446944811437.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/CTLFireability814894148875330835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12186617446944811437.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,9.96004e+07,0.092045,8200,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: EF(EG((!(E((p50==1) U (p31==1))) * (EX((((p38==0)||(p51==0))||(p55==0))) + (((p10==1)&&(p51==1))&&(p55==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E((p50==1) U (p31==1))) * (EX((((p38==0)||(p51==0))||(p55==0))) + (((p10==1)&&(p51==1))...179
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.126211,8424,1,0,123,26972,137,69,1946,18897,133
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 5 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:34] [INFO ] Invariant cache hit.
[2026-05-25 16:11:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 16:11:34] [INFO ] Invariant cache hit.
[2026-05-25 16:11:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:11:34] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5489391138443358579.gal : 1 ms
[2026-05-25 16:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13459640146700145580.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/CTLFireability5489391138443358579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13459640146700145580.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,9.96004e+07,0.090903,8220,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: EG(E(((p54==1) + EG(!(E((p39==1) U (p15==1))))) U ((p3==1) * AX(AF((((p26==1)&&(p51==1))&&(p55==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(((p54==1) + EG(!(E((p39==1) U (p15==1))))) U ((p3==1) * !(EX(!(!(EG(!((((p26==1)&&(p51==1))&&(p55==...177
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.05719,40496,1,0,601,237572,152,341,1973,212217,710
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:35] [INFO ] Invariant cache hit.
[2026-05-25 16:11:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 16:11:35] [INFO ] Invariant cache hit.
[2026-05-25 16:11:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:35] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:35] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16545318912122824427.gal : 0 ms
[2026-05-25 16:11:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9685366519739353915.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/CTLFireability16545318912122824427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9685366519739353915.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,9.96004e+07,0.089426,8228,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: EF(EG((EX((((((p36==1)&&(p51==1))&&(p55==1))||(((p46==1)&&(p51==1))&&(p55==1)))||(((p31==1)&&(p14==1))&&((p51==1)&&(p55==1))))) * AX(((p1...180
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EX((((((p36==1)&&(p51==1))&&(p55==1))||(((p46==1)&&(p51==1))&&(p55==1)))||(((p31==1)&&(p1...236
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.348374,17856,1,0,193,89706,137,93,1953,71587,261
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:36] [INFO ] Invariant cache hit.
[2026-05-25 16:11:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 16:11:36] [INFO ] Invariant cache hit.
[2026-05-25 16:11:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:36] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:11:36] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:36] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10828500230926630419.gal : 1 ms
[2026-05-25 16:11:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4186519327727419233.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/CTLFireability10828500230926630419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4186519327727419233.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,9.96004e+07,0.086909,8180,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: AF((AG(AF(!(E((p30==1) U (((p14==1)&&(p51==1))&&(p55==1)))))) * ((!(E((((p16==1)&&(p51==1))&&(p55==1)) U (AX((p11==1)) * ((p46==1)||(p27=...200
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(!(EG(!(!(E((p30==1) U (((p14==1)&&(p51==1))&&(p55==1)))))))))) * ((!(E((((p16==1)&&(p...287
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.695977,30048,1,0,545,169759,157,338,2051,150523,563
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-05 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 : 56/56 places, 55/55 transitions.
Graph (complete) has 174 edges and 56 vertex of which 42 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 42 transition count 45
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 33 transition count 45
Applied a total of 19 rules in 10 ms. Remains 33 /56 variables (removed 23) and now considering 45/55 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5382346458811861250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8752355500240553787.kers'
[2026-05-25 16:11:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5382346458811861250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8752355500240553787.kers]
Normalized transition count is 44 out of 45 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 44 rows 33 cols 161 entries
Finished phase 1 with 31 SingleSign rule and 1 generalized
[2026-05-25 16:11:37] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8752355500240553787.kers
Total runtime 0 ms.
[2026-05-25 16:11:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 16:11:37] [INFO ] Invariant cache hit.
[2026-05-25 16:11:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-25 16:11:37] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-25 16:11:37] [INFO ] Invariant cache hit.
[2026-05-25 16:11:37] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 44/76 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 80 constraints, problems are : Problem set: 0 solved, 44 unsolved in 849 ms.
Refiners :[Domain max(s): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 44/76 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 44/121 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1876 ms.
Refiners :[Domain max(s): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2736ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2737ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/56 places, 45/55 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2827 ms. Remains : 33/56 places, 45/55 transitions.
[2026-05-25 16:11:40] [INFO ] Flatten gal took : 7 ms
[2026-05-25 16:11:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:40] [INFO ] Input system was already deterministic with 45 transitions.
[2026-05-25 16:11:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8475939734341627147.gal : 0 ms
[2026-05-25 16:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9545809022880488981.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/CTLFireability8475939734341627147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9545809022880488981.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,7.53062e+06,0.153692,10756,2,835,5,43384,6,0,178,32366,0


Converting to forward existential form...Done !
original formula: EF(AG((((EG((p7==1)) + (p46!=1)) + ((p51!=1)||(p55!=1))) + (p26!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((EG((p7==1)) + (p46!=1)) + ((p51!=1)||(p55!=1))) + (p26!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t11, t12, t13, t14, t27, t29, t32, t34, t36, t37, t39, t41, t44, Intersection wi...237
(forward)formula 0,1,0.638316,26016,1,0,183,166757,119,83,1367,84621,217
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 4 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (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-5937004925558871011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16093569753528568020.kers'
[2026-05-25 16:11:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5937004925558871011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16093569753528568020.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 55 cols 205 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-25 16:11:40] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16093569753528568020.kers
Total runtime 1 ms.
[2026-05-25 16:11:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 16:11:40] [INFO ] Invariant cache hit.
[2026-05-25 16:11:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:40] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2026-05-25 16:11:40] [INFO ] Invariant cache hit.
[2026-05-25 16:11:40] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 136 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1447 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 54/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 190 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3617 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5076ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 5076ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5183 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:45] [INFO ] Flatten gal took : 9 ms
[2026-05-25 16:11:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:45] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4745887370996428688.gal : 1 ms
[2026-05-25 16:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2192742823166963749.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/CTLFireability4745887370996428688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2192742823166963749.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,9.96004e+07,0.100856,8204,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: ((AX((((p50==0) * AX(AF((p11==0)))) + (((EG((p19==0)) * A(((p47!=1)&&(p31==1)) U (p39==1))) * (((((p44==1)&&(p51==1))&&(p55==1))||(p53==1...271
=> equivalent forward existential formula: [(FwdU((Init * !((!(EX(!((((p50==0) * !(EX(!(!(EG(!((p11==0)))))))) + (((EG((p19==0)) * !((E(!((p39==1)) U (!(((...403
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,1.04711,38304,1,0,738,233589,162,350,2015,176948,1022
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:46] [INFO ] Invariant cache hit.
[2026-05-25 16:11:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 16:11:46] [INFO ] Invariant cache hit.
[2026-05-25 16:11:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:47] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:47] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:47] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:47] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:11:47] [INFO ] Time to serialize gal into /tmp/CTLFireability511017697548408294.gal : 1 ms
[2026-05-25 16:11:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17026758105343709963.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/CTLFireability511017697548408294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17026758105343709963.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,9.96004e+07,0.08983,8224,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: EF(((AG((((p42==1)&&(p51==1))&&(p55==1))) * EG((((p26==0)||(p51==0))||((p55==0)||(p35==0))))) * ((EF((p7==1)) + A(AX((p43==1)) U !(A((p3=...361
=> equivalent forward existential formula: ([((((FwdU(((FwdU(Init,TRUE) * (!(E(TRUE U !((((p42==1)&&(p51==1))&&(p55==1))))) * EG((((p26==0)||(p51==0))||((p...2086
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.91117,36492,1,0,874,212102,171,442,2085,170300,1180
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Graph (complete) has 174 edges and 56 vertex of which 42 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 41 transition count 49
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 37 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 36 transition count 48
Applied a total of 11 rules in 9 ms. Remains 36 /56 variables (removed 20) and now considering 48/55 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16107270973321048647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6728263846464051996.kers'
[2026-05-25 16:11:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16107270973321048647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6728263846464051996.kers]
Normalized transition count is 47 out of 48 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 36 cols 130 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-25 16:11:47] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6728263846464051996.kers
Total runtime 0 ms.
[2026-05-25 16:11:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 16:11:48] [INFO ] Invariant cache hit.
[2026-05-25 16:11:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:11:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2026-05-25 16:11:48] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2026-05-25 16:11:48] [INFO ] Invariant cache hit.
[2026-05-25 16:11:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 47/71 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 12/83 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/84 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 74 constraints, problems are : Problem set: 0 solved, 36 unsolved in 692 ms.
Refiners :[Domain max(s): 36/36 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 47/71 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 12/83 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 24/109 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 1/84 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 0/84 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 110 constraints, problems are : Problem set: 0 solved, 36 unsolved in 969 ms.
Refiners :[Domain max(s): 36/36 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1668ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1669ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/56 places, 48/55 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1772 ms. Remains : 36/56 places, 48/55 transitions.
[2026-05-25 16:11:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:11:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:49] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-25 16:11:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1304030521578990881.gal : 1 ms
[2026-05-25 16:11:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16817181066106259972.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/CTLFireability1304030521578990881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16817181066106259972.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,2.10237e+07,0.023992,4636,2,140,5,4562,6,0,194,3161,0


Converting to forward existential form...Done !
original formula: AG((EF(((A((p50==1) U (p47==1)) * A((p31==1) U (p15==1))) + (p27==1))) * ((EF((p19==1)) + (p39==1)) + AF(((p3==1)&&(p6==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((!((E(!((p47==1)) U (!((p50==1)) * !((p47==1)))) + EG(!((p47==1))))) * !((E(!((...335
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t31, t33, t35, Intersection with r...233
Hit Full ! (commute/partial/dont) 43/0/5
(forward)formula 0,0,0.077699,7048,1,0,124,17037,128,60,1317,19368,116
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 1 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (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-7083544487147725240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13993420355494383218.kers'
[2026-05-25 16:11:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7083544487147725240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13993420355494383218.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 55 cols 205 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-25 16:11:49] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13993420355494383218.kers
Total runtime 1 ms.
[2026-05-25 16:11:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 16:11:49] [INFO ] Invariant cache hit.
[2026-05-25 16:11:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2026-05-25 16:11:49] [INFO ] Invariant cache hit.
[2026-05-25 16:11:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 136 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1402 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 54/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 190 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3782 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5193ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 5193ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5307 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1668445442375724698.gal : 1 ms
[2026-05-25 16:11:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10294128536457418166.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/CTLFireability1668445442375724698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10294128536457418166.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,9.96004e+07,0.096735,8212,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: (EX((p19==1)) * AX(EX(((((p12==0)||(p51==0))||(p55==0)) * (AF((((p2==0)||(p51==0))||(p55==0))) + (p50==1))))))
=> equivalent forward existential formula: ([(Init * !(EX((p19==1))))] = FALSE * [(EY(Init) * !(EX(((((p12==0)||(p51==0))||(p55==0)) * (!(EG(!((((p2==0)||(...203
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.164248,8716,1,0,234,32369,135,114,1941,18897,266
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 4 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:55] [INFO ] Invariant cache hit.
[2026-05-25 16:11:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 16:11:55] [INFO ] Invariant cache hit.
[2026-05-25 16:11:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:55] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4838486504697199737.gal : 1 ms
[2026-05-25 16:11:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11396329463332775145.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/CTLFireability4838486504697199737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11396329463332775145.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,9.96004e+07,0.102336,8216,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: EX((EF(AX((p35==1))) + (EX(E(AG((((p24==1)&&(p51==1))&&(p55==1))) U A((((p34==1)&&(p51==1))&&(p55==1)) U (p7==1)))) * ((((EX(AG((p50==1))...348
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX(!((p35==1)))))] != FALSE + ((([(FwdU(((EY(Init) * EX(E(!(E(TRUE U !((((p24==1)&&(p...1171
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,1,0.19871,9856,1,0,114,33814,127,60,1975,25565,119
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 4 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:55] [INFO ] Invariant cache hit.
[2026-05-25 16:11:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 16:11:55] [INFO ] Invariant cache hit.
[2026-05-25 16:11:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:11:55] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1746462500981933737.gal : 0 ms
[2026-05-25 16:11:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12291404642506179055.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/CTLFireability1746462500981933737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12291404642506179055.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,9.96004e+07,0.095596,8200,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: AX(AG((p0==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p0==1)))] = FALSE
(forward)formula 0,0,0.152751,8420,1,0,8,26972,10,1,582,18897,4
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
[2026-05-25 16:11:55] [INFO ] Invariant cache hit.
[2026-05-25 16:11:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 16:11:56] [INFO ] Invariant cache hit.
[2026-05-25 16:11:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 16:11:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 55/56 places, 55/55 transitions.
[2026-05-25 16:11:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:11:56] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:56] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-25 16:11:56] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:56] [INFO ] Flatten gal took : 2 ms
[2026-05-25 16:11:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8710054876720138712.gal : 1 ms
[2026-05-25 16:11:56] [INFO ] Time to serialize properties into /tmp/CTLFireability433929248825119419.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/CTLFireability8710054876720138712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability433929248825119419.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 -...282
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,9.96004e+07,0.101616,8208,2,271,5,26972,6,0,276,18897,0


Converting to forward existential form...Done !
original formula: A(EF((AG((((p18==1)&&(p51==1))&&(p55==1))) * E(AF((((p24==1)&&(p51==1))&&(p55==1))) U (p39!=1)))) U ((p23==1) + A(((A((((p31==1)&&(p34==1...280
=> equivalent forward existential formula: [((Init * !(EG(!(((p23==1) + !((E(!(!(EX(!((EG((p23==1)) + !((E(!((p11==1)) U (!((p15==1)) * !((p11==1)))) + EG(...1720
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.44086,50880,1,0,991,304728,175,556,2070,249394,1373
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 16:11:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:11:57] [INFO ] Flatten gal took : 4 ms
Total runtime 44591 ms.

BK_STOP 1779725517627

--------------------
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="GPUForwardProgress-PT-12a"
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 GPUForwardProgress-PT-12a, 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 r146-tall-177961074200410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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