About the Execution of ITS-Tools for NoC3x3-PT-3A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 460.163 | 103191.00 | 132510.00 | 2169.70 | FFFFFFFFTTTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914000291.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 NoC3x3-PT-3A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.2K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 16 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:13 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 133K 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 NoC3x3-PT-3A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779746360140
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 21:59:21] [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-25 21:59:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 21:59:21] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-25 21:59:21] [INFO ] Transformed 370 places.
[2026-05-25 21:59:21] [INFO ] Transformed 450 transitions.
[2026-05-25 21:59:21] [INFO ] Found NUPN structural information;
[2026-05-25 21:59:21] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 175 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 6 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 352 transition count 449
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 124 place count 246 transition count 323
Ensure Unique test removed 40 places
Iterating global reduction 1 with 146 rules applied. Total rules applied 270 place count 206 transition count 323
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 335 place count 206 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 359 place count 206 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 366 place count 199 transition count 234
Applied a total of 366 rules in 63 ms. Remains 199 /370 variables (removed 171) and now considering 234/449 (removed 215) transitions.
[2026-05-25 21:59:21] [INFO ] Flow matrix only has 222 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1831916456217847172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15960349720860546647.kers'
[2026-05-25 21:59:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1831916456217847172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15960349720860546647.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 197 cols 734 entries
Finished phase 1 with 131 SingleSign rule and 6 generalized
[2026-05-25 21:59:21] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15960349720860546647.kers
Total runtime 2 ms.
[2026-05-25 21:59:22] [INFO ] Implicit Places using invariants in 300 ms returned [61, 124, 160]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 340 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/370 places, 234/449 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 421 ms. Remains : 196/370 places, 234/449 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 234/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2026-05-25 21:59:22] [INFO ] Flow matrix only has 222 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4771071562736667838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10531378843246613806.kers'
[2026-05-25 21:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4771071562736667838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10531378843246613806.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 194 cols 722 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-25 21:59:22] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10531378843246613806.kers
Total runtime 1 ms.
[2026-05-25 21:59:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 21:59:22] [INFO ] Flow matrix only has 222 transitions (discarded 12 similar events)
[2026-05-25 21:59:22] [INFO ] Invariant cache hit.
[2026-05-25 21:59:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 21:59:22] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-25 21:59:22] [INFO ] Flow matrix only has 222 transitions (discarded 12 similar events)
[2026-05-25 21:59:22] [INFO ] Invariant cache hit.
[2026-05-25 21:59:22] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 2/196 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 221/417 variables, 196/255 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 1/418 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 266 constraints, problems are : Problem set: 0 solved, 233 unsolved in 13581 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 196/196 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 2/196 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 221/417 variables, 196/255 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 233/498 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 1/418 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 499 constraints, problems are : Problem set: 0 solved, 233 unsolved in 26912 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 196/196 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40569ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 40580ms
Finished structural reductions in LTL mode , in 1 iterations and 40940 ms. Remains : 196/196 places, 234/234 transitions.
Support contains 26 out of 196 places after structural reductions.
[2026-05-25 22:00:03] [INFO ] Flatten gal took : 40 ms
[2026-05-25 22:00:03] [INFO ] Flatten gal took : 18 ms
[2026-05-25 22:00:03] [INFO ] Input system was already deterministic with 234 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 1116 ms. (35 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
[2026-05-25 22:00:03] [INFO ] Flow matrix only has 222 transitions (discarded 12 similar events)
[2026-05-25 22:00:03] [INFO ] Invariant cache hit.
[2026-05-25 22:00:03] [INFO ] State equation strengthened by 11 read => feed constraints.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 2/418 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/59 constraints, State Equation: 0/196 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA NoC3x3-PT-3A-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-3A-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-3A-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 568 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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((G((G(p1)||p0)) U (X(X(p2))&&(p3 U p4))))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 234/234 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 195 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 189 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 189 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 189 transition count 219
Applied a total of 17 rules in 9 ms. Remains 189 /196 variables (removed 7) and now considering 219/234 (removed 15) transitions.
[2026-05-25 22:00:03] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3578115829414265030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15025564809956805920.kers'
[2026-05-25 22:00:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3578115829414265030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15025564809956805920.kers]
Normalized transition count is 210 out of 211 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 210 rows 188 cols 686 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-25 22:00:03] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15025564809956805920.kers
Total runtime 2 ms.
[2026-05-25 22:00:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 22:00:04] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2026-05-25 22:00:04] [INFO ] Invariant cache hit.
[2026-05-25 22:00:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:00:04] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 22:00:04] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2026-05-25 22:00:04] [INFO ] Invariant cache hit.
[2026-05-25 22:00:04] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 1/189 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 257 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12015 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 1/189 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 218/474 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 475 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20913 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32959ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 32960ms
Starting structural reductions in LTL mode, iteration 1 : 189/196 places, 219/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33196 ms. Remains : 189/196 places, 219/234 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((G((G(p1)||p0)) U (X(X(p2))&&(p3 U p4))))))'
Stuttering acceptance computed with spot in 1349 ms :[(OR (NOT p4) (NOT p2)), (OR (NOT p4) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p4), (OR (NOT p4) (NOT p2)), (OR (AND (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p4)), (OR (AND (NOT p0) (NOT p1) (NOT p2) p4) (AND (NOT p0) (NOT p1) (NOT p2) p3)), (NOT p2), (AND p0 (NOT p1) (NOT p4)), (NOT p4), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p4)), (OR (AND (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p4)), (OR (AND (NOT p0) (NOT p1) (NOT p2) p4) (AND (NOT p0) (NOT p1) (NOT p2) p3)), (NOT p2), (AND p0 (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-00
Product exploration explored 100000 steps with 788 reset in 484 ms.
Stuttering criterion allowed to conclude after 25740 steps with 5724 reset in 139 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-00 finished in 35343 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)&&F(G(p1)))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 234/234 transitions.
Graph (complete) has 568 edges and 196 vertex of which 195 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 195 transition count 174
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 135 transition count 172
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 130 transition count 162
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 130 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 130 transition count 160
Applied a total of 135 rules in 25 ms. Remains 130 /196 variables (removed 66) and now considering 160/234 (removed 74) transitions.
[2026-05-25 22:00:39] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-928427897389807547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10072093763683403894.kers'
[2026-05-25 22:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-928427897389807547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10072093763683403894.kers]
Normalized transition count is 151 out of 152 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 151 rows 122 cols 519 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-25 22:00:39] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10072093763683403894.kers
Total runtime 1 ms.
[2026-05-25 22:00:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 22:00:39] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
[2026-05-25 22:00:39] [INFO ] Invariant cache hit.
[2026-05-25 22:00:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 22:00:39] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2026-05-25 22:00:39] [INFO ] Redundant transitions in 4 ms returned []
Running 159 sub problems to find dead transitions.
[2026-05-25 22:00:39] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
[2026-05-25 22:00:39] [INFO ] Invariant cache hit.
[2026-05-25 22:00:39] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 151/281 variables, 130/188 constraints. Problems are: Problem set: 0 solved, 159 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 29/217 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/282 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 218 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 130/130 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 151/281 variables, 130/188 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 29/217 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 159/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 1/282 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 377 constraints, problems are : Problem set: 0 solved, 159 unsolved in 9582 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 130/130 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14617ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 14618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/196 places, 160/234 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14824 ms. Remains : 130/196 places, 160/234 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-05
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-05 finished in 14973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 234/234 transitions.
Graph (complete) has 568 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 193 transition count 169
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 149 place count 120 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 149 place count 120 transition count 157
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 118 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 152 place count 118 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 116 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 158 place count 116 transition count 153
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 112 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 112 transition count 145
Applied a total of 166 rules in 37 ms. Remains 112 /196 variables (removed 84) and now considering 145/234 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3387173237450180306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3340280915820146392.kers'
[2026-05-25 22:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3387173237450180306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3340280915820146392.kers]
Normalized transition count is 144 out of 145 initially.
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 144 rows 86 cols 345 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 22:00:54] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3340280915820146392.kers
Total runtime 0 ms.
[2026-05-25 22:00:54] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 22:00:54] [INFO ] Invariant cache hit.
[2026-05-25 22:00:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:00:54] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2026-05-25 22:00:54] [INFO ] Redundant transitions in 71 ms returned [24, 32, 43, 44, 58, 59, 60, 61, 62, 69, 70, 73, 83, 96, 97, 99, 103, 106, 107, 108, 114, 115, 116, 119, 123, 126, 127, 129, 132, 133, 134, 135, 141]
Found 33 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 33 transitions
Redundant transitions reduction (with SMT) removed 33 transitions.
Running 88 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6014315005518379154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12795087020687194099.kers'
[2026-05-25 22:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6014315005518379154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12795087020687194099.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 111 rows 86 cols 259 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 22:00:54] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12795087020687194099.kers
Total runtime 1 ms.
[2026-05-25 22:00:54] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 12/112 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 111/223 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/224 variables, and 168 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 112/112 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 12/112 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 111/223 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 88/256 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/224 variables, and 256 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2383 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 112/112 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4109ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/196 places, 112/234 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 112 transition count 100
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 88 transition count 100
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 88 transition count 95
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 44 edges and 78 vertex of which 14 / 78 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 57 place count 71 transition count 90
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 64 place count 71 transition count 83
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 88 place count 55 transition count 75
Graph (trivial) has 37 edges and 55 vertex of which 16 / 55 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 47 transition count 75
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 97 place count 47 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 112 place count 47 transition count 52
Applied a total of 112 rules in 23 ms. Remains 47 /112 variables (removed 65) and now considering 52/112 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13500314793998821940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17879979073164453677.kers'
[2026-05-25 22:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13500314793998821940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17879979073164453677.kers]
Normalized transition count is 51 out of 52 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 51 rows 32 cols 107 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 22:00:58] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17879979073164453677.kers
Total runtime 0 ms.
[2026-05-25 22:00:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 22:00:58] [INFO ] Invariant cache hit.
[2026-05-25 22:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 22:00:58] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/196 places, 52/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4532 ms. Remains : 47/196 places, 52/234 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-12
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-12 finished in 4601 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 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 234/234 transitions.
Graph (complete) has 568 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 193 transition count 170
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 145 place count 122 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 122 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 120 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 148 place count 120 transition count 158
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 118 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 118 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 159 place count 113 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 164 place count 113 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 113 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 113 transition count 142
Applied a total of 167 rules in 19 ms. Remains 113 /196 variables (removed 83) and now considering 142/234 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12277942335342158685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12050190666884816863.kers'
[2026-05-25 22:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12277942335342158685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12050190666884816863.kers]
Normalized transition count is 141 out of 142 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 141 rows 86 cols 336 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 22:00:58] [INFO ] Computed 47 invariants in 1 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12050190666884816863.kers
Total runtime 2 ms.
[2026-05-25 22:00:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 22:00:58] [INFO ] Invariant cache hit.
[2026-05-25 22:00:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 22:00:58] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-05-25 22:00:59] [INFO ] Redundant transitions in 68 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 70, 80, 93, 94, 96, 100, 111, 112, 116, 120, 123, 124, 126, 129, 130, 131, 132, 138]
Found 28 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 28 transitions
Redundant transitions reduction (with SMT) removed 28 transitions.
Running 90 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5825733961281340459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-990193144702452893.kers'
[2026-05-25 22:00:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5825733961281340459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-990193144702452893.kers]
Normalized transition count is 113 out of 114 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 113 rows 86 cols 263 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 22:00:59] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-990193144702452893.kers
Total runtime 1 ms.
[2026-05-25 22:00:59] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 12/113 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 113/226 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/227 variables, and 169 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 12/113 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 113/226 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 90/259 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/227 variables, and 259 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4061ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4061ms
Starting structural reductions in SI_LTL mode, iteration 1 : 113/196 places, 114/234 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 113 transition count 103
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 91 transition count 103
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 37 place count 91 transition count 99
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 43 edges and 83 vertex of which 14 / 83 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 50 place count 76 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 59 place count 75 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 80 place count 61 transition count 80
Graph (trivial) has 37 edges and 61 vertex of which 14 / 61 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 54 transition count 80
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 88 place count 54 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 102 place count 54 transition count 59
Applied a total of 102 rules in 14 ms. Remains 54 /113 variables (removed 59) and now considering 59/114 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5802773554333646306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8270584641766345738.kers'
[2026-05-25 22:01:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5802773554333646306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8270584641766345738.kers]
Normalized transition count is 58 out of 59 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 58 rows 38 cols 126 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-25 22:01:03] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8270584641766345738.kers
Total runtime 1 ms.
[2026-05-25 22:01:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 22:01:03] [INFO ] Invariant cache hit.
[2026-05-25 22:01:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 22:01:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/196 places, 59/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4398 ms. Remains : 54/196 places, 59/234 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 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-15
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-15 finished in 4498 ms.
All properties solved by simple procedures.
Total runtime 102008 ms.
BK_STOP 1779746463331
--------------------
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="NoC3x3-PT-3A"
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 NoC3x3-PT-3A, 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 r194-tall-177969914000291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A 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 '
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 ;