Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841900345.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 BugTracking-PT-q3m016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K Mar 5 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Mar 5 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 5 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m016-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-12
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-13
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-14
FORMULA_NAME BugTracking-PT-q3m016-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779585222083

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 01:13:43] [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-24 01:13:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 01:13:44] [INFO ] Load time of PNML (sax parser for PT used): 775 ms
[2026-05-24 01:13:44] [INFO ] Transformed 754 places.
[2026-05-24 01:13:44] [INFO ] Transformed 27370 transitions.
[2026-05-24 01:13:44] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 938 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 514 places in 106 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 238 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 2750
Applied a total of 3 rules in 71 ms. Remains 238 /240 variables (removed 2) and now considering 2750/2769 (removed 19) transitions.
[2026-05-24 01:13:44] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11161815416015734563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3683139056527153800.kers'
[2026-05-24 01:13:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11161815416015734563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3683139056527153800.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2626 rows 238 cols 12414 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 01:13:44] [INFO ] Computed 9 invariants in 10 ms
Computed 9 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-3683139056527153800.kers
Total runtime 13 ms.
[2026-05-24 01:13:45] [INFO ] Implicit Places using invariants in 546 ms returned []
[2026-05-24 01:13:45] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 01:13:45] [INFO ] Invariant cache hit.
[2026-05-24 01:13:45] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-24 01:13:49] [INFO ] Implicit Places using invariants and state equation in 4831 ms returned []
Implicit Place search using SMT with State Equation took 5406 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2026-05-24 01:13:50] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 01:13:50] [INFO ] Invariant cache hit.
[2026-05-24 01:13:50] [INFO ] State equation strengthened by 240 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2864 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/238 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/1219 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2734 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 4/12 constraints. Problems are: Problem set: 42 solved, 2706 unsolved
Problem TDEAD2319 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2342 is UNSAT
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 9/21 constraints. Problems are: Problem set: 130 solved, 2618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2864 variables, and 21 constraints, problems are : Problem set: 130 solved, 2618 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/238 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 1529/1219 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64314ms problems are : Problem set: 130 solved, 2618 unsolved
Search for dead transitions found 130 dead transitions in 64346ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 2620/2769 transitions.
Reduce places removed 31 places and 829 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 207 transition count 1791
Reduce places removed 22 places and 281 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 53 place count 185 transition count 1510
Reduce places removed 11 places and 167 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 64 place count 174 transition count 1343
Reduce places removed 6 places and 114 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 70 place count 168 transition count 1229
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 167 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 73 place count 165 transition count 1174
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 16 places and 264 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 91 place count 149 transition count 910
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 91 rules in 26 ms. Remains 149 /238 variables (removed 89) and now considering 910/2620 (removed 1710) transitions.
[2026-05-24 01:14:54] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5489466852167762662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16615595632769074986.kers'
[2026-05-24 01:14:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5489466852167762662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16615595632769074986.kers]
Culling trivial invariants: removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 868 rows 141 cols 3979 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-24 01:14:54] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16615595632769074986.kers
Total runtime 5 ms.
[2026-05-24 01:14:54] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-24 01:14:55] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:14:55] [INFO ] Invariant cache hit.
[2026-05-24 01:14:55] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 01:14:55] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/240 places, 910/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71295 ms. Remains : 149/240 places, 910/2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 910/910 transitions.
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 0 rules in 8 ms. Remains 149 /149 variables (removed 0) and now considering 910/910 (removed 0) transitions.
[2026-05-24 01:14:55] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:14:55] [INFO ] Invariant cache hit.
[2026-05-24 01:14:55] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-24 01:14:55] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:14:55] [INFO ] Invariant cache hit.
[2026-05-24 01:14:55] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 01:14:56] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2026-05-24 01:14:56] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 01:14:56] [INFO ] Invariant cache hit.
[2026-05-24 01:14:56] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 904 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 904 unsolved
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/12 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/12 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 6 (OVERLAPS) 868/1009 variables, 141/153 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 115/268 constraints. Problems are: Problem set: 151 solved, 757 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1017 variables, and 268 constraints, problems are : Problem set: 151 solved, 757 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/17 constraints, State Equation: 141/149 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 8/8 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 3/11 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/12 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 2/141 variables, 1/13 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 6 (OVERLAPS) 868/1009 variables, 141/154 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 115/269 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1009 variables, 757/1026 constraints. Problems are: Problem set: 151 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1017 variables, and 1026 constraints, problems are : Problem set: 151 solved, 757 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/17 constraints, State Equation: 141/149 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 757/908 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60728ms problems are : Problem set: 151 solved, 757 unsolved
Search for dead transitions found 151 dead transitions in 60734ms
Found 151 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 151 transitions
Dead transitions reduction (with SMT) removed 151 transitions
Starting structural reductions in LTL mode, iteration 1 : 149/149 places, 759/910 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 140 transition count 729
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 140 transition count 729
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 132 transition count 681
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 132 transition count 681
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 34 rules in 12 ms. Remains 132 /149 variables (removed 17) and now considering 681/759 (removed 78) transitions.
[2026-05-24 01:15:57] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11952108516181828122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14972164404923194871.kers'
[2026-05-24 01:15:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11952108516181828122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14972164404923194871.kers]
Culling trivial invariants: removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 625 rows 124 cols 2851 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 01:15:57] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14972164404923194871.kers
Total runtime 9 ms.
[2026-05-24 01:15:57] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 01:15:57] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:15:57] [INFO ] Invariant cache hit.
[2026-05-24 01:15:57] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 01:15:57] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 132/149 places, 681/910 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62153 ms. Remains : 132/149 places, 681/910 transitions.
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Support contains 13 out of 124 places after structural reductions.
[2026-05-24 01:15:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-24 01:15:58] [INFO ] Flatten gal took : 86 ms
[2026-05-24 01:15:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:15:58] [INFO ] Flatten gal took : 50 ms
[2026-05-24 01:15:58] [INFO ] Input system was already deterministic with 681 transitions.
Support contains 10 out of 124 places (down from 13) after GAL structural reductions.
RANDOM walk for 40012 steps (112 resets) in 1539 ms. (25 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40001 steps (25 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (71 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (25 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (26 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (19 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
[2026-05-24 01:15:58] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5479783306279589587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6583747448889317300.kers'
[2026-05-24 01:15:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5479783306279589587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6583747448889317300.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 124 cols 2851 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 01:15:58] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6583747448889317300.kers
Total runtime 2 ms.
[2026-05-24 01:15:58] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/46 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 551/597 variables, 46/50 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 28/78 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 137/734 variables, 66/144 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 2/146 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 54/200 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 0/200 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/735 variables, 1/201 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/735 variables, 1/202 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/735 variables, 0/202 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 13/748 variables, 10/212 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/748 variables, 1/213 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/748 variables, 1/214 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/748 variables, 3/217 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/748 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/749 variables, 1/218 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/749 variables, 1/219 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/749 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/749 variables, 0/219 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 219 constraints, problems are : Problem set: 4 solved, 3 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 265/284 variables, 19/20 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 3/23 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 315/599 variables, 32/55 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 1/56 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 59/115 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 2/117 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/603 variables, 2/120 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 2/122 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/603 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 104/707 variables, 44/166 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/707 variables, 1/167 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/707 variables, 15/182 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/707 variables, 1/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/707 variables, 2/185 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/707 variables, 0/185 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 4/711 variables, 2/187 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/711 variables, 2/189 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/711 variables, 0/189 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 3/714 variables, 1/190 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/714 variables, 3/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/714 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 32/746 variables, 19/212 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/746 variables, 1/213 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/746 variables, 8/221 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/746 variables, 4/225 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/746 variables, 0/225 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 3/749 variables, 1/226 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/749 variables, 3/229 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/749 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 0/749 variables, 0/229 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 749/749 variables, and 229 constraints, problems are : Problem set: 4 solved, 3 unsolved in 1845 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2236ms problems are : Problem set: 4 solved, 3 unsolved
Parikh walk visited 0 properties in 986 ms.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 681/681 transitions.
Graph (complete) has 966 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 682
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 122 transition count 676
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 15 place count 116 transition count 676
Applied a total of 15 rules in 62 ms. Remains 116 /124 variables (removed 8) and now considering 676/681 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 116/124 places, 676/681 transitions.
RANDOM walk for 40015 steps (8 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 427491 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 3
Probabilistic random walk after 427491 steps, saw 244038 distinct states, run finished after 3004 ms. (steps per millisecond=142 ) properties seen :0
[2026-05-24 01:16:05] [INFO ] Flow matrix only has 618 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13306743898761333720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12630642251992358564.kers'
[2026-05-24 01:16:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13306743898761333720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12630642251992358564.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 618 rows 116 cols 2836 entries
Finished phase 1 with 104 SingleSign rule and 3 generalized
[2026-05-24 01:16:05] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12630642251992358564.kers
Total runtime 2 ms.
[2026-05-24 01:16:05] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 265/284 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 310/594 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 60/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/595 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 103/698 variables, 42/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/698 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/698 variables, 14/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/698 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/702 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/702 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 3/705 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/705 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/705 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 28/733 variables, 18/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/733 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/733 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/733 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/734 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/734 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/734 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/734 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 265/284 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 310/594 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 60/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/595 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/595 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 103/698 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/698 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/698 variables, 14/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/698 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/698 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/702 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/702 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/702 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 3/705 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/705 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/705 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 28/733 variables, 18/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/733 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/733 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/733 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/733 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/733 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 1/734 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/734 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/734 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 0/734 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 217 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1958ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 427 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 676/676 transitions.
Applied a total of 0 rules in 14 ms. Remains 116 /116 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 116/116 places, 676/676 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 676/676 transitions.
Applied a total of 0 rules in 13 ms. Remains 116 /116 variables (removed 0) and now considering 676/676 (removed 0) transitions.
[2026-05-24 01:16:07] [INFO ] Flow matrix only has 618 transitions (discarded 58 similar events)
[2026-05-24 01:16:07] [INFO ] Invariant cache hit.
[2026-05-24 01:16:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 01:16:08] [INFO ] Flow matrix only has 618 transitions (discarded 58 similar events)
[2026-05-24 01:16:08] [INFO ] Invariant cache hit.
[2026-05-24 01:16:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 01:16:08] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2026-05-24 01:16:08] [INFO ] Redundant transitions in 56 ms returned []
Running 675 sub problems to find dead transitions.
[2026-05-24 01:16:08] [INFO ] Flow matrix only has 618 transitions (discarded 58 similar events)
[2026-05-24 01:16:08] [INFO ] Invariant cache hit.
[2026-05-24 01:16:08] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 618/734 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/734 variables, 85/210 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 675 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/734 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 675 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 210 constraints, problems are : Problem set: 0 solved, 675 unsolved in 29499 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 618/734 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/734 variables, 85/210 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 675/885 constraints. Problems are: Problem set: 66 solved, 609 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 2/887 constraints. Problems are: Problem set: 111 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 734/734 variables, and 889 constraints, problems are : Problem set: 111 solved, 564 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59974ms problems are : Problem set: 111 solved, 564 unsolved
Search for dead transitions found 111 dead transitions in 59977ms
Found 111 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 111 transitions
Dead transitions reduction (with SMT) removed 111 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 116/116 places, 565/676 transitions.
Graph (complete) has 826 edges and 116 vertex of which 113 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 156 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 104 transition count 409
Reduce places removed 8 places and 72 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 96 transition count 337
Reduce places removed 3 places and 29 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 93 transition count 308
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 91 transition count 292
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 90 transition count 283
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 29 place count 85 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 34 place count 85 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 34 rules in 14 ms. Remains 85 /116 variables (removed 31) and now considering 242/565 (removed 323) transitions.
[2026-05-24 01:17:08] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7785001412914015827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14198041588414848925.kers'
[2026-05-24 01:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7785001412914015827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14198041588414848925.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 225 rows 83 cols 981 entries
Finished phase 1 with 72 SingleSign rule and 3 generalized
[2026-05-24 01:17:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14198041588414848925.kers
Total runtime 1 ms.
[2026-05-24 01:17:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 01:17:08] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2026-05-24 01:17:08] [INFO ] Invariant cache hit.
[2026-05-24 01:17:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:17:08] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/116 places, 242/676 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60812 ms. Remains : 85/116 places, 242/676 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40016 steps (9 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30850 steps (6 resets) in 54 ms. (560 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:17:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 01:17:08] [INFO ] Flatten gal took : 35 ms
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 01:17:08] [INFO ] Flatten gal took : 31 ms
[2026-05-24 01:17:08] [INFO ] Input system was already deterministic with 681 transitions.
Computed a total of 4 stabilizing places and 26 stable transitions
Graph (complete) has 1113 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 681/681 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 681
Applied a total of 1 rules in 3 ms. Remains 123 /124 variables (removed 1) and now considering 681/681 (removed 0) transitions.
[2026-05-24 01:17:08] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7831971022560619288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13506381499807769076.kers'
[2026-05-24 01:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7831971022560619288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13506381499807769076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 01:17:08] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13506381499807769076.kers
Total runtime 4 ms.
[2026-05-24 01:17:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-24 01:17:08] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:17:08] [INFO ] Invariant cache hit.
[2026-05-24 01:17:09] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 01:17:09] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 01:17:09] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:17:09] [INFO ] Invariant cache hit.
[2026-05-24 01:17:09] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 74 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 74 solved, 605 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60509ms problems are : Problem set: 74 solved, 605 unsolved
Search for dead transitions found 74 dead transitions in 60512ms
Found 74 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 74 transitions
Dead transitions reduction (with SMT) removed 74 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/124 places, 607/681 transitions.
Reduce places removed 11 places and 154 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 112 transition count 453
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 106 transition count 398
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 104 transition count 380
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 102 transition count 364
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 101 transition count 351
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 24 place count 99 transition count 333
Iterating global reduction 5 with 2 rules applied. Total rules applied 26 place count 99 transition count 333
Applied a total of 26 rules in 7 ms. Remains 99 /123 variables (removed 24) and now considering 333/607 (removed 274) transitions.
[2026-05-24 01:18:09] [INFO ] Flow matrix only has 318 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4339524234346225003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1232172783214385459.kers'
[2026-05-24 01:18:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4339524234346225003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1232172783214385459.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 99 cols 1397 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 01:18:09] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1232172783214385459.kers
Total runtime 2 ms.
[2026-05-24 01:18:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 01:18:09] [INFO ] Flow matrix only has 318 transitions (discarded 15 similar events)
[2026-05-24 01:18:09] [INFO ] Invariant cache hit.
[2026-05-24 01:18:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 01:18:10] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/124 places, 333/681 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61340 ms. Remains : 99/124 places, 333/681 transitions.
[2026-05-24 01:18:10] [INFO ] Flatten gal took : 15 ms
[2026-05-24 01:18:10] [INFO ] Flatten gal took : 15 ms
[2026-05-24 01:18:10] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-24 01:18:10] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:18:10] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:18:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10032323405689330066.gal : 12 ms
[2026-05-24 01:18:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9221209318064474310.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/CTLCardinality10032323405689330066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9221209318064474310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 01:18:40] [INFO ] Flatten gal took : 12 ms
[2026-05-24 01:18:40] [INFO ] Applying decomposition
[2026-05-24 01:18:40] [INFO ] Flatten gal took : 9 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/graph973393655371326475.txt' '-o' '/tmp/graph973393655371326475.bin' '-w' '/tmp/graph973393655371326475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph973393655371326475.bin' '-l' '-1' '-v' '-w' '/tmp/graph973393655371326475.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:18:40] [INFO ] Decomposing Gal with order
[2026-05-24 01:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:18:40] [INFO ] Removed a total of 37 redundant transitions.
[2026-05-24 01:18:40] [INFO ] Flatten gal took : 60 ms
[2026-05-24 01:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 5 ms.
[2026-05-24 01:18:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4016823128047770104.gal : 5 ms
[2026-05-24 01:18:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13065682350332057280.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/CTLCardinality4016823128047770104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13065682350332057280.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 SI_CTL mode, iteration 0 : 124/124 places, 681/681 transitions.
Graph (complete) has 1113 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 123 /124 variables (removed 1) and now considering 681/681 (removed 0) transitions.
[2026-05-24 01:19:10] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17327132577722926488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3930255340031716818.kers'
[2026-05-24 01:19:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17327132577722926488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3930255340031716818.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 01:19:10] [INFO ] Computed 9 invariants in 5 ms
Computed 9 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3930255340031716818.kers
Total runtime 6 ms.
[2026-05-24 01:19:10] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-24 01:19:10] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:19:10] [INFO ] Invariant cache hit.
[2026-05-24 01:19:10] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 01:19:11] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2026-05-24 01:19:11] [INFO ] Redundant transitions in 9 ms returned []
Running 679 sub problems to find dead transitions.
[2026-05-24 01:19:11] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:19:11] [INFO ] Invariant cache hit.
[2026-05-24 01:19:11] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 74 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 74 solved, 605 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60479ms problems are : Problem set: 74 solved, 605 unsolved
Search for dead transitions found 74 dead transitions in 60480ms
Found 74 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 74 transitions
Dead transitions reduction (with SMT) removed 74 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 123/124 places, 607/681 transitions.
Graph (complete) has 967 edges and 123 vertex of which 122 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 154 transitions.
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 106 transition count 398
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 104 transition count 380
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 102 transition count 364
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 101 transition count 351
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 14 place count 99 transition count 333
Iterating global reduction 4 with 2 rules applied. Total rules applied 16 place count 99 transition count 333
Applied a total of 16 rules in 14 ms. Remains 99 /123 variables (removed 24) and now considering 333/607 (removed 274) transitions.
[2026-05-24 01:20:11] [INFO ] Flow matrix only has 318 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6421745117358215688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8620378660589355211.kers'
[2026-05-24 01:20:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6421745117358215688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8620378660589355211.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 99 cols 1397 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 01:20:11] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8620378660589355211.kers
Total runtime 2 ms.
[2026-05-24 01:20:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 01:20:11] [INFO ] Flow matrix only has 318 transitions (discarded 15 similar events)
[2026-05-24 01:20:11] [INFO ] Invariant cache hit.
[2026-05-24 01:20:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 01:20:12] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/124 places, 333/681 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61375 ms. Remains : 99/124 places, 333/681 transitions.
[2026-05-24 01:20:12] [INFO ] Flatten gal took : 11 ms
[2026-05-24 01:20:12] [INFO ] Flatten gal took : 11 ms
[2026-05-24 01:20:12] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-24 01:20:12] [INFO ] Flatten gal took : 25 ms
[2026-05-24 01:20:12] [INFO ] Flatten gal took : 21 ms
[2026-05-24 01:20:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8857624972453376675.gal : 3 ms
[2026-05-24 01:20:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15328680532415720507.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/ReachabilityCardinality8857624972453376675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15328680532415720507.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (134 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
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 ...329
BEST_FIRST walk for 40004 steps (24 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15328680532415720507.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 153
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :153 after 1802
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1802 after 1917
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1917 after 60894
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :60894 after 309927
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :309927 after 807024
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :807024 after 1.80025e+06
Interrupted probabilistic random walk after 1232795 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1232795 steps, saw 676612 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
[2026-05-24 01:20:15] [INFO ] Flow matrix only has 318 transitions (discarded 15 similar events)
[2026-05-24 01:20:15] [INFO ] Invariant cache hit.
[2026-05-24 01:20:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/85 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/256 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 64/320 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 45/365 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/369 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/369 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/369 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/372 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/372 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 42/414 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/414 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/414 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/414 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 3/417 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/417 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/417 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/417 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/85 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/256 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/320 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 45/365 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/365 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/369 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/369 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/369 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/372 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/372 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/372 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 42/414 variables, 18/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/414 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/414 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/414 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/414 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 3/417 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/417 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/417 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/417 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/417 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 333/333 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 333
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 98 transition count 327
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 92 transition count 327
Applied a total of 14 rules in 11 ms. Remains 92 /99 variables (removed 7) and now considering 327/333 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 92/99 places, 327/333 transitions.
RANDOM walk for 3000565 steps (6 resets) in 3079 ms. (974 steps per ms) remains 0/1 properties
FORMULA BugTracking-PT-q3m016-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 681/681 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 681
Applied a total of 1 rules in 6 ms. Remains 123 /124 variables (removed 1) and now considering 681/681 (removed 0) transitions.
[2026-05-24 01:20:17] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14617935134440602414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11028755954418545277.kers'
[2026-05-24 01:20:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14617935134440602414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11028755954418545277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 625 rows 123 cols 2850 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 01:20:17] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11028755954418545277.kers
Total runtime 4 ms.
[2026-05-24 01:20:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 01:20:17] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:20:17] [INFO ] Invariant cache hit.
[2026-05-24 01:20:17] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 01:20:17] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-24 01:20:17] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:20:17] [INFO ] Invariant cache hit.
[2026-05-24 01:20:17] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (OVERLAPS) 1/748 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/748 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/748 variables, and 218 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 625/747 variables, 122/132 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 85/217 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 582/799 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD618 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 7/806 constraints. Problems are: Problem set: 65 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 806 constraints, problems are : Problem set: 65 solved, 614 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 582/679 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 65 solved, 614 unsolved
Search for dead transitions found 65 dead transitions in 60486ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/124 places, 616/681 transitions.
Reduce places removed 10 places and 154 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 113 transition count 462
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 107 transition count 407
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 105 transition count 389
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 103 transition count 373
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 102 transition count 359
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 23 place count 100 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 100 transition count 341
Applied a total of 25 rules in 4 ms. Remains 100 /123 variables (removed 23) and now considering 341/616 (removed 275) transitions.
[2026-05-24 01:21:18] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7712948277583777563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10843027315109579240.kers'
[2026-05-24 01:21:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7712948277583777563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10843027315109579240.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 100 cols 1448 entries
Finished phase 1 with 88 SingleSign rule and 3 generalized
[2026-05-24 01:21:18] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10843027315109579240.kers
Total runtime 3 ms.
[2026-05-24 01:21:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 01:21:18] [INFO ] Flow matrix only has 326 transitions (discarded 15 similar events)
[2026-05-24 01:21:18] [INFO ] Invariant cache hit.
[2026-05-24 01:21:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:21:18] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/124 places, 341/681 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61503 ms. Remains : 100/124 places, 341/681 transitions.
[2026-05-24 01:21:18] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:21:18] [INFO ] Flatten gal took : 12 ms
[2026-05-24 01:21:18] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-24 01:21:18] [INFO ] Flatten gal took : 10 ms
[2026-05-24 01:21:18] [INFO ] Flatten gal took : 10 ms
[2026-05-24 01:21:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11647440079910466399.gal : 2 ms
[2026-05-24 01:21:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15034963562532932345.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/CTLCardinality11647440079910466399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15034963562532932345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 01:21:48] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:21:48] [INFO ] Applying decomposition
[2026-05-24 01:21:48] [INFO ] Flatten gal took : 10 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/graph10424903512205097841.txt' '-o' '/tmp/graph10424903512205097841.bin' '-w' '/tmp/graph10424903512205097841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10424903512205097841.bin' '-l' '-1' '-v' '-w' '/tmp/graph10424903512205097841.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:21:48] [INFO ] Decomposing Gal with order
[2026-05-24 01:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:21:48] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 01:21:48] [INFO ] Flatten gal took : 17 ms
[2026-05-24 01:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 2 ms.
[2026-05-24 01:21:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10556300328889604613.gal : 3 ms
[2026-05-24 01:21:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1137963675831761691.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/CTLCardinality10556300328889604613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1137963675831761691.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 SI_CTL mode, iteration 0 : 124/124 places, 681/681 transitions.
Applied a total of 0 rules in 19 ms. Remains 124 /124 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2026-05-24 01:22:18] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6562520105230858602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4342167043437676779.kers'
[2026-05-24 01:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6562520105230858602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4342167043437676779.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 625 rows 124 cols 2851 entries
Finished phase 1 with 111 SingleSign rule and 3 generalized
[2026-05-24 01:22:18] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4342167043437676779.kers
Total runtime 6 ms.
[2026-05-24 01:22:18] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-24 01:22:18] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:22:19] [INFO ] Invariant cache hit.
[2026-05-24 01:22:19] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 01:22:19] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2026-05-24 01:22:19] [INFO ] Redundant transitions in 7 ms returned []
Running 679 sub problems to find dead transitions.
[2026-05-24 01:22:19] [INFO ] Flow matrix only has 625 transitions (discarded 56 similar events)
[2026-05-24 01:22:19] [INFO ] Invariant cache hit.
[2026-05-24 01:22:19] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 6 (OVERLAPS) 625/749 variables, 124/135 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 9 (OVERLAPS) 0/749 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 679 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 220 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 6 (OVERLAPS) 625/749 variables, 124/135 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 679/899 constraints. Problems are: Problem set: 39 solved, 640 unsolved
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 4/903 constraints. Problems are: Problem set: 61 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 903 constraints, problems are : Problem set: 61 solved, 618 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60481ms problems are : Problem set: 61 solved, 618 unsolved
Search for dead transitions found 61 dead transitions in 60482ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 124/124 places, 620/681 transitions.
Reduce places removed 8 places and 136 transitions.
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 429
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 108 transition count 411
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 106 transition count 395
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 105 transition count 379
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 14 place count 102 transition count 352
Iterating global reduction 4 with 3 rules applied. Total rules applied 17 place count 102 transition count 352
Applied a total of 17 rules in 14 ms. Remains 102 /124 variables (removed 22) and now considering 352/620 (removed 268) transitions.
[2026-05-24 01:23:19] [INFO ] Flow matrix only has 336 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12367970986017192917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12374990557647581147.kers'
[2026-05-24 01:23:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12367970986017192917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12374990557647581147.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 102 cols 1497 entries
Finished phase 1 with 89 SingleSign rule and 3 generalized
[2026-05-24 01:23:19] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12374990557647581147.kers
Total runtime 3 ms.
[2026-05-24 01:23:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 01:23:19] [INFO ] Flow matrix only has 336 transitions (discarded 16 similar events)
[2026-05-24 01:23:19] [INFO ] Invariant cache hit.
[2026-05-24 01:23:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 01:23:20] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/124 places, 352/681 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61380 ms. Remains : 102/124 places, 352/681 transitions.
[2026-05-24 01:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:23:20] [INFO ] Input system was already deterministic with 352 transitions.
[2026-05-24 01:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:23:20] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:23:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality943144332485442044.gal : 3 ms
[2026-05-24 01:23:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16526209178252685877.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/CTLCardinality943144332485442044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16526209178252685877.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-24 01:23:50] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:23:50] [INFO ] Applying decomposition
[2026-05-24 01:23:50] [INFO ] Flatten gal took : 8 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/graph13380798247344001387.txt' '-o' '/tmp/graph13380798247344001387.bin' '-w' '/tmp/graph13380798247344001387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13380798247344001387.bin' '-l' '-1' '-v' '-w' '/tmp/graph13380798247344001387.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:23:50] [INFO ] Decomposing Gal with order
[2026-05-24 01:23:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:23:50] [INFO ] Removed a total of 25 redundant transitions.
[2026-05-24 01:23:50] [INFO ] Flatten gal took : 16 ms
[2026-05-24 01:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 1 ms.
[2026-05-24 01:23:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality17014574924075092247.gal : 3 ms
[2026-05-24 01:23:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality10302074582335956345.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/CTLCardinality17014574924075092247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10302074582335956345.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.
[2026-05-24 01:24:20] [INFO ] Flatten gal took : 15 ms
[2026-05-24 01:24:20] [INFO ] Flatten gal took : 16 ms
[2026-05-24 01:24:20] [INFO ] Applying decomposition
[2026-05-24 01:24:20] [INFO ] Flatten gal took : 15 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/graph281315959311784108.txt' '-o' '/tmp/graph281315959311784108.bin' '-w' '/tmp/graph281315959311784108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph281315959311784108.bin' '-l' '-1' '-v' '-w' '/tmp/graph281315959311784108.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:24:20] [INFO ] Decomposing Gal with order
[2026-05-24 01:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:24:20] [INFO ] Removed a total of 186 redundant transitions.
[2026-05-24 01:24:20] [INFO ] Flatten gal took : 36 ms
[2026-05-24 01:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 4 ms.
[2026-05-24 01:24:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6508291019189912245.gal : 6 ms
[2026-05-24 01:24:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality302349402641838.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/CTLCardinality6508291019189912245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality302349402641838.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 -...258
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 01:47:58] [INFO ] Flatten gal took : 169 ms
[2026-05-24 01:47:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality16742029260541896051.gal : 27 ms
[2026-05-24 01:47:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5718017682991509979.ctl : 7 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/CTLCardinality16742029260541896051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5718017682991509979.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 3 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 02:11:31] [INFO ] Flatten gal took : 109 ms
[2026-05-24 02:11:32] [INFO ] Input system was already deterministic with 681 transitions.
[2026-05-24 02:11:32] [INFO ] Transformed 124 places.
[2026-05-24 02:11:32] [INFO ] Transformed 681 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 02:11:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11265903141644550088.gal : 7 ms
[2026-05-24 02:11:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17365660622744195841.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/CTLCardinality11265903141644550088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17365660622744195841.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 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="BugTracking-PT-q3m016"
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 BugTracking-PT-q3m016, 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 r034-tall-177946841900345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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