Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067900668.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 Echo-PT-d02r11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067900668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 5.9K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 469K 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 Echo-PT-d02r11-LTLFireability-00
FORMULA_NAME Echo-PT-d02r11-LTLFireability-01
FORMULA_NAME Echo-PT-d02r11-LTLFireability-02
FORMULA_NAME Echo-PT-d02r11-LTLFireability-03
FORMULA_NAME Echo-PT-d02r11-LTLFireability-04
FORMULA_NAME Echo-PT-d02r11-LTLFireability-05
FORMULA_NAME Echo-PT-d02r11-LTLFireability-06
FORMULA_NAME Echo-PT-d02r11-LTLFireability-07
FORMULA_NAME Echo-PT-d02r11-LTLFireability-08
FORMULA_NAME Echo-PT-d02r11-LTLFireability-09
FORMULA_NAME Echo-PT-d02r11-LTLFireability-10
FORMULA_NAME Echo-PT-d02r11-LTLFireability-11
FORMULA_NAME Echo-PT-d02r11-LTLFireability-12
FORMULA_NAME Echo-PT-d02r11-LTLFireability-13
FORMULA_NAME Echo-PT-d02r11-LTLFireability-14
FORMULA_NAME Echo-PT-d02r11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748803042110

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 18:37:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 18:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:37:23] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-01 18:37:23] [INFO ] Transformed 1119 places.
[2025-06-01 18:37:23] [INFO ] Transformed 874 transitions.
[2025-06-01 18:37:23] [INFO ] Found NUPN structural information;
[2025-06-01 18:37:23] [INFO ] Parsed PT model containing 1119 places and 874 transitions and 4996 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d02r11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 874/874 transitions.
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 998 transition count 874
Applied a total of 121 rules in 111 ms. Remains 998 /1119 variables (removed 121) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2025-06-01 18:37:24] [INFO ] Computed 440 invariants in 342 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:37:36] [INFO ] Implicit Places using invariants in 12703 ms returned []
[2025-06-01 18:37:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:37:55] [INFO ] Implicit Places using invariants and state equation in 18500 ms returned []
Implicit Place search using SMT with State Equation took 31241 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30035 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30026 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in LTL mode, iteration 1 : 998/1119 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91805 ms. Remains : 998/1119 places, 874/874 transitions.
Support contains 99 out of 998 places after structural reductions.
[2025-06-01 18:38:55] [INFO ] Flatten gal took : 116 ms
[2025-06-01 18:38:55] [INFO ] Flatten gal took : 72 ms
[2025-06-01 18:38:56] [INFO ] Input system was already deterministic with 874 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (164 resets) in 1940 ms. (20 steps per ms) remains 2/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
[2025-06-01 18:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 412/420 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 412/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 553/973 variables, 307/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 553/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/998 variables, 24/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 25/1438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 0/1438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 1872/1872 variables, and 2436 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1432 ms.
Refiners :[Domain max(s): 998/998 constraints, Generalized P Invariants (flows): 440/440 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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' '!(((p0 U (p1||G(p2))) U X(p3)))'
Support contains 14 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 51 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2025-06-01 18:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:39:13] [INFO ] Implicit Places using invariants in 14556 ms returned []
[2025-06-01 18:39:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:39:32] [INFO ] Implicit Places using invariants and state equation in 19034 ms returned []
Implicit Place search using SMT with State Equation took 33595 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30028 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Finished structural reductions in LTL mode , in 1 iterations and 93956 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Echo-PT-d02r11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-00 finished in 94464 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((X(p1)&&p0)) U (X(p2)||(G(!p4)&&p3)))))'
Support contains 16 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 56 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2025-06-01 18:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:41:09] [INFO ] Performed 147/998 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2025-06-01 18:41:38] [INFO ] Implicit Places using invariants in 65704 ms returned []
[2025-06-01 18:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:42:00] [INFO ] Implicit Places using invariants and state equation in 21347 ms returned []
Implicit Place search using SMT with State Equation took 87056 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30017 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 0)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 0)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 0)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 0)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 0)
(s139 1)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 1)
(s209 0)
(s210 1)
(s211 1)
(s212 0)
(s213 1)
(s214 1)
(s215 0)
(s216 1)
(s217 1)
(s218 0)
(s219 1)
(s220 1)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 0)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 1)
(s279 0)
(s280 0)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 0)
(s355 0)
(s356 1)
(s357 1)
(s358 1)
(s359 0)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 0)
(s376 1)
(s377 1)
(s378 0)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 1)
(s396 0)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 0)
(s402 1)
(s403 1)
(s404 1)
(s405 0)
(s406 1)
(s407 1)
(s408 0)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 1)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 1)
(s443 0)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 1)
(s465 0)
(s466 1)
(s467 1)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 1)
(s473 1)
(s474 1)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30029 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in LTL mode , in 1 iterations and 147344 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) p4)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p1) (NOT p2) p4)), (AND (NOT p2) p4), (AND (NOT p1) (NOT p2) p4), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) p4) (AND (NOT p1) p4)), (AND (NOT p1) p4)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-02
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 10 ms.
FORMULA Echo-PT-d02r11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-02 finished in 147857 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(p0)&&F(G(p1)))))'
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 123 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2025-06-01 18:43:01] [INFO ] Computed 436 invariants in 275 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:43:15] [INFO ] Implicit Places using invariants in 14115 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 14120 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 43 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14286 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-03
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 10 ms.
FORMULA Echo-PT-d02r11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-03 finished in 14428 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(p0))'
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 52 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
[2025-06-01 18:43:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:43:33] [INFO ] Implicit Places using invariants in 17852 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 17855 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 34 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17941 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-04
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 6 ms.
FORMULA Echo-PT-d02r11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-04 finished in 17998 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 8 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 19 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2025-06-01 18:43:33] [INFO ] Computed 440 invariants in 208 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:43:55] [INFO ] Implicit Places using invariants in 21661 ms returned []
[2025-06-01 18:43:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:44:15] [INFO ] Implicit Places using invariants and state equation in 20061 ms returned []
Implicit Place search using SMT with State Equation took 41726 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:44: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/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in LTL mode , in 1 iterations and 101993 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 556 ms.
Product exploration explored 100000 steps with 50000 reset in 571 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-05 finished in 103519 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(((X(((F(p0)&&F(p1))||p2)) U p3)&&X(p4))))'
Support contains 12 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 19 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2025-06-01 18:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:45:57] [INFO ] Performed 392/998 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2025-06-01 18:46:12] [INFO ] Implicit Places using invariants in 55273 ms returned []
[2025-06-01 18:46:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:46:31] [INFO ] Implicit Places using invariants and state equation in 19430 ms returned []
Implicit Place search using SMT with State Equation took 74708 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30024 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30024 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in LTL mode , in 1 iterations and 134941 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p3) (NOT p4)), (NOT p4), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-06
Product exploration explored 100000 steps with 36351 reset in 468 ms.
Product exploration explored 100000 steps with 36299 reset in 518 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p3) p4 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X p4), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X p4)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (F (G (NOT p3))), (F (G p4)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 136 ms. Reduced automaton from 7 states, 15 edges and 5 AP (stutter sensitive) to 6 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 4806 steps (19 resets) in 139 ms. (34 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p3) p4 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1))), (X p4), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X p4)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (F (G (NOT p3))), (F (G p4)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR p3 p4 p1))), (F (NOT (OR p4 p0))), (F (NOT (OR p4 p1))), (F p3), (F p1), (F (NOT (AND (NOT p3) (NOT p0)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p4)), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 26 factoid took 587 ms. Reduced automaton from 6 states, 12 edges and 5 AP (stutter sensitive) to 6 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
[2025-06-01 18:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:47:40] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 18:47:42] [INFO ] [Real]Absence check using 0 positive and 440 generalized place invariants in 6044 ms returned unknown
Could not prove EG (NOT p3)
Support contains 12 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 14 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2025-06-01 18:47:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:48:22] [INFO ] Performed 480/998 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2025-06-01 18:48:42] [INFO ] Implicit Places using invariants in 60950 ms returned []
[2025-06-01 18:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:49:02] [INFO ] Implicit Places using invariants and state equation in 19104 ms returned []
Implicit Place search using SMT with State Equation took 80057 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:49:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30027 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30024 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Finished structural reductions in LTL mode , in 1 iterations and 140289 ms. Remains : 998/998 places, 874/874 transitions.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1) p4), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p3)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p4)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p4))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 134 ms. Reduced automaton from 6 states, 12 edges and 5 AP (stutter sensitive) to 6 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 6439 steps (25 resets) in 98 ms. (65 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1) p4), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p3)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p4)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p4) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) (NOT p0))))), (F (G (NOT p3))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p4))]
False Knowledge obtained : [(F (NOT (OR p1 p4 p3))), (F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR p4 p0 p3))), (F (NOT (OR p1 p4))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F (NOT (OR p4 p0))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p4)), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 23 factoid took 580 ms. Reduced automaton from 6 states, 12 edges and 5 AP (stutter sensitive) to 6 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
[2025-06-01 18:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 18:50:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 18:50:10] [INFO ] [Real]Absence check using 0 positive and 440 generalized place invariants in 6048 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p3) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 28661 reset in 457 ms.
Product exploration explored 100000 steps with 28584 reset in 512 ms.
Built C files in :
/tmp/ltsmin9742065335196587818
[2025-06-01 18:50:12] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9742065335196587818
Running compilation step : cd /tmp/ltsmin9742065335196587818;'/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 1891 ms.
Running link step : cd /tmp/ltsmin9742065335196587818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9742065335196587818;'/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/stateBased7942882817711058438.hoa' '--buchi-type=spotba'
LTSmin run took 2544 ms.
FORMULA Echo-PT-d02r11-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Echo-PT-d02r11-LTLFireability-06 finished in 299970 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(p0)))'
Support contains 2 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 34 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2025-06-01 18:50:17] [INFO ] Computed 436 invariants in 286 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:50:30] [INFO ] Implicit Places using invariants in 13850 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 13855 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 31 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13920 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-09
Product exploration explored 100000 steps with 584 reset in 785 ms.
Product exploration explored 100000 steps with 570 reset in 894 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-09 finished in 15990 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((X(p0)&&(G(!p1)||(!p1&&F((G(F(!p2))||(!p3&&F(!p2)))))))))))'
Support contains 13 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 17 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2025-06-01 18:50:33] [INFO ] Computed 440 invariants in 203 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:51:03] [INFO ] Implicit Places using invariants in 30227 ms returned []
[2025-06-01 18:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:51:23] [INFO ] Implicit Places using invariants and state equation in 20592 ms returned []
Implicit Place search using SMT with State Equation took 50825 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30029 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30031 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 111068 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), (AND p1 p2), (AND p2 p1), p2, p2]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-10
Product exploration explored 100000 steps with 20000 reset in 461 ms.
Product exploration explored 100000 steps with 20000 reset in 516 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 10 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
RANDOM walk for 38597 steps (158 resets) in 414 ms. (93 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Support contains 9 out of 998 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 15 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2025-06-01 18:52:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:52:57] [INFO ] Performed 553/998 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 18:53:02] [INFO ] Implicit Places using invariants in 35412 ms returned []
[2025-06-01 18:53:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:53:22] [INFO ] Implicit Places using invariants and state equation in 20603 ms returned []
Implicit Place search using SMT with State Equation took 56019 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:53:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30024 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30023 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Finished structural reductions in LTL mode , in 1 iterations and 116262 ms. Remains : 998/998 places, 874/874 transitions.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
RANDOM walk for 32812 steps (134 resets) in 478 ms. (68 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Product exploration explored 100000 steps with 20000 reset in 438 ms.
Product exploration explored 100000 steps with 20000 reset in 494 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Support contains 9 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 65 ms. Remains 993 /998 variables (removed 5) and now considering 873/874 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 18:54:25] [INFO ] Redundant transitions in 48 ms returned []
Running 872 sub problems to find dead transitions.
// Phase 1: matrix 873 rows 993 cols
[2025-06-01 18:54:26] [INFO ] Computed 436 invariants in 249 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/992 variables, 992/992 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/992 variables, 432/1424 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 992/1866 variables, and 1424 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30019 ms.
Refiners :[Domain max(s): 992/993 constraints, Generalized P Invariants (flows): 432/436 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 872 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/992 variables, 992/992 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/992 variables, 432/1424 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/1866 variables, and 1424 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30026 ms.
Refiners :[Domain max(s): 992/993 constraints, Generalized P Invariants (flows): 432/436 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 0/872 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60468ms problems are : Problem set: 0 solved, 872 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 993/998 places, 873/874 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60592 ms. Remains : 993/998 places, 873/874 transitions.
Built C files in :
/tmp/ltsmin8446682482689709268
[2025-06-01 18:55:26] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8446682482689709268
Running compilation step : cd /tmp/ltsmin8446682482689709268;'/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 1723 ms.
Running link step : cd /tmp/ltsmin8446682482689709268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8446682482689709268;'/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/stateBased17683733122693838595.hoa' '--buchi-type=spotba'
LTSmin run took 286 ms.
FORMULA Echo-PT-d02r11-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Echo-PT-d02r11-LTLFireability-10 finished in 295407 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 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 30 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2025-06-01 18:55:28] [INFO ] Computed 436 invariants in 264 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:55:58] [INFO ] Implicit Places using invariants in 30286 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30290 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 26 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30347 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-11
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d02r11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-11 finished in 30406 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(((p1&&G(p2))||p0))))))'
Support contains 6 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 15 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2025-06-01 18:55:59] [INFO ] Computed 440 invariants in 219 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:56:12] [INFO ] Implicit Places using invariants in 13403 ms returned []
[2025-06-01 18:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:56:33] [INFO ] Implicit Places using invariants and state equation in 21372 ms returned []
Implicit Place search using SMT with State Equation took 34779 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:56:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30025 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30028 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in LTL mode , in 1 iterations and 95002 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-12
Entered a terminal (fully accepting) state of product in 795 steps with 3 reset in 9 ms.
FORMULA Echo-PT-d02r11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-12 finished in 95227 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(p0)))'
Support contains 8 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 20 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2025-06-01 18:57:34] [INFO ] Computed 436 invariants in 258 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:57:48] [INFO ] Implicit Places using invariants in 14093 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 14095 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 25 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14140 ms. Remains : 988/998 places, 872/874 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-13
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 5 ms.
FORMULA Echo-PT-d02r11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLFireability-13 finished in 14223 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((F((G(p1)||p0))&&G(p2)))))'
Support contains 9 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Applied a total of 0 rules in 10 ms. Remains 998 /998 variables (removed 0) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2025-06-01 18:57:48] [INFO ] Computed 440 invariants in 206 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:58:18] [INFO ] Implicit Places using invariants in 29984 ms returned []
[2025-06-01 18:58:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 18:58:50] [INFO ] Performed 523/998 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 18:58:53] [INFO ] Implicit Places using invariants and state equation in 35382 ms returned []
Implicit Place search using SMT with State Equation took 65369 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 18:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30022 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in LTL mode , in 1 iterations and 125586 ms. Remains : 998/998 places, 874/874 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Echo-PT-d02r11-LTLFireability-14
Product exploration explored 100000 steps with 411 reset in 816 ms.
Product exploration explored 100000 steps with 411 reset in 871 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) p2))), (X p2), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 335 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r11-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLFireability-14 finished in 128073 ms.
All properties solved by simple procedures.
Total runtime 1353016 ms.

BK_STOP 1748804396688

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Echo-PT-d02r11"
export BK_EXAMINATION="LTLFireability"
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 Echo-PT-d02r11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067900668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r11.tgz
mv Echo-PT-d02r11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;