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.r354-tall-178024402800083.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 LastZero-PT-N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 9.2K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 273K Jun 10 11:58 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 LastZero-PT-N08-LTLCardinality-00
FORMULA_NAME LastZero-PT-N08-LTLCardinality-01
FORMULA_NAME LastZero-PT-N08-LTLCardinality-02
FORMULA_NAME LastZero-PT-N08-LTLCardinality-03
FORMULA_NAME LastZero-PT-N08-LTLCardinality-04
FORMULA_NAME LastZero-PT-N08-LTLCardinality-05
FORMULA_NAME LastZero-PT-N08-LTLCardinality-06
FORMULA_NAME LastZero-PT-N08-LTLCardinality-07
FORMULA_NAME LastZero-PT-N08-LTLCardinality-08
FORMULA_NAME LastZero-PT-N08-LTLCardinality-09
FORMULA_NAME LastZero-PT-N08-LTLCardinality-10
FORMULA_NAME LastZero-PT-N08-LTLCardinality-11
FORMULA_NAME LastZero-PT-N08-LTLCardinality-12
FORMULA_NAME LastZero-PT-N08-LTLCardinality-13
FORMULA_NAME LastZero-PT-N08-LTLCardinality-14
FORMULA_NAME LastZero-PT-N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781642948520

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 20:49:09] [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-06-16 20:49:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:49:09] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-06-16 20:49:09] [INFO ] Transformed 180 places.
[2026-06-16 20:49:09] [INFO ] Transformed 857 transitions.
[2026-06-16 20:49:09] [INFO ] Parsed PT model containing 180 places and 857 transitions and 2699 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 82 places in 4 ms
Reduce places removed 82 places and 545 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 312/312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 312
Applied a total of 1 rules in 17 ms. Remains 96 /97 variables (removed 1) and now considering 312/312 (removed 0) transitions.
[2026-06-16 20:49:10] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10410042223736988618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5459376270814348226.kers'
[2026-06-16 20:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10410042223736988618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5459376270814348226.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 95 cols 734 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-16 20:49:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5459376270814348226.kers
Total runtime 2 ms.
[2026-06-16 20:49:10] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-06-16 20:49:10] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-16 20:49:10] [INFO ] Invariant cache hit.
[2026-06-16 20:49:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-16 20:49:10] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-06-16 20:49:10] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-16 20:49:10] [INFO ] Invariant cache hit.
[2026-06-16 20:49:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 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 TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 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 TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 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 TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 2 (OVERLAPS) 284/379 variables, 95/103 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 72/175 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/175 constraints. Problems are: Problem set: 203 solved, 101 unsolved
Problem TDEAD73 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/380 variables, 1/176 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/176 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/176 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 176 constraints, problems are : Problem set: 204 solved, 100 unsolved in 9159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 204 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 284/379 variables, 95/103 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 72/175 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 100/275 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/275 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/380 variables, 1/276 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/276 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/380 variables, 0/276 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 276 constraints, problems are : Problem set: 204 solved, 100 unsolved in 7023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 100/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16313ms problems are : Problem set: 204 solved, 100 unsolved
Search for dead transitions found 204 dead transitions in 16331ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 96/97 places, 108/312 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 86 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 86 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 84 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 84 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 82 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 82 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 81 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 81 transition count 90
Applied a total of 30 rules in 14 ms. Remains 81 /96 variables (removed 15) and now considering 90/108 (removed 18) transitions.
[2026-06-16 20:49:27] [INFO ] Flow matrix only has 68 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16669059793245727186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16398189133131655356.kers'
[2026-06-16 20:49:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16669059793245727186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16398189133131655356.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 68 rows 80 cols 164 entries
Finished phase 1 with 64 SingleSign rule and 1 generalized
[2026-06-16 20:49:27] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16398189133131655356.kers
Total runtime 0 ms.
[2026-06-16 20:49:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-16 20:49:27] [INFO ] Flow matrix only has 68 transitions (discarded 22 similar events)
[2026-06-16 20:49:27] [INFO ] Invariant cache hit.
[2026-06-16 20:49:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-06-16 20:49:27] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 81/97 places, 90/312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17239 ms. Remains : 81/97 places, 90/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2026-06-16 20:49:27] [INFO ] Flow matrix only has 68 transitions (discarded 22 similar events)
[2026-06-16 20:49:27] [INFO ] Invariant cache hit.
[2026-06-16 20:49:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-16 20:49:27] [INFO ] Flow matrix only has 68 transitions (discarded 22 similar events)
[2026-06-16 20:49:27] [INFO ] Invariant cache hit.
[2026-06-16 20:49:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-06-16 20:49:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2026-06-16 20:49:27] [INFO ] Flow matrix only has 68 transitions (discarded 22 similar events)
[2026-06-16 20:49:27] [INFO ] Invariant cache hit.
[2026-06-16 20:49:27] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 1/81 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 68/149 variables, 81/125 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 30/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 155 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4454 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 68/149 variables, 81/125 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 30/155 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 82/237 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 237 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2610 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7095ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 7096ms
Finished structural reductions in LTL mode , in 1 iterations and 7251 ms. Remains : 81/81 places, 90/90 transitions.
Support contains 17 out of 81 places after structural reductions.
[2026-06-16 20:49:34] [INFO ] Flatten gal took : 25 ms
[2026-06-16 20:49:34] [INFO ] Flatten gal took : 13 ms
[2026-06-16 20:49:34] [INFO ] Input system was already deterministic with 90 transitions.
RANDOM walk for 40000 steps (1600 resets) in 856 ms. (46 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40002 steps (334 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (336 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (314 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (334 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (356 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (336 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (338 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
[2026-06-16 20:49:35] [INFO ] Flow matrix only has 68 transitions (discarded 22 similar events)
[2026-06-16 20:49:35] [INFO ] Invariant cache hit.
[2026-06-16 20:49:35] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 33/149 variables, and 7 constraints, problems are : Problem set: 7 solved, 0 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 7/15 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/81 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
FORMULA LastZero-PT-N08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 81 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LastZero-PT-N08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p0)))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 71 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 71 transition count 76
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 67 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 67 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 64 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 64 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 61 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 61 transition count 62
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 58 transition count 57
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 58 transition count 57
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 55 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 55 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 52 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 52 transition count 48
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 49 transition count 44
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 49 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 47 transition count 41
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 47 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 45 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 45 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 44 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 44 transition count 37
Applied a total of 74 rules in 25 ms. Remains 44 /81 variables (removed 37) and now considering 37/90 (removed 53) transitions.
[2026-06-16 20:49:35] [INFO ] Flow matrix only has 28 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7756566449614540126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8746111950700376824.kers'
[2026-06-16 20:49:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7756566449614540126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8746111950700376824.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 28 rows 38 cols 59 entries
Finished phase 1 with 22 SingleSign rule and 6 generalized
[2026-06-16 20:49:35] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8746111950700376824.kers
Total runtime 0 ms.
[2026-06-16 20:49:35] [INFO ] Implicit Places using invariants in 211 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/81 places, 37/90 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 43/81 places, 37/90 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(G(p0)))'
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N08-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 3 ms.
FORMULA LastZero-PT-N08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N08-LTLCardinality-02 finished in 617 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((p0||X(!p0)))))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 71 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 71 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 66 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 66 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 63 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 63 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 60 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 60 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 57 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 57 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 55 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 55 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 53 transition count 50
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 53 transition count 50
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 51 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 51 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 50 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 50 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 49 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 48 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 48 transition count 43
Applied a total of 66 rules in 15 ms. Remains 48 /81 variables (removed 33) and now considering 43/90 (removed 47) transitions.
[2026-06-16 20:49:36] [INFO ] Flow matrix only has 32 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14335400399848165381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12793944081976598443.kers'
[2026-06-16 20:49:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14335400399848165381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12793944081976598443.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 32 rows 44 cols 71 entries
Finished phase 1 with 28 SingleSign rule and 4 generalized
[2026-06-16 20:49:36] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12793944081976598443.kers
Total runtime 0 ms.
[2026-06-16 20:49:36] [INFO ] Implicit Places using invariants in 63 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/81 places, 43/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 47/81 places, 43/90 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((p0||X(!p0)))))'
Stuttering acceptance computed with spot in 143 ms :[false, p0, false, false, true]
Running random walk in product with property : LastZero-PT-N08-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 166 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Computed a total of 47 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 36989 steps (1479 resets) in 139 ms. (264 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 368 ms.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0, p0, true]
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2026-06-16 20:49:37] [INFO ] Flow matrix only has 32 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7056229351634061782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5548594234143390381.kers'
[2026-06-16 20:49:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7056229351634061782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5548594234143390381.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 32 rows 44 cols 71 entries
Finished phase 1 with 29 SingleSign rule and 3 generalized
[2026-06-16 20:49:37] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5548594234143390381.kers
Total runtime 0 ms.
[2026-06-16 20:49:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-06-16 20:49:37] [INFO ] Flow matrix only has 32 transitions (discarded 11 similar events)
[2026-06-16 20:49:37] [INFO ] Invariant cache hit.
[2026-06-16 20:49:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-16 20:49:37] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 35 sub problems to find dead transitions.
[2026-06-16 20:49:37] [INFO ] Flow matrix only has 32 transitions (discarded 11 similar events)
[2026-06-16 20:49:37] [INFO ] Invariant cache hit.
[2026-06-16 20:49:37] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 32/79 variables, 47/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 78 constraints, problems are : Problem set: 0 solved, 35 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 32/79 variables, 47/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 35/113 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 113 constraints, problems are : Problem set: 0 solved, 35 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1402ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1402ms
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 47/47 places, 43/43 transitions.
Computed a total of 47 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 13644 steps (543 resets) in 34 ms. (389 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 364 ms.
Stuttering acceptance computed with spot in 175 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Spot run failed in 73 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2644337387045738458
[2026-06-16 20:49:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2644337387045738458
Running compilation step : cd /tmp/ltsmin2644337387045738458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 240 ms.
Running link step : cd /tmp/ltsmin2644337387045738458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2644337387045738458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15962774213136366974.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA LastZero-PT-N08-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-PT-N08-LTLCardinality-09 finished in 4058 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((F(p0)||(F(p0) U !p1))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 90/90 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 77 transition count 85
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 77 transition count 85
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 74 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 74 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 71 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 71 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 69 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 67 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 65 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 64 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 64 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 63 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 63 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 62 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 62 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 61 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 61 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 60 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 60 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 59 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 59 transition count 59
Applied a total of 44 rules in 17 ms. Remains 59 /81 variables (removed 22) and now considering 59/90 (removed 31) transitions.
[2026-06-16 20:49:40] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9181582043854784999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9236262687165963158.kers'
[2026-06-16 20:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9181582043854784999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9236262687165963158.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 44 rows 56 cols 102 entries
Finished phase 1 with 40 SingleSign rule and 3 generalized
[2026-06-16 20:49:40] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9236262687165963158.kers
Total runtime 0 ms.
[2026-06-16 20:49:40] [INFO ] Implicit Places using invariants in 43 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/81 places, 59/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 58/81 places, 59/90 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((F(p0)||(F(p0) U !p1))))'
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : LastZero-PT-N08-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 58 stabilizing places and 59 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 59
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 15 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 64 ms.
FORMULA LastZero-PT-N08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N08-LTLCardinality-11 finished in 445 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((G(p0) U X(X(G(p1))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 90/90 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 77 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 77 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 73 transition count 79
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 73 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 69 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 69 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 66 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 66 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 63 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 63 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 60 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 60 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 58 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 58 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 56 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 56 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 54 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 54 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 53 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 53 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 52 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 52 transition count 49
Applied a total of 58 rules in 9 ms. Remains 52 /81 variables (removed 29) and now considering 49/90 (removed 41) transitions.
[2026-06-16 20:49:40] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1265950457233204237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13513890616650346170.kers'
[2026-06-16 20:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1265950457233204237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13513890616650346170.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 36 rows 50 cols 83 entries
Finished phase 1 with 34 SingleSign rule and 2 generalized
[2026-06-16 20:49:40] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13513890616650346170.kers
Total runtime 0 ms.
[2026-06-16 20:49:40] [INFO ] Implicit Places using invariants in 42 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/81 places, 49/90 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 51/81 places, 49/90 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((G(p0) U X(X(G(p1))))))'
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : LastZero-PT-N08-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 35 steps with 1 reset in 0 ms.
FORMULA LastZero-PT-N08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N08-LTLCardinality-14 finished in 410 ms.
All properties solved by simple procedures.
Total runtime 31553 ms.

BK_STOP 1781642981577

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="LastZero-PT-N08"
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 LastZero-PT-N08, 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 r354-tall-178024402800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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