Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NoC3x3-PT-1B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 362K May 29 14:32 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-1B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-1B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748814182079

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-1B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 21:43:03] [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]
[2025-06-01 21:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:43:03] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-01 21:43:03] [INFO ] Transformed 1416 places.
[2025-06-01 21:43:03] [INFO ] Transformed 1640 transitions.
[2025-06-01 21:43:03] [INFO ] Found NUPN structural information;
[2025-06-01 21:43:03] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 238 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 3 formulas.
FORMULA NoC3x3-PT-1B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-1B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 341 places :
Symmetric choice reduction at 0 with 341 rule applications. Total rules 341 place count 1075 transition count 1299
Iterating global reduction 0 with 341 rules applied. Total rules applied 682 place count 1075 transition count 1299
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 873 place count 884 transition count 1108
Iterating global reduction 0 with 191 rules applied. Total rules applied 1064 place count 884 transition count 1108
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 1142 place count 884 transition count 1030
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 1177 place count 849 transition count 995
Iterating global reduction 1 with 35 rules applied. Total rules applied 1212 place count 849 transition count 995
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1229 place count 849 transition count 978
Applied a total of 1229 rules in 317 ms. Remains 849 /1416 variables (removed 567) and now considering 978/1640 (removed 662) transitions.
// Phase 1: matrix 978 rows 849 cols
[2025-06-01 21:43:04] [INFO ] Computed 40 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:43:04] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-06-01 21:43:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:43:05] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 977 sub problems to find dead transitions.
[2025-06-01 21:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/848 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 977 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 977 unsolved
Search for dead transitions found 0 dead transitions in 30245ms
Starting structural reductions in LTL mode, iteration 1 : 849/1416 places, 978/1640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31652 ms. Remains : 849/1416 places, 978/1640 transitions.
Support contains 32 out of 849 places after structural reductions.
[2025-06-01 21:43:35] [INFO ] Flatten gal took : 82 ms
[2025-06-01 21:43:35] [INFO ] Flatten gal took : 46 ms
[2025-06-01 21:43:35] [INFO ] Input system was already deterministic with 978 transitions.
RANDOM walk for 40000 steps (39 resets) in 1359 ms. (29 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
[2025-06-01 21:43:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 818/849 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/849 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 978/1827 variables, 849/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1827 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1827 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1827/1827 variables, and 889 constraints, problems are : Problem set: 0 solved, 2 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 849/849 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 818/849 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/849 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 978/1827 variables, 849/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1827 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1827 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1827 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1827/1827 variables, and 891 constraints, problems are : Problem set: 0 solved, 2 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 849/849 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1589ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 488 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=81 )
Parikh walk visited 2 properties in 12 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((p0||X(p1))))||G(p2))))'
Support contains 6 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 831 transition count 960
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 831 transition count 960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 831 transition count 959
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 823 transition count 951
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 823 transition count 951
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 823 transition count 946
Applied a total of 58 rules in 112 ms. Remains 823 /849 variables (removed 26) and now considering 946/978 (removed 32) transitions.
// Phase 1: matrix 946 rows 823 cols
[2025-06-01 21:43:38] [INFO ] Computed 40 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:43:38] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-01 21:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:43:39] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Running 945 sub problems to find dead transitions.
[2025-06-01 21:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 945 unsolved
At refinement iteration 1 (OVERLAPS) 1/823 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/1769 variables, and 40 constraints, problems are : Problem set: 0 solved, 945 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/823 constraints, PredecessorRefiner: 945/945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 945 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 945 unsolved
At refinement iteration 1 (OVERLAPS) 1/823 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 945 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:31] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:31] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:33] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:36] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:36] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:38] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 1)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 1)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 1)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 1)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/1769 variables, and 46 constraints, problems are : Problem set: 0 solved, 945 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/823 constraints, PredecessorRefiner: 0/945 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 945 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 823/849 places, 946/978 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61060 ms. Remains : 823/849 places, 946/978 transitions.
Stuttering acceptance computed with spot in 507 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-01 finished in 61648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Graph (trivial) has 792 edges and 849 vertex of which 546 / 849 are part of one of the 20 SCC in 4 ms
Free SCC test removed 526 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 322 transition count 373
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 314 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 313 transition count 372
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 19 place count 313 transition count 356
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 51 place count 297 transition count 356
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 65 place count 283 transition count 332
Iterating global reduction 3 with 14 rules applied. Total rules applied 79 place count 283 transition count 332
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 79 place count 283 transition count 330
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 281 transition count 330
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 278 transition count 324
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 278 transition count 324
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 219 place count 213 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 221 place count 213 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 212 transition count 260
Applied a total of 223 rules in 78 ms. Remains 212 /849 variables (removed 637) and now considering 260/978 (removed 718) transitions.
[2025-06-01 21:44:39] [INFO ] Flow matrix only has 241 transitions (discarded 19 similar events)
// Phase 1: matrix 241 rows 212 cols
[2025-06-01 21:44:39] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:40] [INFO ] Implicit Places using invariants in 101 ms returned [10, 38, 74, 119, 160, 192]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 102 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 206/849 places, 260/978 transitions.
Graph (trivial) has 148 edges and 206 vertex of which 26 / 206 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 192 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 192 transition count 231
Applied a total of 5 rules in 16 ms. Remains 192 /206 variables (removed 14) and now considering 231/260 (removed 29) transitions.
[2025-06-01 21:44:40] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
// Phase 1: matrix 212 rows 192 cols
[2025-06-01 21:44:40] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-01 21:44:40] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
[2025-06-01 21:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:44:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 192/849 places, 231/978 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 192/849 places, 231/978 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-02 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(X(p2)&&p1))))'
Support contains 4 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 828 transition count 957
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 828 transition count 957
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 817 transition count 946
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 817 transition count 946
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 70 place count 817 transition count 940
Applied a total of 70 rules in 125 ms. Remains 817 /849 variables (removed 32) and now considering 940/978 (removed 38) transitions.
// Phase 1: matrix 940 rows 817 cols
[2025-06-01 21:44:40] [INFO ] Computed 40 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:40] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-01 21:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:41] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 939 sub problems to find dead transitions.
[2025-06-01 21:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
SMT process timed out in 30119ms, After SMT, problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Starting structural reductions in LTL mode, iteration 1 : 817/849 places, 940/978 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30899 ms. Remains : 817/849 places, 940/978 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 6870 steps with 6 reset in 45 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-04 finished in 31153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)||X(p2))))))'
Support contains 6 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 832 transition count 961
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 832 transition count 961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 832 transition count 960
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 824 transition count 952
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 824 transition count 952
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 824 transition count 949
Applied a total of 54 rules in 59 ms. Remains 824 /849 variables (removed 25) and now considering 949/978 (removed 29) transitions.
// Phase 1: matrix 949 rows 824 cols
[2025-06-01 21:45:11] [INFO ] Computed 40 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:45:11] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-01 21:45:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:45:12] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Running 948 sub problems to find dead transitions.
[2025-06-01 21:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 948 unsolved
SMT process timed out in 30132ms, After SMT, problems are : Problem set: 0 solved, 948 unsolved
Search for dead transitions found 0 dead transitions in 30134ms
Starting structural reductions in LTL mode, iteration 1 : 824/849 places, 949/978 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30907 ms. Remains : 824/849 places, 949/978 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-05
Product exploration explored 100000 steps with 112 reset in 274 ms.
Product exploration explored 100000 steps with 112 reset in 318 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
RANDOM walk for 40000 steps (40 resets) in 365 ms. (109 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
[2025-06-01 21:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 654/824 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 949/1773 variables, 824/864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1773 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1773/1773 variables, and 864 constraints, problems are : Problem set: 0 solved, 3 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 824/824 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 164/170 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 654/824 variables, 36/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 949/1773 variables, 824/864 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 1/865 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1773 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1773 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1773/1773 variables, and 865 constraints, problems are : Problem set: 2 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 824/824 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 975ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 161 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 3 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p2 (NOT p0) p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 6 out of 824 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 949/949 transitions.
Applied a total of 0 rules in 32 ms. Remains 824 /824 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2025-06-01 21:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:45:45] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-01 21:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:45:46] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 948 sub problems to find dead transitions.
[2025-06-01 21:45:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 948 unsolved
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 948 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Finished structural reductions in LTL mode , in 1 iterations and 30870 ms. Remains : 824/824 places, 949/949 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (39 resets) in 312 ms. (127 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2025-06-01 21:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 164/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 654/824 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 949/1773 variables, 824/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1773 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1773/1773 variables, and 864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 824/824 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 164/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 654/824 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 949/1773 variables, 824/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 2/866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1773 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1773 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1773/1773 variables, and 866 constraints, problems are : Problem set: 0 solved, 2 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 824/824 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1072ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 229 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 102 reset in 207 ms.
Product exploration explored 100000 steps with 101 reset in 233 ms.
Built C files in :
/tmp/ltsmin9221873262573217707
[2025-06-01 21:46:19] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9221873262573217707
Running compilation step : cd /tmp/ltsmin9221873262573217707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1569 ms.
Running link step : cd /tmp/ltsmin9221873262573217707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9221873262573217707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17840331481363394939.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 824 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 949/949 transitions.
Applied a total of 0 rules in 20 ms. Remains 824 /824 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2025-06-01 21:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:46:34] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-01 21:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:46:35] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 948 sub problems to find dead transitions.
[2025-06-01 21:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 948 unsolved
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 0 solved, 948 unsolved
Search for dead transitions found 0 dead transitions in 30149ms
Finished structural reductions in LTL mode , in 1 iterations and 30895 ms. Remains : 824/824 places, 949/949 transitions.
Built C files in :
/tmp/ltsmin6380645228166605069
[2025-06-01 21:47:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6380645228166605069
Running compilation step : cd /tmp/ltsmin6380645228166605069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1465 ms.
Running link step : cd /tmp/ltsmin6380645228166605069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6380645228166605069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5589876109176116886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 21:47:20] [INFO ] Flatten gal took : 31 ms
[2025-06-01 21:47:20] [INFO ] Flatten gal took : 31 ms
[2025-06-01 21:47:20] [INFO ] Time to serialize gal into /tmp/LTL14815456799266347472.gal : 7 ms
[2025-06-01 21:47:20] [INFO ] Time to serialize properties into /tmp/LTL15961363557075250412.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14815456799266347472.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14814648845219635421.hoa' '-atoms' '/tmp/LTL15961363557075250412.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15961363557075250412.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14814648845219635421.hoa
Detected timeout of ITS tools.
[2025-06-01 21:47:35] [INFO ] Flatten gal took : 43 ms
[2025-06-01 21:47:35] [INFO ] Flatten gal took : 25 ms
[2025-06-01 21:47:35] [INFO ] Time to serialize gal into /tmp/LTL9061455815717505889.gal : 5 ms
[2025-06-01 21:47:35] [INFO ] Time to serialize properties into /tmp/LTL17571215301600530481.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9061455815717505889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17571215301600530481.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((p1265==0)||(p306==1))")U("((p1183==0)||(p1041==1))"))||(X("((p1172==0)||(p1094==1))")))))))
Formula 0 simplified : XXF((!"((p1265==0)||(p306==1))" R !"((p1183==0)||(p1041==1))") & X!"((p1172==0)||(p1094==1))")
Detected timeout of ITS tools.
[2025-06-01 21:47:50] [INFO ] Flatten gal took : 27 ms
[2025-06-01 21:47:50] [INFO ] Applying decomposition
[2025-06-01 21:47:51] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph479924878598808543.txt' '-o' '/tmp/graph479924878598808543.bin' '-w' '/tmp/graph479924878598808543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph479924878598808543.bin' '-l' '-1' '-v' '-w' '/tmp/graph479924878598808543.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:47:51] [INFO ] Decomposing Gal with order
[2025-06-01 21:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:47:51] [INFO ] Removed a total of 234 redundant transitions.
[2025-06-01 21:47:51] [INFO ] Flatten gal took : 89 ms
[2025-06-01 21:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 29 ms.
[2025-06-01 21:47:51] [INFO ] Time to serialize gal into /tmp/LTL14076341934191563906.gal : 16 ms
[2025-06-01 21:47:51] [INFO ] Time to serialize properties into /tmp/LTL15042425615577879351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14076341934191563906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15042425615577879351.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((i17.i1.i1.u293.p1265==0)||(i3.i1.i4.u71.p306==1))")U("((i16.u272.p1183==0)||(i14.i1.i0.u239.p1041==1))"))||(X("((i16.u27...202
Formula 0 simplified : XXF((!"((i17.i1.i1.u293.p1265==0)||(i3.i1.i4.u71.p306==1))" R !"((i16.u272.p1183==0)||(i14.i1.i0.u239.p1041==1))") & X!"((i16.u275.p...193
Reverse transition relation is NOT exact ! Due to transitions t348, t467, t739, i1.i0.t704, i3.i1.t622, i3.i1.t665, i3.i1.i3.u68.t664, i3.i1.i4.u71.t640, i...389
Computing Next relation with stutter on 9.50149e+21 deadlock states
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
896 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.07744,312076,1,0,635218,1252,13546,1.70861e+06,324,6374,540486
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-1B-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property NoC3x3-PT-1B-LTLCardinality-05 finished in 171310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 827 transition count 956
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 827 transition count 956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 827 transition count 955
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 817 transition count 945
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 817 transition count 945
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 817 transition count 939
Applied a total of 71 rules in 83 ms. Remains 817 /849 variables (removed 32) and now considering 939/978 (removed 39) transitions.
// Phase 1: matrix 939 rows 817 cols
[2025-06-01 21:48:02] [INFO ] Computed 40 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:48:03] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-01 21:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:48:03] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2025-06-01 21:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1756 variables, and 40 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:55] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:56] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:57] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:49:00] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:49:00] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:49:02] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1756 variables, and 46 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 817/849 places, 939/978 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60977 ms. Remains : 817/849 places, 939/978 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-09
Stuttering criterion allowed to conclude after 837 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-09 finished in 61087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 828 transition count 957
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 828 transition count 957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 828 transition count 956
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 818 transition count 946
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 818 transition count 946
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 818 transition count 941
Applied a total of 68 rules in 67 ms. Remains 818 /849 variables (removed 31) and now considering 941/978 (removed 37) transitions.
// Phase 1: matrix 941 rows 818 cols
[2025-06-01 21:49:03] [INFO ] Computed 40 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:04] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-01 21:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:04] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 940 sub problems to find dead transitions.
[2025-06-01 21:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/818 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/1759 variables, and 40 constraints, problems are : Problem set: 0 solved, 940 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 940/940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 940 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/818 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:49:56] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:49:56] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:49:58] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:01] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:01] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:03] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:04] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/1759 variables, and 47 constraints, problems are : Problem set: 0 solved, 940 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 0/940 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 940 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 818/849 places, 941/978 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60905 ms. Remains : 818/849 places, 941/978 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-10
Stuttering criterion allowed to conclude after 1164 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-10 finished in 61059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Graph (trivial) has 791 edges and 849 vertex of which 562 / 849 are part of one of the 20 SCC in 2 ms
Free SCC test removed 542 places
Ensure Unique test removed 614 transitions
Reduce isomorphic transitions removed 614 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 1 place count 306 transition count 348
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 291 transition count 348
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 46 place count 276 transition count 323
Iterating global reduction 0 with 15 rules applied. Total rules applied 61 place count 276 transition count 323
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 61 place count 276 transition count 321
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 65 place count 274 transition count 321
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 68 place count 271 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 271 transition count 315
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 191 place count 211 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 210 transition count 254
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 145 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 199 place count 191 transition count 254
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 225 place count 191 transition count 228
Applied a total of 225 rules in 49 ms. Remains 191 /849 variables (removed 658) and now considering 228/978 (removed 750) transitions.
[2025-06-01 21:50:04] [INFO ] Flow matrix only has 209 transitions (discarded 19 similar events)
// Phase 1: matrix 209 rows 191 cols
[2025-06-01 21:50:04] [INFO ] Computed 34 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-01 21:50:05] [INFO ] Flow matrix only has 209 transitions (discarded 19 similar events)
[2025-06-01 21:50:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:50:05] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:50:05] [INFO ] Redundant transitions in 8 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-01 21:50:05] [INFO ] Flow matrix only has 209 transitions (discarded 19 similar events)
[2025-06-01 21:50:05] [INFO ] Invariant cache hit.
[2025-06-01 21:50:05] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 20/191 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 208/399 variables, 191/225 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/400 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 191/191 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 20/191 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 208/399 variables, 191/225 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 108/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/400 variables, and 340 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4685 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 191/191 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9498ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 9499ms
Starting structural reductions in SI_LTL mode, iteration 1 : 191/849 places, 228/978 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9798 ms. Remains : 191/849 places, 228/978 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-12
Stuttering criterion allowed to conclude after 205 steps with 4 reset in 6 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-12 finished in 9874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 826 transition count 955
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 826 transition count 955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 826 transition count 954
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 815 transition count 943
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 815 transition count 943
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 815 transition count 937
Applied a total of 75 rules in 68 ms. Remains 815 /849 variables (removed 34) and now considering 937/978 (removed 41) transitions.
// Phase 1: matrix 937 rows 815 cols
[2025-06-01 21:50:14] [INFO ] Computed 40 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:15] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-01 21:50:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:15] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2025-06-01 21:50:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/814 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (OVERLAPS) 1/815 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/1752 variables, and 40 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/815 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/814 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (OVERLAPS) 1/815 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:07] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:08] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:09] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:12] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:12] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:14] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/1752 variables, and 46 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/815 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 815/849 places, 937/978 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60980 ms. Remains : 815/849 places, 937/978 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-13 finished in 61177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((G(F((G(F(p1))||(!p0&&F(p1)))))||(!p1&&F((G(F(p1))||(!p0&&F(p1))))))))))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Graph (trivial) has 789 edges and 849 vertex of which 559 / 849 are part of one of the 20 SCC in 1 ms
Free SCC test removed 539 places
Ensure Unique test removed 610 transitions
Reduce isomorphic transitions removed 610 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 1 place count 309 transition count 352
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 294 transition count 352
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 46 place count 279 transition count 327
Iterating global reduction 0 with 15 rules applied. Total rules applied 61 place count 279 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 61 place count 279 transition count 325
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 65 place count 277 transition count 325
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 68 place count 274 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 274 transition count 319
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 193 place count 213 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 212 transition count 257
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 146 edges and 206 vertex of which 26 / 206 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 201 place count 193 transition count 257
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 227 place count 193 transition count 231
Applied a total of 227 rules in 42 ms. Remains 193 /849 variables (removed 656) and now considering 231/978 (removed 747) transitions.
[2025-06-01 21:51:16] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
// Phase 1: matrix 212 rows 193 cols
[2025-06-01 21:51:16] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:16] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-01 21:51:16] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
[2025-06-01 21:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:51:16] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:51:16] [INFO ] Redundant transitions in 8 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-01 21:51:16] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
[2025-06-01 21:51:16] [INFO ] Invariant cache hit.
[2025-06-01 21:51:16] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 20/193 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 211/404 variables, 193/227 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 7/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/405 variables, and 234 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 193/193 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 20/193 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 211/404 variables, 193/227 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 7/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 110/344 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/405 variables, and 344 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4859 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 193/193 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9936ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 9936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 193/849 places, 231/978 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10229 ms. Remains : 193/849 places, 231/978 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-14 finished in 10389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
Support contains 4 out of 849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 849/849 places, 978/978 transitions.
Graph (trivial) has 788 edges and 849 vertex of which 548 / 849 are part of one of the 20 SCC in 3 ms
Free SCC test removed 528 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 320 transition count 378
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 317 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 316 transition count 377
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 9 place count 316 transition count 361
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 41 place count 300 transition count 361
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 56 place count 285 transition count 336
Iterating global reduction 3 with 15 rules applied. Total rules applied 71 place count 285 transition count 336
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 285 transition count 334
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 283 transition count 334
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 280 transition count 328
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 280 transition count 328
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 205 place count 218 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 218 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 217 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 217 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 216 transition count 268
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 132 edges and 215 vertex of which 4 / 215 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 213 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 216 place count 213 transition count 264
Applied a total of 216 rules in 58 ms. Remains 213 /849 variables (removed 636) and now considering 264/978 (removed 714) transitions.
[2025-06-01 21:51:26] [INFO ] Flow matrix only has 245 transitions (discarded 19 similar events)
// Phase 1: matrix 245 rows 213 cols
[2025-06-01 21:51:26] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:26] [INFO ] Implicit Places using invariants in 115 ms returned [11, 41, 78, 123, 164]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 116 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 208/849 places, 264/978 transitions.
Graph (trivial) has 140 edges and 208 vertex of which 22 / 208 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 196 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 196 transition count 238
Applied a total of 6 rules in 9 ms. Remains 196 /208 variables (removed 12) and now considering 238/264 (removed 26) transitions.
[2025-06-01 21:51:26] [INFO ] Flow matrix only has 219 transitions (discarded 19 similar events)
// Phase 1: matrix 219 rows 196 cols
[2025-06-01 21:51:26] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-01 21:51:26] [INFO ] Flow matrix only has 219 transitions (discarded 19 similar events)
[2025-06-01 21:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:51:26] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 196/849 places, 238/978 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 196/849 places, 238/978 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLCardinality-15
Stuttering criterion allowed to conclude after 54 steps with 1 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLCardinality-15 finished in 535 ms.
All properties solved by simple procedures.
Total runtime 503585 ms.

BK_STOP 1748814686924

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-1B"
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-5832"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-1B, 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 r142-tall-174876812100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1B.tgz
mv NoC3x3-PT-1B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;