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.r050-smll-177946901000049.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 Champagne-PT-H06T0R, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.3K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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 Champagne-PT-H06T0R-CTLCardinality-2024-00
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-01
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-02
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-03
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-04
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-05
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-06
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-07
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-08
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-09
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-10
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-11
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-12
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-13
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-14
FORMULA_NAME Champagne-PT-H06T0R-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779489884440

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H06T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-22 22:44:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:44:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:44:47] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2026-05-22 22:44:47] [INFO ] Transformed 399 places.
[2026-05-22 22:44:47] [INFO ] Transformed 528 transitions.
[2026-05-22 22:44:47] [INFO ] Found NUPN structural information;
[2026-05-22 22:44:47] [INFO ] Parsed PT model containing 399 places and 528 transitions and 1345 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 327 transition count 456
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 327 transition count 456
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 170 place count 301 transition count 430
Iterating global reduction 0 with 26 rules applied. Total rules applied 196 place count 301 transition count 430
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 206 place count 291 transition count 408
Iterating global reduction 0 with 10 rules applied. Total rules applied 216 place count 291 transition count 408
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 221 place count 291 transition count 403
Applied a total of 221 rules in 177 ms. Remains 291 /399 variables (removed 108) and now considering 403/528 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1952061437024939296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3234237079990978156.kers'
[2026-05-22 22:44:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1952061437024939296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3234237079990978156.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 291 cols 1063 entries
Finished phase 1 with 271 SingleSign rule and 0 generalized
[2026-05-22 22:44:47] [INFO ] Computed 20 invariants in 3 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3234237079990978156.kers
Total runtime 6 ms.
[2026-05-22 22:44:48] [INFO ] Implicit Places using invariants in 685 ms returned []
[2026-05-22 22:44:48] [INFO ] Invariant cache hit.
[2026-05-22 22:44:48] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2026-05-22 22:44:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/694 variables, and 41 constraints, problems are : Problem set: 0 solved, 402 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (OVERLAPS) 403/694 variables, 291/332 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 402/734 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 13/747 constraints. Problems are: Problem set: 0 solved, 402 unsolved
SMT process timed out in 60409ms, After SMT, problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in LTL mode, iteration 1 : 291/399 places, 403/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62154 ms. Remains : 291/399 places, 403/528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2026-05-22 22:45:49] [INFO ] Invariant cache hit.
[2026-05-22 22:45:49] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-22 22:45:49] [INFO ] Invariant cache hit.
[2026-05-22 22:45:50] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 291/291 places, 403/403 transitions.
Support contains 91 out of 291 places after structural reductions.
[2026-05-22 22:45:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-22 22:45:50] [INFO ] Flatten gal took : 104 ms
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 22:45:50] [INFO ] Flatten gal took : 46 ms
[2026-05-22 22:45:50] [INFO ] Input system was already deterministic with 403 transitions.
Support contains 83 out of 291 places (down from 91) after GAL structural reductions.
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (175 resets) in 1576 ms. (25 steps per ms) remains 2/48 properties
BEST_FIRST walk for 40003 steps (13 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
[2026-05-22 22:45:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 65/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 222/291 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 403/694 variables, 291/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/694 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 311 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 65/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 222/291 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 403/694 variables, 291/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/694 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/694 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/694 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 694/694 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 100 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 18 ms.
[2026-05-22 22:45:52] [INFO ] Flatten gal took : 34 ms
[2026-05-22 22:45:52] [INFO ] Flatten gal took : 26 ms
[2026-05-22 22:45:52] [INFO ] Input system was already deterministic with 403 transitions.
Computed a total of 53 stabilizing places and 53 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 244 transition count 355
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 244 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 96 place count 244 transition count 353
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 123 place count 217 transition count 312
Iterating global reduction 1 with 27 rules applied. Total rules applied 150 place count 217 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 156 place count 217 transition count 306
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 201 transition count 274
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 201 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 195 place count 201 transition count 267
Applied a total of 195 rules in 24 ms. Remains 201 /291 variables (removed 90) and now considering 267/403 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4345344512656680423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7557175037588340264.kers'
[2026-05-22 22:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4345344512656680423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7557175037588340264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 201 cols 707 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-22 22:45:52] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7557175037588340264.kers
Total runtime 2 ms.
[2026-05-22 22:45:53] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-22 22:45:53] [INFO ] Invariant cache hit.
[2026-05-22 22:45:53] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-22 22:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/468 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 221 constraints, problems are : Problem set: 0 solved, 266 unsolved in 25426 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/221 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 266/487 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 494 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55499ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 55507ms
Starting structural reductions in LTL mode, iteration 1 : 201/291 places, 267/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55895 ms. Remains : 201/291 places, 267/403 transitions.
[2026-05-22 22:46:48] [INFO ] Flatten gal took : 30 ms
[2026-05-22 22:46:48] [INFO ] Flatten gal took : 24 ms
[2026-05-22 22:46:48] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-22 22:46:48] [INFO ] Flatten gal took : 31 ms
[2026-05-22 22:46:48] [INFO ] Flatten gal took : 22 ms
[2026-05-22 22:46:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality312919835514779440.gal : 14 ms
[2026-05-22 22:46:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality17051736214283316771.ctl : 6 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/CTLCardinality312919835514779440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17051736214283316771.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,1.48676e+19,0.278076,8304,2,1381,5,20448,6,0,1073,18363,0


Converting to forward existential form...Done !
original formula: AG(AX((((p234==0)||(p281==1)) + ((EF((p156==1)) * EX((p42==1))) * ((p234==1)||(p179==0))))))
=> equivalent forward existential formula: (([((EY(FwdU(Init,TRUE)) * !(((p234==0)||(p281==1)))) * !(E(TRUE U (p156==1))))] = FALSE * [((EY(FwdU(Init,TRUE)...307
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t64, t67, t71, t74, t75, t79, t85, t88,...375
(forward)formula 0,0,1.65312,42068,1,0,444,227516,554,234,6380,172659,544
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 244 transition count 355
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 244 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 96 place count 244 transition count 353
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 124 place count 216 transition count 318
Iterating global reduction 1 with 28 rules applied. Total rules applied 152 place count 216 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 156 place count 216 transition count 314
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 171 place count 201 transition count 283
Iterating global reduction 2 with 15 rules applied. Total rules applied 186 place count 201 transition count 283
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 192 place count 201 transition count 277
Applied a total of 192 rules in 15 ms. Remains 201 /291 variables (removed 90) and now considering 277/403 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10902308333791933432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14768337759118126811.kers'
[2026-05-22 22:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10902308333791933432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14768337759118126811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 201 cols 745 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-22 22:46:50] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14768337759118126811.kers
Total runtime 1 ms.
[2026-05-22 22:46:50] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-22 22:46:50] [INFO ] Invariant cache hit.
[2026-05-22 22:46:51] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2026-05-22 22:46:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/478 variables, 201/221 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/478 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 221 constraints, problems are : Problem set: 0 solved, 276 unsolved in 26135 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/478 variables, 201/221 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 276/497 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 505 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56200ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 56202ms
Starting structural reductions in LTL mode, iteration 1 : 201/291 places, 277/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56721 ms. Remains : 201/291 places, 277/403 transitions.
[2026-05-22 22:47:47] [INFO ] Flatten gal took : 22 ms
[2026-05-22 22:47:47] [INFO ] Flatten gal took : 21 ms
[2026-05-22 22:47:47] [INFO ] Input system was already deterministic with 277 transitions.
[2026-05-22 22:47:47] [INFO ] Flatten gal took : 21 ms
[2026-05-22 22:47:47] [INFO ] Flatten gal took : 21 ms
[2026-05-22 22:47:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18361931255023447838.gal : 7 ms
[2026-05-22 22:47:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10309445902044272756.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/CTLCardinality18361931255023447838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10309445902044272756.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,1.47641e+19,0.261922,8360,2,1362,5,20602,6,0,1083,17815,0


Converting to forward existential form...Done !
original formula: EX(EF((((p315==0)&&(p46==1)) * (EG(((p316==0)||(p229==1))) * (((p127==1)||(p360==0))||((p265==1)&&(p298==0)))))))
=> equivalent forward existential formula: [FwdG(((FwdU(EY(Init),TRUE) * ((p315==0)&&(p46==1))) * (((p127==1)||(p360==0))||((p265==1)&&(p298==0)))),((p316=...181
Hit Full ! (commute/partial/dont) 268/0/9
(forward)formula 0,1,1.43886,42124,1,0,54,198843,22,6,5284,150274,53
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Graph (trivial) has 281 edges and 291 vertex of which 43 / 291 are part of one of the 7 SCC in 4 ms
Free SCC test removed 36 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 254 transition count 285
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 108 rules applied. Total rules applied 184 place count 179 transition count 252
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 199 place count 164 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 199 place count 164 transition count 248
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 207 place count 160 transition count 248
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 240 place count 127 transition count 214
Iterating global reduction 3 with 33 rules applied. Total rules applied 273 place count 127 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 274 place count 127 transition count 213
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 274 place count 127 transition count 203
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 294 place count 117 transition count 203
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 300 place count 111 transition count 180
Iterating global reduction 4 with 6 rules applied. Total rules applied 306 place count 111 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 312 place count 111 transition count 174
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 404 place count 65 transition count 128
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 408 place count 61 transition count 111
Iterating global reduction 5 with 4 rules applied. Total rules applied 412 place count 61 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 416 place count 61 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 418 place count 59 transition count 105
Applied a total of 418 rules in 78 ms. Remains 59 /291 variables (removed 232) and now considering 105/403 (removed 298) transitions.
[2026-05-22 22:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4284458457126872588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-719483608879256137.kers'
[2026-05-22 22:47:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4284458457126872588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-719483608879256137.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 55 rows 54 cols 140 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 22:47:49] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-719483608879256137.kers
Total runtime 1 ms.
[2026-05-22 22:47:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 22:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 49 similar events)
[2026-05-22 22:47:49] [INFO ] Invariant cache hit.
[2026-05-22 22:47:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 22:47:49] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2026-05-22 22:47:49] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-22 22:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 49 similar events)
[2026-05-22 22:47:49] [INFO ] Invariant cache hit.
[2026-05-22 22:47:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 55/114 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 81 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 55/114 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 69/150 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 152 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7594ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 7601ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/291 places, 105/403 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7867 ms. Remains : 59/291 places, 105/403 transitions.
[2026-05-22 22:47:56] [INFO ] Flatten gal took : 19 ms
[2026-05-22 22:47:56] [INFO ] Flatten gal took : 15 ms
[2026-05-22 22:47:56] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-22 22:47:56] [INFO ] Flatten gal took : 7 ms
[2026-05-22 22:47:57] [INFO ] Flatten gal took : 7 ms
[2026-05-22 22:47:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality1431840381527858302.gal : 3 ms
[2026-05-22 22:47:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10629832714009707377.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/CTLCardinality1431840381527858302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10629832714009707377.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,8.78649e+08,0.023384,4504,2,109,5,1075,6,0,335,578,0


Converting to forward existential form...Done !
original formula: A(EF((p141!=0)) U (p262==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p262==1))))) * !(E(!((p262==1)) U (!(E(TRUE U (p141!=0))) * !((p262==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 103/0/2
Hit Full ! (commute/partial/dont) 103/0/2
(forward)formula 0,0,0.133051,7168,1,0,17,16127,25,10,1685,14563,14
FORMULA Champagne-PT-H06T0R-CTLCardinality-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 : 291/291 places, 403/403 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 241 transition count 352
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 241 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 241 transition count 350
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 133 place count 210 transition count 305
Iterating global reduction 1 with 31 rules applied. Total rules applied 164 place count 210 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 170 place count 210 transition count 299
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 186 place count 194 transition count 267
Iterating global reduction 2 with 16 rules applied. Total rules applied 202 place count 194 transition count 267
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 209 place count 194 transition count 260
Applied a total of 209 rules in 30 ms. Remains 194 /291 variables (removed 97) and now considering 260/403 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2476401280556735833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7548517030504312617.kers'
[2026-05-22 22:47:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2476401280556735833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7548517030504312617.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 194 cols 693 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-22 22:47:57] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7548517030504312617.kers
Total runtime 4 ms.
[2026-05-22 22:47:57] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-22 22:47:57] [INFO ] Invariant cache hit.
[2026-05-22 22:47:57] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 22:47:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/454 variables, 194/214 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 0/454 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 214 constraints, problems are : Problem set: 0 solved, 259 unsolved in 24176 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/454 variables, 194/214 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 259/473 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/454 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 259 unsolved
SMT process timed out in 54398ms, After SMT, problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 54399ms
Starting structural reductions in LTL mode, iteration 1 : 194/291 places, 260/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54873 ms. Remains : 194/291 places, 260/403 transitions.
[2026-05-22 22:48:52] [INFO ] Flatten gal took : 16 ms
[2026-05-22 22:48:52] [INFO ] Flatten gal took : 16 ms
[2026-05-22 22:48:52] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-22 22:48:52] [INFO ] Flatten gal took : 15 ms
[2026-05-22 22:48:52] [INFO ] Flatten gal took : 16 ms
[2026-05-22 22:48:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality17677982934034648589.gal : 4 ms
[2026-05-22 22:48:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15335564430856399157.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/CTLCardinality17677982934034648589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15335564430856399157.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,7.21163e+18,0.216216,7524,2,1182,5,17183,6,0,1038,13352,0


Converting to forward existential form...Done !
original formula: AX(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t63, t67, t72, t73, t77, t83, t87, t93,...357
(forward)formula 0,0,12.7795,332824,1,0,882,1.38776e+06,541,569,6191,2.72313e+06,917
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Graph (trivial) has 240 edges and 291 vertex of which 25 / 291 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 270 transition count 323
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 86 rules applied. Total rules applied 144 place count 213 transition count 294
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 163 place count 199 transition count 289
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 170 place count 194 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 171 place count 193 transition count 287
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 171 place count 193 transition count 277
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 191 place count 183 transition count 277
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 212 place count 162 transition count 255
Iterating global reduction 5 with 21 rules applied. Total rules applied 233 place count 162 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 162 transition count 254
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 234 place count 162 transition count 246
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 250 place count 154 transition count 246
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 253 place count 151 transition count 234
Iterating global reduction 6 with 3 rules applied. Total rules applied 256 place count 151 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 259 place count 151 transition count 231
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 355 place count 103 transition count 183
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 358 place count 100 transition count 170
Iterating global reduction 7 with 3 rules applied. Total rules applied 361 place count 100 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 364 place count 100 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 365 place count 99 transition count 166
Applied a total of 365 rules in 67 ms. Remains 99 /291 variables (removed 192) and now considering 166/403 (removed 237) transitions.
[2026-05-22 22:49:05] [INFO ] Flow matrix only has 133 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1473870586628466031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5782782445560413119.kers'
[2026-05-22 22:49:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1473870586628466031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5782782445560413119.kers]
Normalized transition count is 132 out of 133 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 99 cols 382 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-22 22:49:05] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5782782445560413119.kers
Total runtime 1 ms.
[2026-05-22 22:49:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 22:49:05] [INFO ] Flow matrix only has 133 transitions (discarded 33 similar events)
[2026-05-22 22:49:05] [INFO ] Invariant cache hit.
[2026-05-22 22:49:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-22 22:49:05] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2026-05-22 22:49:05] [INFO ] Redundant transitions in 5 ms returned []
Running 155 sub problems to find dead transitions.
[2026-05-22 22:49:05] [INFO ] Flow matrix only has 133 transitions (discarded 33 similar events)
[2026-05-22 22:49:05] [INFO ] Invariant cache hit.
[2026-05-22 22:49:05] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 3/99 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 132/231 variables, 99/123 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/232 variables, and 134 constraints, problems are : Problem set: 0 solved, 155 unsolved in 10413 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 3/99 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 132/231 variables, 99/123 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 155/289 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/232 variables, and 290 constraints, problems are : Problem set: 0 solved, 155 unsolved in 12193 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22620ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 22620ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/291 places, 166/403 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22919 ms. Remains : 99/291 places, 166/403 transitions.
[2026-05-22 22:49:27] [INFO ] Flatten gal took : 7 ms
[2026-05-22 22:49:27] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:49:27] [INFO ] Input system was already deterministic with 166 transitions.
[2026-05-22 22:49:27] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:49:27] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:49:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality14701677948607803910.gal : 2 ms
[2026-05-22 22:49:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1945829599947489855.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/CTLCardinality14701677948607803910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1945829599947489855.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,1.00647e+13,0.054174,5052,2,426,5,5027,6,0,557,3808,0


Converting to forward existential form...Done !
original formula: A((!((!(((p392==0)||(p75==1))) + ((E(((p261==0)||(p131==1)) U ((p339==0)||(p91==1))) * (p299==0)) * !((((p292==0)||(p51==1))&&((p207==0)|...399
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((!(((((p32==1)||(p205==0))||(p337==1)) * !((E(!((p305==1)) U (!((p342==0)) * !((p305==1)))...1059
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t15, t20, t25, t26, t32, t38, t40, t66, t109, t110, t123, Intersection with re...234
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,28.5326,727844,1,0,1796,3.2813e+06,388,1037,3893,6.4188e+06,1932
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 246 transition count 357
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 246 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 246 transition count 355
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 120 place count 218 transition count 313
Iterating global reduction 1 with 28 rules applied. Total rules applied 148 place count 218 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 154 place count 218 transition count 307
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 167 place count 205 transition count 282
Iterating global reduction 2 with 13 rules applied. Total rules applied 180 place count 205 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 186 place count 205 transition count 276
Applied a total of 186 rules in 14 ms. Remains 205 /291 variables (removed 86) and now considering 276/403 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6646891588601981259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3672665431318671652.kers'
[2026-05-22 22:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6646891588601981259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3672665431318671652.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 205 cols 735 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-22 22:49:56] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3672665431318671652.kers
Total runtime 1 ms.
[2026-05-22 22:49:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-22 22:49:56] [INFO ] Invariant cache hit.
[2026-05-22 22:49:57] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2026-05-22 22:49:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/481 variables, 205/232 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/481 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 232 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/481 variables, 205/232 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 275/507 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 4/512 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 512 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 205/291 places, 276/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 205/291 places, 276/403 transitions.
[2026-05-22 22:50:57] [INFO ] Flatten gal took : 15 ms
[2026-05-22 22:50:57] [INFO ] Flatten gal took : 16 ms
[2026-05-22 22:50:57] [INFO ] Input system was already deterministic with 276 transitions.
[2026-05-22 22:50:57] [INFO ] Flatten gal took : 13 ms
[2026-05-22 22:50:57] [INFO ] Flatten gal took : 12 ms
[2026-05-22 22:50:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7945609968057758103.gal : 4 ms
[2026-05-22 22:50:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6454708712402785820.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/CTLCardinality7945609968057758103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6454708712402785820.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,2.18212e+19,0.367555,9980,2,1656,5,29669,6,0,1098,25899,0


Converting to forward existential form...Done !
original formula: AG(EX((EF(((p302==0)||((p300==0)&&(p174==1)))) * AF(((p91==0) * AF(((p145==0)||(p36==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((E(TRUE U ((p302==0)||((p300==0)&&(p174==1)))) * !(EG(!(((p91==0) * !(EG(!(((p145==0)||...184
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t53, t56, t59, t63, t66, t70, t75, t76, t80, t86,...403
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.67094,225592,1,0,980,1.27521e+06,588,487,7040,1.60496e+06,1146
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-07 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 : 291/291 places, 403/403 transitions.
Graph (trivial) has 273 edges and 291 vertex of which 43 / 291 are part of one of the 7 SCC in 2 ms
Free SCC test removed 36 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 254 transition count 287
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 104 rules applied. Total rules applied 178 place count 181 transition count 256
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 192 place count 167 transition count 256
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 192 place count 167 transition count 250
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 161 transition count 250
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 236 place count 129 transition count 218
Iterating global reduction 3 with 32 rules applied. Total rules applied 268 place count 129 transition count 218
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 268 place count 129 transition count 209
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 286 place count 120 transition count 209
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 291 place count 115 transition count 188
Iterating global reduction 3 with 5 rules applied. Total rules applied 296 place count 115 transition count 188
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 301 place count 115 transition count 183
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 391 place count 70 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 395 place count 66 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 399 place count 66 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 403 place count 66 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 405 place count 64 transition count 115
Applied a total of 405 rules in 42 ms. Remains 64 /291 variables (removed 227) and now considering 115/403 (removed 288) transitions.
[2026-05-22 22:51:07] [INFO ] Flow matrix only has 71 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4244551076881071554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6032434611720369921.kers'
[2026-05-22 22:51:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4244551076881071554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6032434611720369921.kers]
Normalized transition count is 70 out of 71 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 70 rows 63 cols 193 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 22:51:07] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6032434611720369921.kers
Total runtime 1 ms.
[2026-05-22 22:51:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-22 22:51:07] [INFO ] Flow matrix only has 71 transitions (discarded 44 similar events)
[2026-05-22 22:51:07] [INFO ] Invariant cache hit.
[2026-05-22 22:51:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-22 22:51:07] [INFO ] Redundant transitions in 3 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-22 22:51:07] [INFO ] Flow matrix only has 71 transitions (discarded 44 similar events)
[2026-05-22 22:51:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 4/64 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 70/134 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 84 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3425 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 4/64 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 70/134 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 79/163 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 163 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3575 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7008ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 7008ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/291 places, 115/403 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7211 ms. Remains : 64/291 places, 115/403 transitions.
[2026-05-22 22:51:14] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:51:14] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:51:14] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-22 22:51:14] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:51:14] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:51:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1427927714357804817.gal : 2 ms
[2026-05-22 22:51:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14767532476111421710.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/CTLCardinality1427927714357804817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14767532476111421710.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23116e+09,0.0361,4564,2,120,5,1245,6,0,366,705,0


Converting to forward existential form...Done !
original formula: EG(((p219==0) * ((EG(((p367==0)||(p385==1))) + (p3==0)) + (p156==1))))
=> equivalent forward existential formula: [FwdG(Init,((p219==0) * ((EG(((p367==0)||(p385==1))) + (p3==0)) + (p156==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 110/0/5
(forward)formula 0,1,0.429434,11952,1,0,68,40204,26,60,1830,52862,66
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Graph (trivial) has 273 edges and 291 vertex of which 42 / 291 are part of one of the 7 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 255 transition count 291
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 100 rules applied. Total rules applied 172 place count 184 transition count 262
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 187 place count 171 transition count 260
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 169 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 168 transition count 258
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 192 place count 168 transition count 253
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 202 place count 163 transition count 253
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 234 place count 131 transition count 220
Iterating global reduction 5 with 32 rules applied. Total rules applied 266 place count 131 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 131 transition count 219
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 267 place count 131 transition count 209
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 287 place count 121 transition count 209
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 293 place count 115 transition count 186
Iterating global reduction 6 with 6 rules applied. Total rules applied 299 place count 115 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 305 place count 115 transition count 180
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 397 place count 69 transition count 134
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 401 place count 65 transition count 117
Iterating global reduction 7 with 4 rules applied. Total rules applied 405 place count 65 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 409 place count 65 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 411 place count 63 transition count 111
Applied a total of 411 rules in 60 ms. Remains 63 /291 variables (removed 228) and now considering 111/403 (removed 292) transitions.
[2026-05-22 22:51:14] [INFO ] Flow matrix only has 67 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11079645168551592798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12650860084627527841.kers'
[2026-05-22 22:51:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11079645168551592798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12650860084627527841.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 66 rows 59 cols 172 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-22 22:51:14] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12650860084627527841.kers
Total runtime 2 ms.
[2026-05-22 22:51:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-22 22:51:14] [INFO ] Flow matrix only has 67 transitions (discarded 44 similar events)
[2026-05-22 22:51:14] [INFO ] Invariant cache hit.
[2026-05-22 22:51:15] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2026-05-22 22:51:15] [INFO ] Redundant transitions in 5 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-22 22:51:15] [INFO ] Flow matrix only has 67 transitions (discarded 44 similar events)
[2026-05-22 22:51:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 66/129 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/130 variables, and 83 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3125 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 66/129 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 72/155 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/130 variables, and 157 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4142 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7283ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 7284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/291 places, 111/403 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7635 ms. Remains : 63/291 places, 111/403 transitions.
[2026-05-22 22:51:22] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:51:22] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:51:22] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-22 22:51:22] [INFO ] Flatten gal took : 4 ms
[2026-05-22 22:51:22] [INFO ] Flatten gal took : 3 ms
[2026-05-22 22:51:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality11649206807663839369.gal : 2 ms
[2026-05-22 22:51:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4973791357960919061.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/CTLCardinality11649206807663839369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4973791357960919061.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,4.25153e+09,0.035155,4536,2,107,5,1301,6,0,357,761,0


Converting to forward existential form...Done !
original formula: EG(!(A(EF(!(((p70==0)||(p80==1)))) U AG(!(((p398==1)&&((p278==0)||(p231==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(!(E(TRUE U !(!(((p398==1)&&((p278==0)||(p231==1)))))))) U (!(E(TRUE U !(((p70==0)||(p80==1))...298
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.809422,23112,1,0,81,91826,27,76,1847,143655,84
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 241 transition count 352
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 241 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 241 transition count 350
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 132 place count 211 transition count 306
Iterating global reduction 1 with 30 rules applied. Total rules applied 162 place count 211 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 168 place count 211 transition count 300
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 182 place count 197 transition count 270
Iterating global reduction 2 with 14 rules applied. Total rules applied 196 place count 197 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 203 place count 197 transition count 263
Applied a total of 203 rules in 12 ms. Remains 197 /291 variables (removed 94) and now considering 263/403 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6802496747857149765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4089316690959146995.kers'
[2026-05-22 22:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6802496747857149765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4089316690959146995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 197 cols 699 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-22 22:51:23] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4089316690959146995.kers
Total runtime 2 ms.
[2026-05-22 22:51:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-22 22:51:23] [INFO ] Invariant cache hit.
[2026-05-22 22:51:23] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-22 22:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/460 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 0/460 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 217 constraints, problems are : Problem set: 0 solved, 262 unsolved in 25538 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/460 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 262/479 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 5/492 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 492 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55579ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 55579ms
Starting structural reductions in LTL mode, iteration 1 : 197/291 places, 263/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55916 ms. Remains : 197/291 places, 263/403 transitions.
[2026-05-22 22:52:19] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:52:19] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:52:19] [INFO ] Input system was already deterministic with 263 transitions.
[2026-05-22 22:52:19] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:52:19] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:52:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13140419627140646031.gal : 4 ms
[2026-05-22 22:52:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1591004578107783128.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/CTLCardinality13140419627140646031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1591004578107783128.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.77599e+18,0.217248,7648,2,1194,5,17764,6,0,1053,14084,0


Converting to forward existential form...Done !
original formula: AF((((p379==0)&&(p334==1)) * EX(EG((p138==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p379==0)&&(p334==1)) * EX(EG((p138==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t26, t27, t31, t36, t39, t46, t47, t51, t57, t61, t66, t70, t75, t76, t80, t86, t90, t96,...358
(forward)formula 0,0,25.1974,636128,1,0,1166,2.60475e+06,553,661,6285,5.37762e+06,1190
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-10 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 : 291/291 places, 403/403 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 252 transition count 364
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 252 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 252 transition count 363
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 106 place count 225 transition count 322
Iterating global reduction 1 with 27 rules applied. Total rules applied 133 place count 225 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 138 place count 225 transition count 317
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 149 place count 214 transition count 295
Iterating global reduction 2 with 11 rules applied. Total rules applied 160 place count 214 transition count 295
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 165 place count 214 transition count 290
Applied a total of 165 rules in 14 ms. Remains 214 /291 variables (removed 77) and now considering 290/403 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5166720264303820102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14651440977927550757.kers'
[2026-05-22 22:52:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5166720264303820102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14651440977927550757.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 214 cols 771 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-22 22:52:44] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14651440977927550757.kers
Total runtime 2 ms.
[2026-05-22 22:52:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-22 22:52:44] [INFO ] Invariant cache hit.
[2026-05-22 22:52:44] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-22 22:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/504 variables, 214/236 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/504 variables, and 236 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/504 variables, 214/236 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 289/525 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 538 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 214/291 places, 290/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60394 ms. Remains : 214/291 places, 290/403 transitions.
[2026-05-22 22:53:45] [INFO ] Flatten gal took : 16 ms
[2026-05-22 22:53:45] [INFO ] Flatten gal took : 10 ms
[2026-05-22 22:53:45] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-22 22:53:45] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:53:45] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:53:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10708991947134807442.gal : 3 ms
[2026-05-22 22:53:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11231463913685062775.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/CTLCardinality10708991947134807442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11231463913685062775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.8869e+19,0.390006,10720,2,1889,5,31592,6,0,1148,30982,0


Converting to forward existential form...Done !
original formula: (A(EX(((p26==0)||(p391==1))) U (AG(!((((p374==0)||(p318==1))&&((p184==1)||(p118==0))))) * (p250==0))) + A((!(EX(((p196==0)||(p209==1)))) ...254
=> equivalent forward existential formula: ([((Init * !(EG(!((!(E(TRUE U !(!((((p374==0)||(p318==1))&&((p184==1)||(p118==0))))))) * (p250==0)))))) * !(E(!(...659
Reverse transition relation is NOT exact ! Due to transitions t6, t18, t30, t31, t35, t40, t43, t47, t55, t58, t64, t65, t66, t70, t75, t79, t84, t85, t88,...398
Detected timeout of ITS tools.
[2026-05-22 22:54:15] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:54:15] [INFO ] Applying decomposition
[2026-05-22 22:54:15] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12769165455267913626.txt' '-o' '/tmp/graph12769165455267913626.bin' '-w' '/tmp/graph12769165455267913626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12769165455267913626.bin' '-l' '-1' '-v' '-w' '/tmp/graph12769165455267913626.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:54:15] [INFO ] Decomposing Gal with order
[2026-05-22 22:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:54:15] [INFO ] Removed a total of 193 redundant transitions.
[2026-05-22 22:54:15] [INFO ] Flatten gal took : 113 ms
[2026-05-22 22:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 22 ms.
[2026-05-22 22:54:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality117378184193407461.gal : 11 ms
[2026-05-22 22:54:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality13044796821990387977.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/CTLCardinality117378184193407461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13044796821990387977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.8869e+19,0.507356,14384,1985,22,18802,421,516,37689,69,879,0


Converting to forward existential form...Done !
original formula: (A(EX(((i1.u6.p26==0)||(i19.u67.p391==1))) U (AG(!((((i20.i0.u62.p374==0)||(i16.u48.p318==1))&&((i10.u29.p184==1)||(i5.u17.p118==0))))) *...369
=> equivalent forward existential formula: ([((Init * !(EG(!((!(E(TRUE U !(!((((i20.i0.u62.p374==0)||(i16.u48.p318==1))&&((i10.u29.p184==1)||(i5.u17.p118==...892
Reverse transition relation is NOT exact ! Due to transitions t30, t65, t84, t128, t198, i0.t214, i1.t203, i2.t193, i3.t183, i4.t173, i5.t162, i5.u16.t158,...619
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Graph (trivial) has 271 edges and 291 vertex of which 40 / 291 are part of one of the 7 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 257 transition count 293
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 98 rules applied. Total rules applied 171 place count 185 transition count 267
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 184 place count 174 transition count 265
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 190 place count 172 transition count 261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 192 place count 170 transition count 261
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 192 place count 170 transition count 255
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 204 place count 164 transition count 255
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 236 place count 132 transition count 222
Iterating global reduction 5 with 32 rules applied. Total rules applied 268 place count 132 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 269 place count 132 transition count 221
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 269 place count 132 transition count 212
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 287 place count 123 transition count 212
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 293 place count 117 transition count 189
Iterating global reduction 6 with 6 rules applied. Total rules applied 299 place count 117 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 305 place count 117 transition count 183
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 399 place count 70 transition count 136
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 403 place count 66 transition count 119
Iterating global reduction 7 with 4 rules applied. Total rules applied 407 place count 66 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 411 place count 66 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 413 place count 64 transition count 113
Applied a total of 413 rules in 35 ms. Remains 64 /291 variables (removed 227) and now considering 113/403 (removed 290) transitions.
[2026-05-22 22:54:45] [INFO ] Flow matrix only has 73 transitions (discarded 40 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14354957759042215922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4553566661853714972.kers'
[2026-05-22 22:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14354957759042215922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4553566661853714972.kers]
Normalized transition count is 72 out of 73 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 72 rows 60 cols 192 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 22:54:45] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4553566661853714972.kers
Total runtime 1 ms.
[2026-05-22 22:54:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 22:54:45] [INFO ] Flow matrix only has 73 transitions (discarded 40 similar events)
[2026-05-22 22:54:45] [INFO ] Invariant cache hit.
[2026-05-22 22:54:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2026-05-22 22:54:45] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-22 22:54:45] [INFO ] Flow matrix only has 73 transitions (discarded 40 similar events)
[2026-05-22 22:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 72/136 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 0/136 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/137 variables, and 84 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 72/136 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 69/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/137 variables, and 153 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6104ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 6104ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/291 places, 113/403 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6348 ms. Remains : 64/291 places, 113/403 transitions.
[2026-05-22 22:54:51] [INFO ] Flatten gal took : 10 ms
[2026-05-22 22:54:51] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:54:51] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-22 22:54:51] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:54:51] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:54:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15762601897461095707.gal : 2 ms
[2026-05-22 22:54:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13329099027069547508.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/CTLCardinality15762601897461095707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13329099027069547508.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,6.04662e+09,0.039645,4556,2,109,5,1360,6,0,365,837,0


Converting to forward existential form...Done !
original formula: !(A((p394!=0) U EG(!(A(E(((p233==0)||(p297==1)) U ((p31==0)||(p350==1))) U (p278==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(!(!((E(!((p278==1)) U (!(E(((p233==0)||(p297==1)) U ((p31==0)||(p350==1)))) * !((p278==1)))) ...477
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 108/0/5
Hit Full ! (commute/partial/dont) 110/0/3
Hit Full ! (commute/partial/dont) 110/0/3
Using saturation style SCC detection
(forward)formula 0,0,0.545253,14064,1,0,100,47564,43,69,1970,64762,79
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Graph (trivial) has 263 edges and 291 vertex of which 38 / 291 are part of one of the 7 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 259 transition count 297
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 98 rules applied. Total rules applied 169 place count 189 transition count 269
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 184 place count 176 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 174 transition count 267
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 186 place count 174 transition count 262
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 196 place count 169 transition count 262
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 225 place count 140 transition count 232
Iterating global reduction 4 with 29 rules applied. Total rules applied 254 place count 140 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 140 transition count 231
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 255 place count 140 transition count 222
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 273 place count 131 transition count 222
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 278 place count 126 transition count 204
Iterating global reduction 5 with 5 rules applied. Total rules applied 283 place count 126 transition count 204
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 288 place count 126 transition count 199
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 384 place count 78 transition count 151
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 388 place count 74 transition count 134
Iterating global reduction 6 with 4 rules applied. Total rules applied 392 place count 74 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 396 place count 74 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 398 place count 72 transition count 128
Applied a total of 398 rules in 51 ms. Remains 72 /291 variables (removed 219) and now considering 128/403 (removed 275) transitions.
[2026-05-22 22:54:52] [INFO ] Flow matrix only has 89 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-624521828949684810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10071040358924493894.kers'
[2026-05-22 22:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-624521828949684810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10071040358924493894.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 88 rows 70 cols 238 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 22:54:52] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10071040358924493894.kers
Total runtime 2 ms.
[2026-05-22 22:54:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 22:54:52] [INFO ] Flow matrix only has 89 transitions (discarded 39 similar events)
[2026-05-22 22:54:52] [INFO ] Invariant cache hit.
[2026-05-22 22:54:52] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2026-05-22 22:54:52] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-22 22:54:52] [INFO ] Flow matrix only has 89 transitions (discarded 39 similar events)
[2026-05-22 22:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/160 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/161 variables, and 93 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4686 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 4/72 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/160 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 87/180 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/161 variables, and 182 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5653 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10351ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10352ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/291 places, 128/403 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10659 ms. Remains : 72/291 places, 128/403 transitions.
[2026-05-22 22:55:03] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:55:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:55:03] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-22 22:55:03] [INFO ] Flatten gal took : 6 ms
[2026-05-22 22:55:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 22:55:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15269578491022532378.gal : 1 ms
[2026-05-22 22:55:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6303534852260430262.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/CTLCardinality15269578491022532378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6303534852260430262.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,4.44426e+10,0.030536,4660,2,207,5,2314,6,0,410,1723,0


Converting to forward existential form...Done !
original formula: AF(!(E(E(A(((p88==0)||(p124==1)) U ((p175==0)||(p14==1))) U (((p168==0)||(p315==0)) + ((p48==1) + EF(((p238==0)||(p281==1)))))) U EG((p39...164
=> equivalent forward existential formula: [FwdG(Init,!(!(E(E(!((E(!(((p175==0)||(p14==1))) U (!(((p88==0)||(p124==1))) * !(((p175==0)||(p14==1))))) + EG(!...286
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...174
(forward)formula 0,0,0.946504,29164,1,0,552,132766,294,273,2778,183017,665
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 403/403 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 243 transition count 354
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 243 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 243 transition count 352
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 128 place count 213 transition count 308
Iterating global reduction 1 with 30 rules applied. Total rules applied 158 place count 213 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 164 place count 213 transition count 302
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 198 transition count 271
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 198 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 200 place count 198 transition count 265
Applied a total of 200 rules in 21 ms. Remains 198 /291 variables (removed 93) and now considering 265/403 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4871125573851742361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17018374077520483691.kers'
[2026-05-22 22:55:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4871125573851742361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17018374077520483691.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 198 cols 703 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-22 22:55:04] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17018374077520483691.kers
Total runtime 2 ms.
[2026-05-22 22:55:04] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-22 22:55:04] [INFO ] Invariant cache hit.
[2026-05-22 22:55:04] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-22 22:55:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/463 variables, 198/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 0/463 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 218 constraints, problems are : Problem set: 0 solved, 264 unsolved in 26148 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/463 variables, 198/218 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 264/482 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 484 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56194ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 56197ms
Starting structural reductions in LTL mode, iteration 1 : 198/291 places, 265/403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56682 ms. Remains : 198/291 places, 265/403 transitions.
[2026-05-22 22:56:00] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:56:00] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:56:00] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-22 22:56:00] [INFO ] Flatten gal took : 11 ms
[2026-05-22 22:56:00] [INFO ] Flatten gal took : 9 ms
[2026-05-22 22:56:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17198920551688977954.gal : 3 ms
[2026-05-22 22:56:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14820213886006126742.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/CTLCardinality17198920551688977954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14820213886006126742.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,1.10012e+19,0.223472,7572,2,1208,5,17404,6,0,1059,13519,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(((p354==0)||(p49==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U ((p354==0)||(p49==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t28, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88,...362
(forward)formula 0,1,1.86665,51164,1,0,471,258380,555,231,6702,221842,588
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-22 22:56:02] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:56:02] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:56:02] [INFO ] Applying decomposition
[2026-05-22 22:56:02] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4131252982021092281.txt' '-o' '/tmp/graph4131252982021092281.bin' '-w' '/tmp/graph4131252982021092281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4131252982021092281.bin' '-l' '-1' '-v' '-w' '/tmp/graph4131252982021092281.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:56:02] [INFO ] Decomposing Gal with order
[2026-05-22 22:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:56:03] [INFO ] Removed a total of 264 redundant transitions.
[2026-05-22 22:56:03] [INFO ] Flatten gal took : 46 ms
[2026-05-22 22:56:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 21 ms.
[2026-05-22 22:56:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2490427545126724868.gal : 9 ms
[2026-05-22 22:56:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15543070176463908396.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/CTLCardinality2490427545126724868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15543070176463908396.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.08038e+22,0.593318,14480,2323,34,21653,546,696,30906,72,1359,0


Converting to forward existential form...Done !
original formula: (A(EX(((i2.u9.p26==0)||(i20.i1.u98.p391==1))) U (AG(!((((i19.i1.u94.p374==0)||(i16.u74.p318==1))&&((i10.u47.p184==1)||(i6.u28.p118==0))))...375
=> equivalent forward existential formula: ([((Init * !(EG(!((!(E(TRUE U !(!((((i19.i1.u94.p374==0)||(i16.u74.p318==1))&&((i10.u47.p184==1)||(i6.u28.p118==...898
Reverse transition relation is NOT exact ! Due to transitions t112, t251, i0.t284, i0.t281, i0.u3.t286, i2.u7.t271, i2.u10.t268, i3.t257, i4.t243, i4.u15.t...940
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,43.1745,861572,1,0,1.56553e+06,666,4763,2.61846e+06,418,1593,1897889
FORMULA Champagne-PT-H06T0R-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 719875 ms.

BK_STOP 1779490606548

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H06T0R, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-177946901000049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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