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.r210-smll-177969942100305.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 PolyORBLF-COL-S02J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969942100305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.7K Mar 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 8 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 16 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 16 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 8 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 8 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 8 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780060760115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-29 13:19:22] [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-29 13:19:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-29 13:19:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-29 13:19:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-29 13:19:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1315 ms
[2026-05-29 13:19:24] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
[2026-05-29 13:19:24] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 10 ms.
[2026-05-29 13:19:24] [INFO ] Skeletonized 16 HLPN properties in 6 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (16 resets) in 3351 ms. (11 steps per ms) remains 53/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 130 ms. (30 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (9 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 73 ms. (54 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (9 resets) in 82 ms. (48 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 62 ms. (63 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
[2026-05-29 13:19:26] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-153504196348408274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1138056188868003839.kers'
[2026-05-29 13:19:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-153504196348408274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1138056188868003839.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 64 rows 73 cols 204 entries
Finished phase 1 with 43 SingleSign rule and 12 generalized
[2026-05-29 13:19:26] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1138056188868003839.kers
Total runtime 3 ms.
[2026-05-29 13:19:26] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 46 unsolved
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 2/5 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 44 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/63 variables, 5/10 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/81 variables, 16/26 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 51 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 51 solved, 1 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/58 variables, 4/6 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/7 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 17/75 variables, 15/22 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/23 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/78 variables, 3/26 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 1/115 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/117 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/118 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 51 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 51 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2016ms problems are : Problem set: 51 solved, 1 unsolved
Parikh walk visited 0 properties in 137 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 56 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2026-05-29 13:19:28] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2177050479436830505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9373779229271425382.kers'
[2026-05-29 13:19:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2177050479436830505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9373779229271425382.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 44 rows 53 cols 178 entries
Finished phase 1 with 23 SingleSign rule and 12 generalized
[2026-05-29 13:19:28] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9373779229271425382.kers
Total runtime 1 ms.
[2026-05-29 13:19:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 4/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/94 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 1/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 1/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 105 constraints, problems are : Problem set: 2 solved, 42 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 16/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 9/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/37 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 3/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 1/151 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 151 constraints, problems are : Problem set: 2 solved, 42 unsolved in 5093 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9216ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 9218ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 56 transition count 39
Applied a total of 4 rules in 7 ms. Remains 56 /60 variables (removed 4) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9318 ms. Remains : 56/81 places, 39/65 transitions.
RANDOM walk for 40000 steps (47 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (45 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44431 steps, run visited all 1 properties in 118 ms. (steps per millisecond=376 )
Probabilistic random walk after 44431 steps, saw 20489 distinct states, run finished after 125 ms. (steps per millisecond=355 ) properties seen :1
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-29 13:19:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-29 13:19:38] [INFO ] Flatten gal took : 49 ms
[2026-05-29 13:19:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-29 13:19:38] [INFO ] Flatten gal took : 15 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2026-05-29 13:19:38] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 89 ms.
[2026-05-29 13:19:38] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 505 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 68 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2026-05-29 13:19:38] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8217596079386605218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3243090123156052284.kers'
[2026-05-29 13:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8217596079386605218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3243090123156052284.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 2 ms.
// Phase 1: matrix 1632 rows 837 cols 6486 entries
Finished phase 1 with 556 SingleSign rule and 230 generalized
[2026-05-29 13:19:38] [INFO ] Computed 58 invariants in 27 ms
Computed 58 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-3243090123156052284.kers
Total runtime 31 ms.
[2026-05-29 13:19:38] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
SMT process timed out in 23087ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 23111ms
[2026-05-29 13:20:01] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2026-05-29 13:20:01] [INFO ] Invariant cache hit.
[2026-05-29 13:20:03] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2026-05-29 13:20:03] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2026-05-29 13:20:03] [INFO ] Invariant cache hit.
[2026-05-29 13:20:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-29 13:20:23] [INFO ] Implicit Places using invariants and state equation in 20293 ms returned []
Implicit Place search using SMT with State Equation took 21751 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 44953 ms. Remains : 844/844 places, 1652/1652 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 21 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Skipped dead transition search.
[2026-05-29 13:20:23] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2026-05-29 13:20:23] [INFO ] Invariant cache hit.
[2026-05-29 13:20:24] [INFO ] Implicit Places using invariants in 922 ms returned []
[2026-05-29 13:20:24] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2026-05-29 13:20:24] [INFO ] Invariant cache hit.
[2026-05-29 13:20:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-29 13:20:44] [INFO ] Implicit Places using invariants and state equation in 19420 ms returned []
Implicit Place search using SMT with State Equation took 20344 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20368 ms. Remains : 844/844 places, 1652/1652 transitions.
Support contains 505 out of 844 places after structural reductions.
[2026-05-29 13:20:44] [INFO ] Flatten gal took : 221 ms
[2026-05-29 13:20:44] [INFO ] Flatten gal took : 158 ms
[2026-05-29 13:20:44] [INFO ] Input system was already deterministic with 1652 transitions.
Support contains 503 out of 844 places (down from 505) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 1356 ms. (29 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
[2026-05-29 13:20:45] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2026-05-29 13:20:45] [INFO ] Invariant cache hit.
[2026-05-29 13:20:45] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 2 (OVERLAPS) 586/817 variables, 13/22 constraints. Problems are: Problem set: 15 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 9/31 constraints. Problems are: Problem set: 15 solved, 8 unsolved
SMT process timed out in 5856ms, After SMT, problems are : Problem set: 15 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 842 transition count 1602
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 792 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 122 place count 782 transition count 1592
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 122 place count 782 transition count 1482
Deduced a syphon composed of 110 places in 5 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 342 place count 672 transition count 1482
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 422 place count 632 transition count 1442
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 452 place count 632 transition count 1412
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 482 place count 602 transition count 1412
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 492 place count 602 transition count 1412
Applied a total of 492 rules in 495 ms. Remains 602 /844 variables (removed 242) and now considering 1412/1652 (removed 240) transitions.
Running 1410 sub problems to find dead transitions.
[2026-05-29 13:20:51] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3386879177905304823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17866640208549595344.kers'
[2026-05-29 13:20:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3386879177905304823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17866640208549595344.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1392 rows 597 cols 6396 entries
Finished phase 1 with 314 SingleSign rule and 232 generalized
[2026-05-29 13:20:52] [INFO ] Computed 56 invariants in 22 ms
Computed 56 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-17866640208549595344.kers
Total runtime 26 ms.
[2026-05-29 13:20:52] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
SMT process timed out in 21321ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21835 ms. Remains : 602/844 places, 1412/1652 transitions.
RANDOM walk for 40000 steps (14 resets) in 822 ms. (48 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (11 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (16 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 269 ms. (148 steps per ms) remains 7/7 properties
[2026-05-29 13:21:14] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2026-05-29 13:21:14] [INFO ] Invariant cache hit.
[2026-05-29 13:21:14] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 513/558 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/558 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/560 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 7 (OVERLAPS) 36/596 variables, 26/52 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 0/52 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/600 variables, 4/56 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/56 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1392/1992 variables, 600/656 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1992 variables, 120/776 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1992 variables, 0/776 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1994 variables, 2/778 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1994 variables, 1/779 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1994 variables, 0/779 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1994 variables, 0/779 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1994/1994 variables, and 779 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2830 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 602/602 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 492/503 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 9/10 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 39/542 variables, 10/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/596 variables, 31/51 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/596 variables, 1/52 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 9/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/600 variables, 4/65 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/65 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1392/1992 variables, 600/665 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1992 variables, 120/785 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1992 variables, 1/786 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1992 variables, 0/786 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1994 variables, 2/788 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1994 variables, 1/789 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1994 variables, 0/789 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1994 variables, 0/789 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1994/1994 variables, and 789 constraints, problems are : Problem set: 6 solved, 1 unsolved in 9127 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 602/602 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11986ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 407 ms.
Support contains 11 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 1412/1412 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 1372
Applied a total of 80 rules in 75 ms. Remains 562 /602 variables (removed 40) and now considering 1372/1412 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 562/602 places, 1372/1412 transitions.
RANDOM walk for 40000 steps (18 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (16 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 203877 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 203877 steps, saw 126178 distinct states, run finished after 3005 ms. (steps per millisecond=67 ) properties seen :0
[2026-05-29 13:21:29] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10285798218969549372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5192107282791321182.kers'
[2026-05-29 13:21:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10285798218969549372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5192107282791321182.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1352 rows 557 cols 6366 entries
Finished phase 1 with 276 SingleSign rule and 230 generalized
[2026-05-29 13:21:29] [INFO ] Computed 56 invariants in 12 ms
Computed 56 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-5192107282791321182.kers
Total runtime 14 ms.
[2026-05-29 13:21:29] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/127 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 372/499 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/500 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/558 variables, 29/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/560 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1352/1912 variables, 560/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1912 variables, 120/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1912 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1914 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1914 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1914 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1914 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1914/1914 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2207 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 562/562 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/127 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 372/499 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/500 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/558 variables, 29/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/560 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1352/1912 variables, 560/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1912 variables, 120/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1912 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1912 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1914 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1914 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1914 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1914 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1914/1914 variables, and 748 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6524 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 562/562 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8772ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 11 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1372/1372 transitions.
Applied a total of 0 rules in 41 ms. Remains 562 /562 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 562/562 places, 1372/1372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1372/1372 transitions.
Applied a total of 0 rules in 41 ms. Remains 562 /562 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2026-05-29 13:21:38] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2026-05-29 13:21:38] [INFO ] Invariant cache hit.
[2026-05-29 13:21:40] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2026-05-29 13:21:40] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2026-05-29 13:21:40] [INFO ] Invariant cache hit.
[2026-05-29 13:21:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-29 13:21:56] [INFO ] Implicit Places using invariants and state equation in 16384 ms returned []
Implicit Place search using SMT with State Equation took 17900 ms to find 0 implicit places.
[2026-05-29 13:21:56] [INFO ] Redundant transitions in 136 ms returned []
Running 1370 sub problems to find dead transitions.
[2026-05-29 13:21:56] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
[2026-05-29 13:21:56] [INFO ] Invariant cache hit.
[2026-05-29 13:21:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
SMT process timed out in 31890ms, After SMT, problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 31897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49995 ms. Remains : 562/562 places, 1372/1372 transitions.
Successfully simplified 21 atomic propositions for a total of 8 simplifications.
[2026-05-29 13:22:29] [INFO ] Flatten gal took : 145 ms
[2026-05-29 13:22:29] [INFO ] Flatten gal took : 126 ms
[2026-05-29 13:22:29] [INFO ] Input system was already deterministic with 1652 transitions.
Support contains 299 out of 844 places (down from 330) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
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 70 place count 842 transition count 1582
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 772 transition count 1582
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 140 place count 772 transition count 1552
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 200 place count 742 transition count 1552
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 340 place count 672 transition count 1482
Applied a total of 340 rules in 138 ms. Remains 672 /844 variables (removed 172) and now considering 1482/1652 (removed 170) transitions.
Running 1480 sub problems to find dead transitions.
[2026-05-29 13:22:29] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12747291853528924444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13734913962191014948.kers'
[2026-05-29 13:22:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12747291853528924444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13734913962191014948.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1462 rows 667 cols 6396 entries
Finished phase 1 with 386 SingleSign rule and 230 generalized
[2026-05-29 13:22:29] [INFO ] Computed 56 invariants in 14 ms
Computed 56 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13734913962191014948.kers
Total runtime 16 ms.
[2026-05-29 13:22:29] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
SMT process timed out in 20971ms, After SMT, problems are : Problem set: 0 solved, 1480 unsolved
Search for dead transitions found 0 dead transitions in 20976ms
[2026-05-29 13:22:50] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2026-05-29 13:22:50] [INFO ] Invariant cache hit.
[2026-05-29 13:22:52] [INFO ] Implicit Places using invariants in 1468 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1483 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 662/844 places, 1482/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 652 transition count 1472
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 652 transition count 1472
Applied a total of 20 rules in 111 ms. Remains 652 /662 variables (removed 10) and now considering 1472/1482 (removed 10) transitions.
[2026-05-29 13:22:52] [INFO ] Flow matrix only has 1452 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-63376155581074914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16175530116269168710.kers'
[2026-05-29 13:22:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-63376155581074914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16175530116269168710.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1452 rows 647 cols 6346 entries
Finished phase 1 with 366 SingleSign rule and 240 generalized
[2026-05-29 13:22:52] [INFO ] Computed 46 invariants in 24 ms
Computed 46 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-16175530116269168710.kers
Total runtime 28 ms.
[2026-05-29 13:22:54] [INFO ] Implicit Places using invariants in 2254 ms returned []
[2026-05-29 13:22:54] [INFO ] Flow matrix only has 1452 transitions (discarded 20 similar events)
[2026-05-29 13:22:54] [INFO ] Invariant cache hit.
[2026-05-29 13:22:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-29 13:23:11] [INFO ] Implicit Places using invariants and state equation in 17405 ms returned []
Implicit Place search using SMT with State Equation took 19661 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 652/844 places, 1472/1652 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42376 ms. Remains : 652/844 places, 1472/1652 transitions.
[2026-05-29 13:23:11] [INFO ] Flatten gal took : 52 ms
[2026-05-29 13:23:12] [INFO ] Flatten gal took : 62 ms
[2026-05-29 13:23:12] [INFO ] Input system was already deterministic with 1472 transitions.
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-29 13:23:12] [INFO ] Flatten gal took : 88 ms
[2026-05-29 13:23:12] [INFO ] Flatten gal took : 86 ms
[2026-05-29 13:23:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality266254941556955165.gal : 58 ms
[2026-05-29 13:23:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12200803400976649403.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality266254941556955165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12200803400976649403.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 54 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2026-05-29 13:23:12] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17569437090643530205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17938369044943198726.kers'
[2026-05-29 13:23:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17569437090643530205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17938369044943198726.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 4 ms.
// Phase 1: matrix 1612 rows 817 cols 6446 entries
Finished phase 1 with 536 SingleSign rule and 230 generalized
[2026-05-29 13:23:12] [INFO ] Computed 56 invariants in 20 ms
Computed 56 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-17938369044943198726.kers
Total runtime 23 ms.
[2026-05-29 13:23:12] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21011ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21017ms
[2026-05-29 13:23:33] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2026-05-29 13:23:33] [INFO ] Invariant cache hit.
[2026-05-29 13:23:35] [INFO ] Implicit Places using invariants in 2104 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 2108 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 812/844 places, 1632/1652 transitions.
Applied a total of 0 rules in 18 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23205 ms. Remains : 812/844 places, 1632/1652 transitions.
[2026-05-29 13:23:35] [INFO ] Flatten gal took : 49 ms
[2026-05-29 13:23:35] [INFO ] Flatten gal took : 82 ms
[2026-05-29 13:23:36] [INFO ] Input system was already deterministic with 1632 transitions.
[2026-05-29 13:23:36] [INFO ] Flatten gal took : 48 ms
[2026-05-29 13:23:36] [INFO ] Flatten gal took : 50 ms
[2026-05-29 13:23:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13136253553573311651.gal : 25 ms
[2026-05-29 13:23:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4591003379768605804.ctl : 3 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/CTLCardinality13136253553573311651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4591003379768605804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-29 13:24:06] [INFO ] Flatten gal took : 55 ms
[2026-05-29 13:24:06] [INFO ] Applying decomposition
[2026-05-29 13:24:06] [INFO ] Flatten gal took : 56 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/graph13918141332329519367.txt' '-o' '/tmp/graph13918141332329519367.bin' '-w' '/tmp/graph13918141332329519367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13918141332329519367.bin' '-l' '-1' '-v' '-w' '/tmp/graph13918141332329519367.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:24:06] [INFO ] Decomposing Gal with order
[2026-05-29 13:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:24:07] [INFO ] Removed a total of 1534 redundant transitions.
[2026-05-29 13:24:07] [INFO ] Flatten gal took : 606 ms
[2026-05-29 13:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 90 ms.
[2026-05-29 13:24:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16131069080453560310.gal : 32 ms
[2026-05-29 13:24:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality11360314086808888488.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/CTLCardinality16131069080453560310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11360314086808888488.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 39 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2026-05-29 13:24:38] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12026553234722440725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15752186571075980716.kers'
[2026-05-29 13:24:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12026553234722440725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15752186571075980716.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1622 rows 827 cols 6466 entries
Finished phase 1 with 546 SingleSign rule and 230 generalized
[2026-05-29 13:24:38] [INFO ] Computed 56 invariants in 36 ms
Computed 56 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-15752186571075980716.kers
Total runtime 38 ms.
[2026-05-29 13:24:38] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
SMT process timed out in 21053ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 21059ms
[2026-05-29 13:24:59] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2026-05-29 13:24:59] [INFO ] Invariant cache hit.
[2026-05-29 13:25:00] [INFO ] Implicit Places using invariants in 1368 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1376 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 822/844 places, 1642/1652 transitions.
Applied a total of 0 rules in 27 ms. Remains 822 /822 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22506 ms. Remains : 822/844 places, 1642/1652 transitions.
[2026-05-29 13:25:00] [INFO ] Flatten gal took : 81 ms
[2026-05-29 13:25:00] [INFO ] Flatten gal took : 94 ms
[2026-05-29 13:25:00] [INFO ] Input system was already deterministic with 1642 transitions.
[2026-05-29 13:25:00] [INFO ] Flatten gal took : 87 ms
[2026-05-29 13:25:01] [INFO ] Flatten gal took : 101 ms
[2026-05-29 13:25:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13169126046048340659.gal : 15 ms
[2026-05-29 13:25:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2584963236677440402.ctl : 3 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/CTLCardinality13169126046048340659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2584963236677440402.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-29 13:25:31] [INFO ] Flatten gal took : 49 ms
[2026-05-29 13:25:31] [INFO ] Applying decomposition
[2026-05-29 13:25:31] [INFO ] Flatten gal took : 49 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/graph7808347838599991180.txt' '-o' '/tmp/graph7808347838599991180.bin' '-w' '/tmp/graph7808347838599991180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7808347838599991180.bin' '-l' '-1' '-v' '-w' '/tmp/graph7808347838599991180.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:25:31] [INFO ] Decomposing Gal with order
[2026-05-29 13:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:25:31] [INFO ] Removed a total of 1396 redundant transitions.
[2026-05-29 13:25:31] [INFO ] Flatten gal took : 239 ms
[2026-05-29 13:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 78 ms.
[2026-05-29 13:25:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2676242176944032540.gal : 18 ms
[2026-05-29 13:25:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4643853130958129309.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/CTLCardinality2676242176944032540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4643853130958129309.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 88 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2026-05-29 13:26:02] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16351103227491856573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4481019953840403433.kers'
[2026-05-29 13:26:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16351103227491856573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4481019953840403433.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1612 rows 817 cols 6446 entries
Finished phase 1 with 536 SingleSign rule and 230 generalized
[2026-05-29 13:26:02] [INFO ] Computed 56 invariants in 28 ms
Computed 56 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-4481019953840403433.kers
Total runtime 32 ms.
[2026-05-29 13:26:02] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21295ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21304ms
[2026-05-29 13:26:23] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2026-05-29 13:26:23] [INFO ] Invariant cache hit.
[2026-05-29 13:26:25] [INFO ] Implicit Places using invariants in 1783 ms returned []
[2026-05-29 13:26:25] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2026-05-29 13:26:25] [INFO ] Invariant cache hit.
[2026-05-29 13:26:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-29 13:26:45] [INFO ] Implicit Places using invariants and state equation in 19780 ms returned []
Implicit Place search using SMT with State Equation took 21566 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 822/844 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42966 ms. Remains : 822/844 places, 1632/1652 transitions.
[2026-05-29 13:26:45] [INFO ] Flatten gal took : 99 ms
[2026-05-29 13:26:45] [INFO ] Flatten gal took : 142 ms
[2026-05-29 13:26:45] [INFO ] Input system was already deterministic with 1632 transitions.
[2026-05-29 13:26:45] [INFO ] Flatten gal took : 72 ms
[2026-05-29 13:26:45] [INFO ] Flatten gal took : 63 ms
[2026-05-29 13:26:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality12405505492557722418.gal : 10 ms
[2026-05-29 13:26:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9960837979514473819.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/CTLCardinality12405505492557722418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9960837979514473819.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-29 13:27:15] [INFO ] Flatten gal took : 55 ms
[2026-05-29 13:27:15] [INFO ] Applying decomposition
[2026-05-29 13:27:16] [INFO ] Flatten gal took : 55 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/graph16236425304670370400.txt' '-o' '/tmp/graph16236425304670370400.bin' '-w' '/tmp/graph16236425304670370400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16236425304670370400.bin' '-l' '-1' '-v' '-w' '/tmp/graph16236425304670370400.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:27:16] [INFO ] Decomposing Gal with order
[2026-05-29 13:27:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:27:16] [INFO ] Removed a total of 2188 redundant transitions.
[2026-05-29 13:27:16] [INFO ] Flatten gal took : 237 ms
[2026-05-29 13:27:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 693 labels/synchronizations in 60 ms.
[2026-05-29 13:27:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality17426766208234252147.gal : 18 ms
[2026-05-29 13:27:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5940567615699929056.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/CTLCardinality17426766208234252147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5940567615699929056.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 60 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Skipped dead transition search.
[2026-05-29 13:27:46] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2026-05-29 13:27:46] [INFO ] Invariant cache hit.
[2026-05-29 13:27:48] [INFO ] Implicit Places using invariants in 1827 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1830 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 812/844 places, 1632/1652 transitions.
Applied a total of 0 rules in 19 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1910 ms. Remains : 812/844 places, 1632/1652 transitions.
[2026-05-29 13:27:48] [INFO ] Flatten gal took : 48 ms
[2026-05-29 13:27:48] [INFO ] Flatten gal took : 55 ms
[2026-05-29 13:27:49] [INFO ] Input system was already deterministic with 1632 transitions.
[2026-05-29 13:27:49] [INFO ] Flatten gal took : 62 ms
[2026-05-29 13:27:49] [INFO ] Flatten gal took : 65 ms
[2026-05-29 13:27:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1828297996506011085.gal : 14 ms
[2026-05-29 13:27:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10866369408346823299.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/CTLCardinality1828297996506011085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10866369408346823299.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-29 13:28:19] [INFO ] Flatten gal took : 48 ms
[2026-05-29 13:28:19] [INFO ] Applying decomposition
[2026-05-29 13:28:19] [INFO ] Flatten gal took : 46 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/graph2037195410755879925.txt' '-o' '/tmp/graph2037195410755879925.bin' '-w' '/tmp/graph2037195410755879925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2037195410755879925.bin' '-l' '-1' '-v' '-w' '/tmp/graph2037195410755879925.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:28:19] [INFO ] Decomposing Gal with order
[2026-05-29 13:28:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:28:19] [INFO ] Removed a total of 1326 redundant transitions.
[2026-05-29 13:28:19] [INFO ] Flatten gal took : 232 ms
[2026-05-29 13:28:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 35 ms.
[2026-05-29 13:28:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12139874222779050934.gal : 23 ms
[2026-05-29 13:28:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality11751925523843483943.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/CTLCardinality12139874222779050934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11751925523843483943.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 50 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Skipped dead transition search.
[2026-05-29 13:28:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2026-05-29 13:28:50] [INFO ] Invariant cache hit.
[2026-05-29 13:28:52] [INFO ] Implicit Places using invariants in 2029 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 2032 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 812/844 places, 1632/1652 transitions.
Applied a total of 0 rules in 23 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2106 ms. Remains : 812/844 places, 1632/1652 transitions.
[2026-05-29 13:28:52] [INFO ] Flatten gal took : 59 ms
[2026-05-29 13:28:52] [INFO ] Flatten gal took : 66 ms
[2026-05-29 13:28:52] [INFO ] Input system was already deterministic with 1632 transitions.
[2026-05-29 13:28:52] [INFO ] Flatten gal took : 65 ms
[2026-05-29 13:28:52] [INFO ] Flatten gal took : 66 ms
[2026-05-29 13:28:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality2558450546257155813.gal : 19 ms
[2026-05-29 13:28:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3843887656799996938.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/CTLCardinality2558450546257155813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3843887656799996938.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.
Detected timeout of ITS tools.
[2026-05-29 13:29:22] [INFO ] Flatten gal took : 45 ms
[2026-05-29 13:29:22] [INFO ] Applying decomposition
[2026-05-29 13:29:22] [INFO ] Flatten gal took : 46 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/graph9900139980397721039.txt' '-o' '/tmp/graph9900139980397721039.bin' '-w' '/tmp/graph9900139980397721039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9900139980397721039.bin' '-l' '-1' '-v' '-w' '/tmp/graph9900139980397721039.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:29:22] [INFO ] Decomposing Gal with order
[2026-05-29 13:29:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:29:22] [INFO ] Removed a total of 1498 redundant transitions.
[2026-05-29 13:29:22] [INFO ] Flatten gal took : 127 ms
[2026-05-29 13:29:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 21 ms.
[2026-05-29 13:29:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9924837108351155528.gal : 14 ms
[2026-05-29 13:29:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality16601546500496274662.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/CTLCardinality9924837108351155528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16601546500496274662.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 28 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2026-05-29 13:29:53] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2988334999619079114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17962625396629655938.kers'
[2026-05-29 13:29:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2988334999619079114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17962625396629655938.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1622 rows 827 cols 6466 entries
Finished phase 1 with 546 SingleSign rule and 230 generalized
[2026-05-29 13:29:53] [INFO ] Computed 56 invariants in 15 ms
Computed 56 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-17962625396629655938.kers
Total runtime 17 ms.
[2026-05-29 13:29:53] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
SMT process timed out in 21027ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 21032ms
[2026-05-29 13:30:14] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2026-05-29 13:30:14] [INFO ] Invariant cache hit.
[2026-05-29 13:30:15] [INFO ] Implicit Places using invariants in 1572 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1574 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 822/844 places, 1642/1652 transitions.
Applied a total of 0 rules in 12 ms. Remains 822 /822 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22651 ms. Remains : 822/844 places, 1642/1652 transitions.
[2026-05-29 13:30:15] [INFO ] Flatten gal took : 42 ms
[2026-05-29 13:30:15] [INFO ] Flatten gal took : 44 ms
[2026-05-29 13:30:15] [INFO ] Input system was already deterministic with 1642 transitions.
[2026-05-29 13:30:15] [INFO ] Flatten gal took : 42 ms
[2026-05-29 13:30:16] [INFO ] Flatten gal took : 41 ms
[2026-05-29 13:30:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7495504814433036420.gal : 8 ms
[2026-05-29 13:30:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8290907150757737725.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/CTLCardinality7495504814433036420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8290907150757737725.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.
Detected timeout of ITS tools.
[2026-05-29 13:30:46] [INFO ] Flatten gal took : 42 ms
[2026-05-29 13:30:46] [INFO ] Applying decomposition
[2026-05-29 13:30:46] [INFO ] Flatten gal took : 42 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/graph5078214847054073604.txt' '-o' '/tmp/graph5078214847054073604.bin' '-w' '/tmp/graph5078214847054073604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5078214847054073604.bin' '-l' '-1' '-v' '-w' '/tmp/graph5078214847054073604.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:30:46] [INFO ] Decomposing Gal with order
[2026-05-29 13:30:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:30:46] [INFO ] Removed a total of 1488 redundant transitions.
[2026-05-29 13:30:46] [INFO ] Flatten gal took : 157 ms
[2026-05-29 13:30:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 20 ms.
[2026-05-29 13:30:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality725484392912043213.gal : 15 ms
[2026-05-29 13:30:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4295210730281541858.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/CTLCardinality725484392912043213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4295210730281541858.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 652 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 520 place count 582 transition count 1392
Applied a total of 520 rules in 73 ms. Remains 582 /844 variables (removed 262) and now considering 1392/1652 (removed 260) transitions.
Running 1390 sub problems to find dead transitions.
[2026-05-29 13:31:16] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5073636675762767350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2433170171461062296.kers'
[2026-05-29 13:31:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5073636675762767350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2433170171461062296.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1372 rows 577 cols 6246 entries
Finished phase 1 with 296 SingleSign rule and 230 generalized
[2026-05-29 13:31:16] [INFO ] Computed 56 invariants in 12 ms
Computed 56 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-2433170171461062296.kers
Total runtime 28 ms.
[2026-05-29 13:31:16] [INFO ] State equation strengthened by 120 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
SMT process timed out in 21254ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21259ms
[2026-05-29 13:31:38] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2026-05-29 13:31:38] [INFO ] Invariant cache hit.
[2026-05-29 13:31:40] [INFO ] Implicit Places using invariants in 2454 ms returned [516, 517, 518, 519, 520, 521, 522, 523, 524, 525]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 2459 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 572/844 places, 1392/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 562 transition count 1382
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 562 transition count 1382
Applied a total of 20 rules in 61 ms. Remains 562 /572 variables (removed 10) and now considering 1382/1392 (removed 10) transitions.
[2026-05-29 13:31:40] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14437396791505283603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18034130315312932672.kers'
[2026-05-29 13:31:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14437396791505283603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18034130315312932672.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 2 ms.
// Phase 1: matrix 1362 rows 557 cols 6196 entries
Finished phase 1 with 276 SingleSign rule and 240 generalized
[2026-05-29 13:31:40] [INFO ] Computed 46 invariants in 19 ms
Computed 46 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-18034130315312932672.kers
Total runtime 22 ms.
[2026-05-29 13:31:42] [INFO ] Implicit Places using invariants in 1770 ms returned []
[2026-05-29 13:31:42] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
[2026-05-29 13:31:42] [INFO ] Invariant cache hit.
[2026-05-29 13:31:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-29 13:31:58] [INFO ] Implicit Places using invariants and state equation in 15988 ms returned []
Implicit Place search using SMT with State Equation took 17765 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 562/844 places, 1382/1652 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41621 ms. Remains : 562/844 places, 1382/1652 transitions.
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 36 ms
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 41 ms
[2026-05-29 13:31:58] [INFO ] Input system was already deterministic with 1382 transitions.
RANDOM walk for 207 steps (0 resets) in 5 ms. (34 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 41 ms
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 40 ms
[2026-05-29 13:31:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17589410791864659939.gal : 8 ms
[2026-05-29 13:31:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16222679403493713689.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17589410791864659939.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16222679403493713689.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 43 ms
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 42 ms
[2026-05-29 13:31:58] [INFO ] Applying decomposition
[2026-05-29 13:31:58] [INFO ] Flatten gal took : 44 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/graph3142708475055035146.txt' '-o' '/tmp/graph3142708475055035146.bin' '-w' '/tmp/graph3142708475055035146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3142708475055035146.bin' '-l' '-1' '-v' '-w' '/tmp/graph3142708475055035146.weights' '-q' '0' '-e' '0.001'
[2026-05-29 13:31:58] [INFO ] Decomposing Gal with order
[2026-05-29 13:31:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:31:59] [INFO ] Removed a total of 2068 redundant transitions.
[2026-05-29 13:31:59] [INFO ] Flatten gal took : 227 ms
[2026-05-29 13:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 710 labels/synchronizations in 68 ms.
[2026-05-29 13:31:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality17874501643370055458.gal : 20 ms
[2026-05-29 13:31:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4972002879546840243.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/CTLCardinality17874501643370055458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4972002879546840243.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 6 CTL formulae.
Detected timeout of ITS tools.
[2026-05-29 13:56:16] [INFO ] Applying decomposition
[2026-05-29 13:56:17] [INFO ] Flatten gal took : 789 ms
[2026-05-29 13:56:17] [INFO ] Decomposing Gal with order
[2026-05-29 13:56:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-29 13:56:18] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, Try_Check_Sources_E_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, Try_Check_Sources_E_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, Idle_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, Try_Check_Sources_E_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, Idle_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, Try_Check_Sources_E_9, P_1617_9, ScheduleTaskE_Idle_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[NotifyEventJobQueuedB_56, QueueJobB_56, FetchJobE_56, ScheduleTaskE_Work_56],[NotifyEventJobQueuedB_57, QueueJobB_57, FetchJobE_57, ScheduleTaskE_Work_57],[NotifyEventJobQueuedB_58, QueueJobB_58, FetchJobE_58, ScheduleTaskE_Work_58],[NotifyEventJobQueuedB_59, QueueJobB_59, FetchJobE_59, ScheduleTaskE_Work_59],[NotifyEventJobQueuedB_60, QueueJobB_60, FetchJobE_60, ScheduleTaskE_Work_60],[NotifyEventJobQueuedB_61, QueueJobB_61, FetchJobE_61, ScheduleTaskE_Work_61],[NotifyEventJobQueuedB_62, QueueJobB_62, FetchJobE_62, ScheduleTaskE_Work_62],[NotifyEventJobQueuedB_63, QueueJobB_63, FetchJobE_63, ScheduleTaskE_Work_63],[NotifyEventJobQueuedB_64, QueueJobB_64, FetchJobE_64, ScheduleTaskE_Work_64],[NotifyEventJobQueuedB_65, QueueJobB_65, FetchJobE_65, ScheduleTaskE_Work_65],[NotifyEventJobQueuedB_66, QueueJobB_66, FetchJobE_66, ScheduleTaskE_Work_66],[NotifyEventJobQueuedB_67, QueueJobB_67, FetchJobE_67, ScheduleTaskE_Work_67],[NotifyEventJobQueuedB_68, QueueJobB_68, FetchJobE_68, ScheduleTaskE_Work_68],[NotifyEventJobQueuedB_69, QueueJobB_69, FetchJobE_69, ScheduleTaskE_Work_69],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:834)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-29 13:56:19] [INFO ] Flatten gal took : 702 ms
[2026-05-29 13:56:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17830429627129619805.gal : 104 ms
[2026-05-29 13:56:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5862802570568860054.ctl : 27 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/CTLCardinality17830429627129619805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5862802570568860054.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 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="PolyORBLF-COL-S02J06T10"
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 PolyORBLF-COL-S02J06T10, 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 r210-smll-177969942100305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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 ;