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.r066-tall-177946967700435.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 CO4-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 336K 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 CO4-PT-20-LTLCardinality-00
FORMULA_NAME CO4-PT-20-LTLCardinality-01
FORMULA_NAME CO4-PT-20-LTLCardinality-02
FORMULA_NAME CO4-PT-20-LTLCardinality-03
FORMULA_NAME CO4-PT-20-LTLCardinality-04
FORMULA_NAME CO4-PT-20-LTLCardinality-05
FORMULA_NAME CO4-PT-20-LTLCardinality-06
FORMULA_NAME CO4-PT-20-LTLCardinality-07
FORMULA_NAME CO4-PT-20-LTLCardinality-08
FORMULA_NAME CO4-PT-20-LTLCardinality-09
FORMULA_NAME CO4-PT-20-LTLCardinality-10
FORMULA_NAME CO4-PT-20-LTLCardinality-11
FORMULA_NAME CO4-PT-20-LTLCardinality-12
FORMULA_NAME CO4-PT-20-LTLCardinality-13
FORMULA_NAME CO4-PT-20-LTLCardinality-14
FORMULA_NAME CO4-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779527017785

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 09:03:38] [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-23 09:03:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:03:39] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-23 09:03:39] [INFO ] Transformed 1178 places.
[2026-05-23 09:03:39] [INFO ] Transformed 1463 transitions.
[2026-05-23 09:03:39] [INFO ] Found NUPN structural information;
[2026-05-23 09:03:39] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 164 places :
Symmetric choice reduction at 1 with 164 rule applications. Total rules 191 place count 805 transition count 1041
Iterating global reduction 1 with 164 rules applied. Total rules applied 355 place count 805 transition count 1041
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 495 place count 665 transition count 888
Iterating global reduction 1 with 140 rules applied. Total rules applied 635 place count 665 transition count 888
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 642 place count 665 transition count 881
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 710 place count 597 transition count 808
Iterating global reduction 2 with 68 rules applied. Total rules applied 778 place count 597 transition count 808
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 780 place count 597 transition count 806
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 824 place count 553 transition count 762
Iterating global reduction 3 with 44 rules applied. Total rules applied 868 place count 553 transition count 762
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 875 place count 553 transition count 755
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 892 place count 536 transition count 738
Iterating global reduction 4 with 17 rules applied. Total rules applied 909 place count 536 transition count 738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 910 place count 536 transition count 737
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 916 place count 530 transition count 731
Iterating global reduction 5 with 6 rules applied. Total rules applied 922 place count 530 transition count 731
Applied a total of 922 rules in 260 ms. Remains 530 /991 variables (removed 461) and now considering 731/1212 (removed 481) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10765490634476207841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18114046931072639618.kers'
[2026-05-23 09:03:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10765490634476207841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18114046931072639618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 731 rows 530 cols 1925 entries
Finished phase 1 with 523 SingleSign rule and 0 generalized
[2026-05-23 09:03:39] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18114046931072639618.kers
Total runtime 4 ms.
[2026-05-23 09:03:39] [INFO ] Implicit Places using invariants in 348 ms returned [6, 450]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 387 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/991 places, 731/1212 transitions.
Applied a total of 0 rules in 9 ms. Remains 528 /528 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 669 ms. Remains : 528/991 places, 731/1212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Applied a total of 0 rules in 8 ms. Remains 528 /528 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2556418691230901130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-934174963317334575.kers'
[2026-05-23 09:03:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2556418691230901130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-934174963317334575.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 731 rows 528 cols 1902 entries
Finished phase 1 with 523 SingleSign rule and 0 generalized
[2026-05-23 09:03:39] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-934174963317334575.kers
Total runtime 3 ms.
[2026-05-23 09:03:40] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-23 09:03:40] [INFO ] Invariant cache hit.
[2026-05-23 09:03:40] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 730 sub problems to find dead transitions.
[2026-05-23 09:03:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (OVERLAPS) 1/528 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 731/1259 variables, 528/533 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1259/1259 variables, and 533 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (OVERLAPS) 1/528 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 731/1259 variables, 528/533 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1259 variables, 730/1263 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1259/1259 variables, and 1265 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Finished structural reductions in LTL mode , in 1 iterations and 60952 ms. Remains : 528/528 places, 731/731 transitions.
Support contains 24 out of 528 places after structural reductions.
[2026-05-23 09:04:41] [INFO ] Flatten gal took : 66 ms
[2026-05-23 09:04:41] [INFO ] Flatten gal took : 35 ms
[2026-05-23 09:04:41] [INFO ] Input system was already deterministic with 731 transitions.
RANDOM walk for 40000 steps (822 resets) in 1966 ms. (20 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (117 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (137 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (141 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (137 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (139 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (140 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (145 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (137 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
[2026-05-23 09:04:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/56 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 271/327 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 24/351 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 12/363 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 433/796 variables, 200/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 328/1124 variables, 174/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1124 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 96/1220 variables, 60/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1220 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 25/1245 variables, 13/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1245 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 13/1258 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1258 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/1259 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1259 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/1259 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1259/1259 variables, and 533 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 39/56 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 271/327 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 24/351 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 12/363 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 433/796 variables, 200/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 328/1124 variables, 174/459 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 96/1220 variables, 60/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1220 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 25/1245 variables, 13/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1245 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 13/1258 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1258 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 21 (OVERLAPS) 1/1259 variables, 1/541 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1259 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/1259 variables, 0/541 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1259/1259 variables, and 541 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4043ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 128 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA CO4-PT-20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 23 stabilizing places and 38 stable transitions
Graph (complete) has 1056 edges and 528 vertex of which 521 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.16 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 U !p1)))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 516 transition count 719
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 516 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 516 transition count 718
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 506 transition count 708
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 506 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 506 transition count 707
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 501 transition count 702
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 501 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 501 transition count 700
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 498 transition count 697
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 498 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 498 transition count 695
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 497 transition count 694
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 497 transition count 694
Applied a total of 68 rules in 60 ms. Remains 497 /528 variables (removed 31) and now considering 694/731 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-969345368854351547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3701192463847132974.kers'
[2026-05-23 09:04:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-969345368854351547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3701192463847132974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 694 rows 497 cols 1816 entries
Finished phase 1 with 492 SingleSign rule and 0 generalized
[2026-05-23 09:04:46] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3701192463847132974.kers
Total runtime 4 ms.
[2026-05-23 09:04:46] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-23 09:04:46] [INFO ] Invariant cache hit.
[2026-05-23 09:04:47] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2026-05-23 09:04:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (OVERLAPS) 694/1191 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 502 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1191 variables, 497/504 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 693/1197 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 1197 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in LTL mode, iteration 1 : 497/528 places, 694/731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 497/528 places, 694/731 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 U !p1)))'
Stuttering acceptance computed with spot in 232 ms :[p1, p1, true]
Running random walk in product with property : CO4-PT-20-LTLCardinality-02
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 2 ms.
FORMULA CO4-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-02 finished in 61009 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(X(X(X(F((G(p0)||(p0&&F(p1)))))))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 515 transition count 717
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 515 transition count 717
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 504 transition count 706
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 504 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 504 transition count 705
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 500 transition count 701
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 500 transition count 701
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 500 transition count 700
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 497 transition count 697
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 497 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 497 transition count 695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 496 transition count 694
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 496 transition count 694
Applied a total of 68 rules in 50 ms. Remains 496 /528 variables (removed 32) and now considering 694/731 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8695092407423130350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5013282495993122927.kers'
[2026-05-23 09:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8695092407423130350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5013282495993122927.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 694 rows 496 cols 1808 entries
Finished phase 1 with 491 SingleSign rule and 0 generalized
[2026-05-23 09:05:47] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5013282495993122927.kers
Total runtime 4 ms.
[2026-05-23 09:05:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 09:05:47] [INFO ] Invariant cache hit.
[2026-05-23 09:05:48] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2026-05-23 09:05:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 694/1190 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 501 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1190 variables, 496/503 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1190 variables, 693/1196 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1196 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 496/528 places, 694/731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 496/528 places, 694/731 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(X(F((G(p0)||(p0&&F(p1)))))))))'
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-05
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-05 finished in 60894 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(X(X(F(p0)))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 515 transition count 717
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 515 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 515 transition count 716
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 38 place count 504 transition count 705
Iterating global reduction 1 with 11 rules applied. Total rules applied 49 place count 504 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 504 transition count 704
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 499 transition count 699
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 499 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 499 transition count 697
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 496 transition count 694
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 496 transition count 694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 495 transition count 691
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 495 transition count 691
Applied a total of 72 rules in 52 ms. Remains 495 /528 variables (removed 33) and now considering 691/731 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11006375834258578502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11820836308310367640.kers'
[2026-05-23 09:06:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11006375834258578502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11820836308310367640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 691 rows 495 cols 1801 entries
Finished phase 1 with 490 SingleSign rule and 0 generalized
[2026-05-23 09:06:48] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11820836308310367640.kers
Total runtime 4 ms.
[2026-05-23 09:06:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 09:06:48] [INFO ] Invariant cache hit.
[2026-05-23 09:06:49] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2026-05-23 09:06:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 690/1190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1191 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 495/528 places, 691/731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60612 ms. Remains : 495/528 places, 691/731 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 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-08
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-08 finished in 60779 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' '!(G(F(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Graph (trivial) has 565 edges and 528 vertex of which 3 / 528 are part of one of the 1 SCC in 9 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1054 edges and 526 vertex of which 519 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 224 place count 518 transition count 498
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 1 with 222 rules applied. Total rules applied 446 place count 296 transition count 498
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 446 place count 296 transition count 455
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 532 place count 253 transition count 455
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 537 place count 248 transition count 449
Iterating global reduction 2 with 5 rules applied. Total rules applied 542 place count 248 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 542 place count 248 transition count 447
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 546 place count 246 transition count 447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 245 transition count 446
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 245 transition count 446
Performed 92 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 732 place count 153 transition count 325
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 745 place count 153 transition count 312
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 755 place count 143 transition count 297
Iterating global reduction 3 with 10 rules applied. Total rules applied 765 place count 143 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 767 place count 143 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 769 place count 142 transition count 294
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 770 place count 141 transition count 292
Iterating global reduction 4 with 1 rules applied. Total rules applied 771 place count 141 transition count 292
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 853 place count 100 transition count 340
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 874 place count 100 transition count 319
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 902 place count 72 transition count 207
Iterating global reduction 5 with 28 rules applied. Total rules applied 930 place count 72 transition count 207
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 949 place count 72 transition count 188
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 956 place count 65 transition count 150
Iterating global reduction 6 with 7 rules applied. Total rules applied 963 place count 65 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 968 place count 65 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 974 place count 62 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 1015 place count 62 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1017 place count 60 transition count 128
Applied a total of 1017 rules in 134 ms. Remains 60 /528 variables (removed 468) and now considering 128/731 (removed 603) transitions.
[2026-05-23 09:07:49] [INFO ] Flow matrix only has 110 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7206907145341182937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2792728678418200132.kers'
[2026-05-23 09:07:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7206907145341182937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2792728678418200132.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 60 cols 317 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-23 09:07:49] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2792728678418200132.kers
Total runtime 1 ms.
[2026-05-23 09:07:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 09:07:49] [INFO ] Flow matrix only has 110 transitions (discarded 18 similar events)
[2026-05-23 09:07:49] [INFO ] Invariant cache hit.
[2026-05-23 09:07:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:07:49] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2026-05-23 09:07:49] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-23 09:07:49] [INFO ] Flow matrix only has 110 transitions (discarded 18 similar events)
[2026-05-23 09:07:49] [INFO ] Invariant cache hit.
[2026-05-23 09:07:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 109/169 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/170 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 67 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2589 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 109/169 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 105/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/170 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 172 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4478 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7081ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/528 places, 128/731 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7331 ms. Remains : 60/528 places, 128/731 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' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-10 finished in 7424 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(X(F((p0&&F(p1)))))||G(p2)))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 517 transition count 719
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 517 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 517 transition count 718
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 508 transition count 709
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 508 transition count 709
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 504 transition count 705
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 504 transition count 705
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 504 transition count 703
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 502 transition count 701
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 502 transition count 701
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 502 transition count 700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 501 transition count 699
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 501 transition count 699
Applied a total of 58 rules in 50 ms. Remains 501 /528 variables (removed 27) and now considering 699/731 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17563991149541377900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7175204745562710916.kers'
[2026-05-23 09:07:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17563991149541377900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7175204745562710916.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 699 rows 501 cols 1821 entries
Finished phase 1 with 496 SingleSign rule and 0 generalized
[2026-05-23 09:07:56] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7175204745562710916.kers
Total runtime 3 ms.
[2026-05-23 09:07:56] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 09:07:56] [INFO ] Invariant cache hit.
[2026-05-23 09:07:57] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2026-05-23 09:07:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 698 unsolved
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 30123ms
Starting structural reductions in LTL mode, iteration 1 : 501/528 places, 699/731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30573 ms. Remains : 501/528 places, 699/731 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(F((p0&&F(p1)))))||G(p2)))'
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-20-LTLCardinality-12
Stuttering criterion allowed to conclude after 4377 steps with 89 reset in 16 ms.
FORMULA CO4-PT-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-12 finished in 30886 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(X(X((G(p0)&&F(G(p1)))))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 731/731 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 517 transition count 719
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 517 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 517 transition count 718
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 508 transition count 709
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 508 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 508 transition count 708
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 505 transition count 705
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 505 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 505 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 503 transition count 702
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 503 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 503 transition count 701
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 502 transition count 700
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 502 transition count 700
Applied a total of 56 rules in 51 ms. Remains 502 /528 variables (removed 26) and now considering 700/731 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15185773618525746482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5791507034946997081.kers'
[2026-05-23 09:08:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15185773618525746482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5791507034946997081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 700 rows 502 cols 1828 entries
Finished phase 1 with 497 SingleSign rule and 0 generalized
[2026-05-23 09:08:27] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5791507034946997081.kers
Total runtime 3 ms.
[2026-05-23 09:08:27] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-23 09:08:27] [INFO ] Invariant cache hit.
[2026-05-23 09:08:28] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 699 sub problems to find dead transitions.
[2026-05-23 09:08:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 700/1202 variables, 502/507 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 507 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (OVERLAPS) 700/1202 variables, 502/509 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 699/1208 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1208 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 502/528 places, 700/731 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60623 ms. Remains : 502/528 places, 700/731 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((G(p0)&&F(G(p1)))))))'
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-14
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-14 finished in 60847 ms.
All properties solved by simple procedures.
Total runtime 349607 ms.

BK_STOP 1779527368557

--------------------
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="CO4-PT-20"
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 CO4-PT-20, 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 r066-tall-177946967700435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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