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-177946841900379.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-q3m256, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Mar 5 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 5 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:40 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-q3m256-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779592453282

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 03:14:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 03:14:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:14:15] [INFO ] Load time of PNML (sax parser for PT used): 791 ms
[2026-05-24 03:14:15] [INFO ] Transformed 754 places.
[2026-05-24 03:14:15] [INFO ] Transformed 27370 transitions.
[2026-05-24 03:14:15] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 968 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 514 places in 123 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m256-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 83 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2026-05-24 03:14:15] [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-2494657735216017407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4019109988299472847.kers'
[2026-05-24 03:14:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2494657735216017407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4019109988299472847.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2626 rows 237 cols 12413 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 03:14:15] [INFO ] Computed 8 invariants in 8 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4019109988299472847.kers
Total runtime 11 ms.
[2026-05-24 03:14:16] [INFO ] Implicit Places using invariants in 589 ms returned []
[2026-05-24 03:14:16] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 03:14:16] [INFO ] Invariant cache hit.
[2026-05-24 03:14:16] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-24 03:14:18] [INFO ] Implicit Places using invariants and state equation in 2395 ms returned []
Implicit Place search using SMT with State Equation took 3016 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2026-05-24 03:14:18] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 03:14:18] [INFO ] Invariant cache hit.
[2026-05-24 03:14:19] [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
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 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, 10/22 constraints. Problems are: Problem set: 130 solved, 2618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 22 constraints, problems are : Problem set: 130 solved, 2618 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 1529/1219 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64320ms problems are : Problem set: 130 solved, 2618 unsolved
Search for dead transitions found 130 dead transitions in 64356ms
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 : 237/240 places, 2620/2769 transitions.
Reduce places removed 36 places and 829 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 201 transition count 1791
Reduce places removed 23 places and 281 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 59 place count 178 transition count 1510
Reduce places removed 12 places and 167 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 71 place count 166 transition count 1343
Reduce places removed 6 places and 114 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 77 place count 160 transition count 1229
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 159 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 158 transition count 1193
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 15 places and 266 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 95 place count 143 transition count 927
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 95 rules in 28 ms. Remains 143 /237 variables (removed 94) and now considering 927/2620 (removed 1693) transitions.
[2026-05-24 03:15:23] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12432403347856904598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-762129963044339743.kers'
[2026-05-24 03:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12432403347856904598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-762129963044339743.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 883 rows 141 cols 4053 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-24 03:15:23] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-762129963044339743.kers
Total runtime 3 ms.
[2026-05-24 03:15:23] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-05-24 03:15:23] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 03:15:23] [INFO ] Invariant cache hit.
[2026-05-24 03:15:24] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 03:15:24] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/240 places, 927/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68712 ms. Remains : 143/240 places, 927/2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 927/927 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 927/927 (removed 0) transitions.
[2026-05-24 03:15:24] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 03:15:24] [INFO ] Invariant cache hit.
[2026-05-24 03:15:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-24 03:15:24] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 03:15:24] [INFO ] Invariant cache hit.
[2026-05-24 03:15:24] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 03:15:25] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 925 sub problems to find dead transitions.
[2026-05-24 03:15:25] [INFO ] Flow matrix only has 883 transitions (discarded 44 similar events)
[2026-05-24 03:15:25] [INFO ] Invariant cache hit.
[2026-05-24 03:15:25] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 925 unsolved
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 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 TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 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 TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 2/10 constraints. Problems are: Problem set: 147 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 147 solved, 778 unsolved
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
At refinement iteration 3 (OVERLAPS) 883/1023 variables, 140/150 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 115/265 constraints. Problems are: Problem set: 151 solved, 774 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1023/1026 variables, and 265 constraints, problems are : Problem set: 151 solved, 774 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 140/143 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 925/925 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 2/10 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 3 (OVERLAPS) 883/1023 variables, 140/150 constraints. Problems are: Problem set: 151 solved, 774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 115/265 constraints. Problems are: Problem set: 151 solved, 774 unsolved
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD599 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 TDEAD606 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1023 variables, 676/941 constraints. Problems are: Problem set: 190 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1023/1026 variables, and 943 constraints, problems are : Problem set: 190 solved, 735 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 140/143 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 676/925 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60815ms problems are : Problem set: 190 solved, 735 unsolved
Search for dead transitions found 190 dead transitions in 60818ms
Found 190 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 190 transitions
Dead transitions reduction (with SMT) removed 190 transitions
Starting structural reductions in LTL mode, iteration 1 : 143/143 places, 737/927 transitions.
Reduce places removed 15 places and 200 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 128 transition count 537
Reduce places removed 14 places and 71 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 114 transition count 466
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 112 transition count 448
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 110 transition count 432
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 109 transition count 416
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 37 place count 106 transition count 392
Deduced a syphon composed of 3 places in 4 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 40 place count 106 transition count 392
Deduced a syphon composed of 3 places in 3 ms
Applied a total of 40 rules in 15 ms. Remains 106 /143 variables (removed 37) and now considering 392/737 (removed 345) transitions.
[2026-05-24 03:16:26] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4933748310195229722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11869016500990307713.kers'
[2026-05-24 03:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4933748310195229722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11869016500990307713.kers]
Culling trivial invariants: removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 367 rows 103 cols 1631 entries
Finished phase 1 with 91 SingleSign rule and 3 generalized
[2026-05-24 03:16:26] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11869016500990307713.kers
Total runtime 2 ms.
[2026-05-24 03:16:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 03:16:26] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 03:16:26] [INFO ] Invariant cache hit.
[2026-05-24 03:16:26] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 03:16:26] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/143 places, 392/927 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61933 ms. Remains : 106/143 places, 392/927 transitions.
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Support contains 5 out of 103 places after structural reductions.
FORMULA BugTracking-PT-q3m256-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 03:16:26] [INFO ] Flatten gal took : 64 ms
[2026-05-24 03:16:26] [INFO ] Flatten gal took : 30 ms
[2026-05-24 03:16:26] [INFO ] Input system was already deterministic with 392 transitions.
RANDOM walk for 40000 steps (10 resets) in 1131 ms. (35 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2026-05-24 03:16:27] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6861122288666799095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18004106012942821031.kers'
[2026-05-24 03:16:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6861122288666799095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18004106012942821031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 103 cols 1631 entries
Finished phase 1 with 91 SingleSign rule and 3 generalized
[2026-05-24 03:16:27] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18004106012942821031.kers
Total runtime 2 ms.
[2026-05-24 03:16:27] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 7/470 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/8 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/103 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m256-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 30 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 392/392 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2026-05-24 03:16:27] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 03:16:27] [INFO ] Invariant cache hit.
[2026-05-24 03:16:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 03:16:27] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 03:16:27] [INFO ] Invariant cache hit.
[2026-05-24 03:16:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 03:16:27] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2026-05-24 03:16:27] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 03:16:27] [INFO ] Invariant cache hit.
[2026-05-24 03:16:27] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 367/469 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 59/172 constraints. Problems are: Problem set: 0 solved, 390 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/470 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 173 constraints, problems are : Problem set: 0 solved, 390 unsolved in 14378 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 367/469 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 59/172 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 331/503 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
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 TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 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 TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 11/514 constraints. Problems are: Problem set: 67 solved, 323 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 3/517 constraints. Problems are: Problem set: 75 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/470 variables, and 519 constraints, problems are : Problem set: 75 solved, 315 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/103 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 331/390 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44599ms problems are : Problem set: 75 solved, 315 unsolved
Search for dead transitions found 75 dead transitions in 44604ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/103 places, 317/392 transitions.
Reduce places removed 5 places and 16 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 98 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 96 transition count 283
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 96 transition count 283
Applied a total of 9 rules in 6 ms. Remains 96 /103 variables (removed 7) and now considering 283/317 (removed 34) transitions.
[2026-05-24 03:17:12] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2267631951117231570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17834790448568580768.kers'
[2026-05-24 03:17:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2267631951117231570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17834790448568580768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 96 cols 1143 entries
Finished phase 1 with 85 SingleSign rule and 3 generalized
[2026-05-24 03:17:12] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17834790448568580768.kers
Total runtime 1 ms.
[2026-05-24 03:17:12] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 03:17:12] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
[2026-05-24 03:17:12] [INFO ] Invariant cache hit.
[2026-05-24 03:17:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 03:17:12] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/103 places, 283/392 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45263 ms. Remains : 96/103 places, 283/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 9962 steps (10 resets) in 17 ms. (553 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 272 ms.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 283/283 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2026-05-24 03:17:13] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
[2026-05-24 03:17:13] [INFO ] Invariant cache hit.
[2026-05-24 03:17:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 03:17:13] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
[2026-05-24 03:17:13] [INFO ] Invariant cache hit.
[2026-05-24 03:17:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 03:17:14] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-24 03:17:14] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
[2026-05-24 03:17:14] [INFO ] Invariant cache hit.
[2026-05-24 03:17:14] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 4 (OVERLAPS) 264/359 variables, 95/104 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 50/154 constraints. Problems are: Problem set: 12 solved, 269 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/154 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/360 variables, 1/155 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/155 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/155 constraints. Problems are: Problem set: 12 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 155 constraints, problems are : Problem set: 12 solved, 269 unsolved in 8820 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 264/359 variables, 95/104 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 50/154 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 215/369 constraints. Problems are: Problem set: 12 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 3/372 constraints. Problems are: Problem set: 12 solved, 269 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 2/374 constraints. Problems are: Problem set: 15 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 5/379 constraints. Problems are: Problem set: 15 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/379 constraints. Problems are: Problem set: 15 solved, 266 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/380 constraints. Problems are: Problem set: 15 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 434 constraints, problems are : Problem set: 15 solved, 266 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 269/281 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38940ms problems are : Problem set: 15 solved, 266 unsolved
Search for dead transitions found 15 dead transitions in 38941ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 96/96 places, 268/283 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39242 ms. Remains : 96/96 places, 268/283 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 6925 steps (4 resets) in 19 ms. (346 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 312 ms.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Product exploration explored 100000 steps with 25000 reset in 171 ms.
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14516546479363176958
[2026-05-24 03:17:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14516546479363176958
Running compilation step : cd /tmp/ltsmin14516546479363176958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 532 ms.
Running link step : cd /tmp/ltsmin14516546479363176958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin14516546479363176958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14987074002599099060.hoa' '--buchi-type=spotba'
LTSmin run took 42 ms.
FORMULA BugTracking-PT-q3m256-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BugTracking-PT-q3m256-LTLCardinality-01 finished in 87585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p0)||X(p1))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 392/392 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2026-05-24 03:17:54] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12869693555578847151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1250999361537516243.kers'
[2026-05-24 03:17:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12869693555578847151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1250999361537516243.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 103 cols 1631 entries
Finished phase 1 with 91 SingleSign rule and 3 generalized
[2026-05-24 03:17:54] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1250999361537516243.kers
Total runtime 2 ms.
[2026-05-24 03:17:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 03:17:54] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 03:17:54] [INFO ] Invariant cache hit.
[2026-05-24 03:17:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 03:17:55] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2026-05-24 03:17:55] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 03:17:55] [INFO ] Invariant cache hit.
[2026-05-24 03:17:55] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 367/469 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 59/172 constraints. Problems are: Problem set: 0 solved, 390 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/470 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 173 constraints, problems are : Problem set: 0 solved, 390 unsolved in 13996 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 367/469 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 59/172 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 331/503 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
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 TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 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 TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 11/514 constraints. Problems are: Problem set: 67 solved, 323 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 3/517 constraints. Problems are: Problem set: 75 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/470 variables, and 517 constraints, problems are : Problem set: 75 solved, 315 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/103 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 331/390 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44146ms problems are : Problem set: 75 solved, 315 unsolved
Search for dead transitions found 75 dead transitions in 44150ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/103 places, 317/392 transitions.
Reduce places removed 5 places and 16 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 98 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 96 transition count 283
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 96 transition count 283
Applied a total of 9 rules in 4 ms. Remains 96 /103 variables (removed 7) and now considering 283/317 (removed 34) transitions.
[2026-05-24 03:18:39] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12066741382291835702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12820262796408699608.kers'
[2026-05-24 03:18:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12066741382291835702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12820262796408699608.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 96 cols 1143 entries
Finished phase 1 with 85 SingleSign rule and 3 generalized
[2026-05-24 03:18:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12820262796408699608.kers
Total runtime 2 ms.
[2026-05-24 03:18:39] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 03:18:39] [INFO ] Flow matrix only has 264 transitions (discarded 19 similar events)
[2026-05-24 03:18:39] [INFO ] Invariant cache hit.
[2026-05-24 03:18:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 03:18:39] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/103 places, 283/392 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44835 ms. Remains : 96/103 places, 283/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p0)||X(p1))))'
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Detected a total of 5/96 stabilizing places and 17/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 17 ms. Proved property starting from automaton with 6 states, 10 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA BugTracking-PT-q3m256-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m256-LTLCardinality-05 finished in 45443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 392/392 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 383
Applied a total of 2 rules in 6 ms. Remains 102 /103 variables (removed 1) and now considering 383/392 (removed 9) transitions.
[2026-05-24 03:18:40] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2042136766453146926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12240292606234804584.kers'
[2026-05-24 03:18:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2042136766453146926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12240292606234804584.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 360 rows 102 cols 1596 entries
Finished phase 1 with 90 SingleSign rule and 3 generalized
[2026-05-24 03:18:40] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12240292606234804584.kers
Total runtime 3 ms.
[2026-05-24 03:18:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 03:18:40] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2026-05-24 03:18:40] [INFO ] Invariant cache hit.
[2026-05-24 03:18:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 03:18:40] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2026-05-24 03:18:40] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2026-05-24 03:18:40] [INFO ] Invariant cache hit.
[2026-05-24 03:18:40] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 360/461 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 59/171 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 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
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 6/177 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/177 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 1/462 variables, 1/178 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/178 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 11 (OVERLAPS) 0/462 variables, 0/178 constraints. Problems are: Problem set: 66 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 178 constraints, problems are : Problem set: 66 solved, 315 unsolved in 26381 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 3/101 variables, 1/17 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 360/461 variables, 101/118 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 59/177 constraints. Problems are: Problem set: 66 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 257/434 constraints. Problems are: Problem set: 66 solved, 315 unsolved
Problem TDEAD325 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 2/436 constraints. Problems are: Problem set: 67 solved, 314 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 1/437 constraints. Problems are: Problem set: 67 solved, 314 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 2/439 constraints. Problems are: Problem set: 92 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/462 variables, and 439 constraints, problems are : Problem set: 92 solved, 289 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/102 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 257/381 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 56567ms problems are : Problem set: 92 solved, 289 unsolved
Search for dead transitions found 92 dead transitions in 56568ms
Found 92 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 92 transitions
Dead transitions reduction (with SMT) removed 92 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/103 places, 291/392 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 97 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 96 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 96 transition count 282
Applied a total of 7 rules in 3 ms. Remains 96 /102 variables (removed 6) and now considering 282/291 (removed 9) transitions.
[2026-05-24 03:19:37] [INFO ] Flow matrix only has 266 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-8784398136147030000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13365418187812280571.kers'
[2026-05-24 03:19:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8784398136147030000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13365418187812280571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 96 cols 1143 entries
Finished phase 1 with 85 SingleSign rule and 3 generalized
[2026-05-24 03:19:37] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13365418187812280571.kers
Total runtime 4 ms.
[2026-05-24 03:19:37] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 03:19:37] [INFO ] Flow matrix only has 266 transitions (discarded 16 similar events)
[2026-05-24 03:19:37] [INFO ] Invariant cache hit.
[2026-05-24 03:19:37] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 03:19:37] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/103 places, 282/392 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57220 ms. Remains : 96/103 places, 282/392 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 4 stabilizing places and 10 stable transitions
Computed a total of 4 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 15 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA BugTracking-PT-q3m256-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m256-LTLCardinality-09 finished in 57608 ms.
All properties solved by simple procedures.
Total runtime 323477 ms.

BK_STOP 1779592777933

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-q3m256"
export BK_EXAMINATION="LTLCardinality"
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-q3m256, examination is LTLCardinality"
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-177946841900379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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