About the Execution of ITS-Tools for BugTracking-PT-q3m064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.663 | 3600000.00 | 3494536.00 | 146545.90 | FFT?TFTFFFFTFFFF | normal |
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-177946841900362.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-q3m064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900362
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:39 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 14K Mar 5 17:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 17:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:08 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-q3m064-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-12
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-13
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-14
FORMULA_NAME BugTracking-PT-q3m064-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779588838240
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 02:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 02:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 02:14:00] [INFO ] Load time of PNML (sax parser for PT used): 822 ms
[2026-05-24 02:14:00] [INFO ] Transformed 754 places.
[2026-05-24 02:14:00] [INFO ] Transformed 27370 transitions.
[2026-05-24 02:14:00] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 997 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 514 places in 99 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 72 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2026-05-24 02:14:00] [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-4540615908489013331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8561787778594581592.kers'
[2026-05-24 02:14:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4540615908489013331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8561787778594581592.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2626 rows 237 cols 12413 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 02:14:00] [INFO ] Computed 8 invariants in 12 ms
Computed 8 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8561787778594581592.kers
Total runtime 16 ms.
[2026-05-24 02:14:01] [INFO ] Implicit Places using invariants in 590 ms returned []
[2026-05-24 02:14:01] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 02:14:01] [INFO ] Invariant cache hit.
[2026-05-24 02:14:01] [INFO ] State equation strengthened by 240 read => feed constraints.
[2026-05-24 02:14:04] [INFO ] Implicit Places using invariants and state equation in 2736 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2026-05-24 02:14:04] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2026-05-24 02:14:04] [INFO ] Invariant cache hit.
[2026-05-24 02:14:04] [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 30081 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 30053 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 64388ms problems are : Problem set: 130 solved, 2618 unsolved
Search for dead transitions found 130 dead transitions in 64420ms
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 34 places and 829 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 203 transition count 1791
Reduce places removed 23 places and 281 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 57 place count 180 transition count 1510
Reduce places removed 10 places and 167 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 67 place count 170 transition count 1343
Reduce places removed 6 places and 114 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 73 place count 164 transition count 1229
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 163 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 76 place count 161 transition count 1174
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 15 places and 264 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 93 place count 146 transition count 910
Deduced a syphon composed of 6 places in 3 ms
Applied a total of 93 rules in 30 ms. Remains 146 /237 variables (removed 91) and now considering 910/2620 (removed 1710) transitions.
[2026-05-24 02:15:08] [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-11344983313034719689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-563728620297343917.kers'
[2026-05-24 02:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11344983313034719689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-563728620297343917.kers]
Culling trivial invariants: removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 868 rows 140 cols 3978 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-24 02:15:08] [INFO ] Computed 14 invariants in 6 ms
Computed 14 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-563728620297343917.kers
Total runtime 8 ms.
[2026-05-24 02:15:08] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 02:15:08] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 02:15:08] [INFO ] Invariant cache hit.
[2026-05-24 02:15:08] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 02:15:09] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/240 places, 910/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68987 ms. Remains : 146/240 places, 910/2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 910/910 transitions.
Deduced a syphon composed of 6 places in 2 ms
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 910/910 (removed 0) transitions.
[2026-05-24 02:15:09] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 02:15:09] [INFO ] Invariant cache hit.
[2026-05-24 02:15:09] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 02:15:09] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 02:15:09] [INFO ] Invariant cache hit.
[2026-05-24 02:15:09] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 02:15:10] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2026-05-24 02:15:10] [INFO ] Flow matrix only has 868 transitions (discarded 42 similar events)
[2026-05-24 02:15:10] [INFO ] Invariant cache hit.
[2026-05-24 02:15:10] [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 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 TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 2/10 constraints. Problems are: Problem set: 147 solved, 761 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 147 solved, 761 unsolved
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
At refinement iteration 3 (OVERLAPS) 868/1007 variables, 139/149 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 115/264 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 0/264 constraints. Problems are: Problem set: 151 solved, 757 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 1/1008 variables, 1/265 constraints. Problems are: Problem set: 151 solved, 757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/1014 variables, and 265 constraints, problems are : Problem set: 151 solved, 757 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/14 constraints, State Equation: 140/146 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 2/2 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, 2/10 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 3 (OVERLAPS) 868/1007 variables, 139/149 constraints. Problems are: Problem set: 151 solved, 757 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 115/264 constraints. Problems are: Problem set: 151 solved, 757 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 5 (INCLUDED_ONLY) 0/1007 variables, 660/924 constraints. Problems are: Problem set: 190 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1014 variables, and 925 constraints, problems are : Problem set: 190 solved, 718 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/14 constraints, State Equation: 139/146 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 660/908 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 190 solved, 718 unsolved
Search for dead transitions found 190 dead transitions in 60798ms
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 : 146/146 places, 720/910 transitions.
Reduce places removed 14 places and 192 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 132 transition count 528
Reduce places removed 13 places and 71 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 119 transition count 457
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 117 transition count 439
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 115 transition count 423
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 114 transition count 407
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 34 place count 112 transition count 392
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 112 transition count 392
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 36 rules in 8 ms. Remains 112 /146 variables (removed 34) and now considering 392/720 (removed 328) transitions.
[2026-05-24 02:16:11] [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-15306225020869116696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5155030654817050416.kers'
[2026-05-24 02:16:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15306225020869116696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5155030654817050416.kers]
Culling trivial invariants: removing 9 columns.
Culled 9 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 02:16:11] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5155030654817050416.kers
Total runtime 2 ms.
[2026-05-24 02:16:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 02:16:11] [INFO ] Flow matrix only has 367 transitions (discarded 25 similar events)
[2026-05-24 02:16:11] [INFO ] Invariant cache hit.
[2026-05-24 02:16:11] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 02:16:11] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/146 places, 392/910 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62056 ms. Remains : 112/146 places, 392/910 transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Support contains 5 out of 103 places after structural reductions.
[2026-05-24 02:16:11] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2026-05-24 02:16:11] [INFO ] Flatten gal took : 60 ms
[2026-05-24 02:16:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 02:16:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 02:16:11] [INFO ] Flatten gal took : 29 ms
[2026-05-24 02:16:11] [INFO ] Input system was already deterministic with 392 transitions.
Support contains 0 out of 103 places (down from 5) after GAL structural reductions.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-24 02:16:12] [INFO ] Flatten gal took : 24 ms
[2026-05-24 02:16:12] [INFO ] Flatten gal took : 25 ms
[2026-05-24 02:16:12] [INFO ] Input system was already deterministic with 392 transitions.
Computed a total of 4 stabilizing places and 23 stable transitions
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 2 ms. Remains 102 /103 variables (removed 1) and now considering 383/392 (removed 9) transitions.
[2026-05-24 02:16:12] [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-1966076780899552200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6146706888637946896.kers'
[2026-05-24 02:16:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1966076780899552200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6146706888637946896.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 02:16:12] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6146706888637946896.kers
Total runtime 1 ms.
[2026-05-24 02:16:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 02:16:12] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2026-05-24 02:16:12] [INFO ] Invariant cache hit.
[2026-05-24 02:16:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 02:16:12] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2026-05-24 02:16:12] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2026-05-24 02:16:12] [INFO ] Invariant cache hit.
[2026-05-24 02:16:12] [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 25910 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
Error getting values : (error "Timeout of Z3 solver reached")
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 30017 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 56041ms problems are : Problem set: 92 solved, 289 unsolved
Search for dead transitions found 92 dead transitions in 56043ms
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 02:17:08] [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-4082445469311588974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12480614507068075786.kers'
[2026-05-24 02:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4082445469311588974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12480614507068075786.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 02:17:08] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12480614507068075786.kers
Total runtime 2 ms.
[2026-05-24 02:17:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 02:17:08] [INFO ] Flow matrix only has 266 transitions (discarded 16 similar events)
[2026-05-24 02:17:08] [INFO ] Invariant cache hit.
[2026-05-24 02:17:08] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-24 02:17:08] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 319 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 56702 ms. Remains : 96/103 places, 282/392 transitions.
[2026-05-24 02:17:08] [INFO ] Flatten gal took : 17 ms
[2026-05-24 02:17:08] [INFO ] Flatten gal took : 15 ms
[2026-05-24 02:17:08] [INFO ] Input system was already deterministic with 282 transitions.
[2026-05-24 02:17:08] [INFO ] Flatten gal took : 12 ms
[2026-05-24 02:17:08] [INFO ] Flatten gal took : 11 ms
[2026-05-24 02:17:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1722846344765375071.gal : 9 ms
[2026-05-24 02:17:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2839945115008747445.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/CTLFireability1722846344765375071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2839945115008747445.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 02:17:39] [INFO ] Flatten gal took : 16 ms
[2026-05-24 02:17:39] [INFO ] Applying decomposition
[2026-05-24 02:17:39] [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/graph3067375232977081652.txt' '-o' '/tmp/graph3067375232977081652.bin' '-w' '/tmp/graph3067375232977081652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3067375232977081652.bin' '-l' '-1' '-v' '-w' '/tmp/graph3067375232977081652.weights' '-q' '0' '-e' '0.001'
[2026-05-24 02:17:39] [INFO ] Decomposing Gal with order
[2026-05-24 02:17:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 02:17:39] [INFO ] Removed a total of 27 redundant transitions.
[2026-05-24 02:17:39] [INFO ] Flatten gal took : 73 ms
[2026-05-24 02:17:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 5 ms.
[2026-05-24 02:17:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14336315309911378791.gal : 4 ms
[2026-05-24 02:17:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13791635279984406623.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/CTLFireability14336315309911378791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13791635279984406623.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 02:18:09] [INFO ] Flatten gal took : 15 ms
[2026-05-24 02:18:09] [INFO ] Flatten gal took : 17 ms
[2026-05-24 02:18:09] [INFO ] Applying decomposition
[2026-05-24 02:18:09] [INFO ] Flatten gal took : 12 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/graph8004586593876385516.txt' '-o' '/tmp/graph8004586593876385516.bin' '-w' '/tmp/graph8004586593876385516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8004586593876385516.bin' '-l' '-1' '-v' '-w' '/tmp/graph8004586593876385516.weights' '-q' '0' '-e' '0.001'
[2026-05-24 02:18:09] [INFO ] Decomposing Gal with order
[2026-05-24 02:18:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 02:18:09] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-24 02:18:09] [INFO ] Flatten gal took : 24 ms
[2026-05-24 02:18:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 4 ms.
[2026-05-24 02:18:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1253000958959143318.gal : 5 ms
[2026-05-24 02:18:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4630961086550742103.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/CTLFireability1253000958959143318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4630961086550742103.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 02:39:46] [INFO ] Flatten gal took : 210 ms
[2026-05-24 02:39:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15418702968976103509.gal : 49 ms
[2026-05-24 02:39:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16917807816577332615.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15418702968976103509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16917807816577332615.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 03:01:10] [INFO ] Flatten gal took : 87 ms
[2026-05-24 03:01:10] [INFO ] Input system was already deterministic with 392 transitions.
[2026-05-24 03:01:10] [INFO ] Transformed 103 places.
[2026-05-24 03:01:10] [INFO ] Transformed 392 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 03:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5043704800114519569.gal : 55 ms
[2026-05-24 03:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17168714455931874045.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/CTLFireability5043704800114519569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17168714455931874045.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m064"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m064, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946841900362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m064.tgz
mv BugTracking-PT-q3m064 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;