Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407400332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is PhaseVariation-PT-D10CS010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407400332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 11 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 11 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.9M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-00
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-01
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-02
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-03
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-04
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-05
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-06
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-07
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-08
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-09
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-10
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-11
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-12
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-13
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-14
FORMULA_NAME PhaseVariation-PT-D10CS010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717286270285

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhaseVariation-PT-D10CS010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:57:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:57:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:57:54] [INFO ] Load time of PNML (sax parser for PT used): 801 ms
[2024-06-01 23:57:54] [INFO ] Transformed 302 places.
[2024-06-01 23:57:54] [INFO ] Transformed 3137 transitions.
[2024-06-01 23:57:54] [INFO ] Parsed PT model containing 302 places and 3137 transitions and 21755 arcs in 1208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 52 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 3085/3085 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 0 with 256 rules applied. Total rules applied 256 place count 299 transition count 2829
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 259 place count 296 transition count 2807
Iterating global reduction 0 with 3 rules applied. Total rules applied 262 place count 296 transition count 2807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 265 place count 296 transition count 2804
Applied a total of 265 rules in 152 ms. Remains 296 /299 variables (removed 3) and now considering 2804/3085 (removed 281) transitions.
Running 2791 sub problems to find dead transitions.
[2024-06-01 23:57:54] [INFO ] Flow matrix only has 196 transitions (discarded 2608 similar events)
// Phase 1: matrix 196 rows 296 cols
[2024-06-01 23:57:54] [INFO ] Computed 100 invariants in 34 ms
[2024-06-01 23:57:55] [INFO ] State equation strengthened by 183 read => feed constraints.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 91/91 constraints. Problems are: Problem set: 364 solved, 2427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/492 variables, and 91 constraints, problems are : Problem set: 364 solved, 2427 unsolved in 20275 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/296 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2791/2791 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 364 solved, 2427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 91/91 constraints. Problems are: Problem set: 364 solved, 2427 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 288/492 variables, and 91 constraints, problems are : Problem set: 364 solved, 2427 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/296 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2791 constraints, Known Traps: 0/0 constraints]
After SMT, in 42749ms problems are : Problem set: 364 solved, 2427 unsolved
Search for dead transitions found 364 dead transitions in 42946ms
Found 364 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 364 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 364 transitions.
[2024-06-01 23:58:37] [INFO ] Flow matrix only has 196 transitions (discarded 2244 similar events)
// Phase 1: matrix 196 rows 296 cols
[2024-06-01 23:58:37] [INFO ] Computed 100 invariants in 5 ms
[2024-06-01 23:58:38] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-06-01 23:58:38] [INFO ] Flow matrix only has 196 transitions (discarded 2244 similar events)
[2024-06-01 23:58:38] [INFO ] Invariant cache hit.
[2024-06-01 23:58:38] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-01 23:58:39] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/299 places, 2440/3085 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 232 transition count 1658
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 232 transition count 1658
Ensure Unique test removed 571 transitions
Reduce isomorphic transitions removed 571 transitions.
Iterating post reduction 0 with 571 rules applied. Total rules applied 699 place count 232 transition count 1087
Applied a total of 699 rules in 50 ms. Remains 232 /296 variables (removed 64) and now considering 1087/2440 (removed 1353) transitions.
[2024-06-01 23:58:39] [INFO ] Flow matrix only has 132 transitions (discarded 955 similar events)
// Phase 1: matrix 132 rows 232 cols
[2024-06-01 23:58:39] [INFO ] Computed 100 invariants in 3 ms
[2024-06-01 23:58:40] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-01 23:58:40] [INFO ] Flow matrix only has 132 transitions (discarded 955 similar events)
[2024-06-01 23:58:40] [INFO ] Invariant cache hit.
[2024-06-01 23:58:40] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 23:58:40] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 232/299 places, 1087/3085 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46485 ms. Remains : 232/299 places, 1087/3085 transitions.
Support contains 67 out of 232 places after structural reductions.
[2024-06-01 23:58:41] [INFO ] Flatten gal took : 244 ms
[2024-06-01 23:58:41] [INFO ] Flatten gal took : 141 ms
[2024-06-01 23:58:41] [INFO ] Input system was already deterministic with 1087 transitions.
Support contains 62 out of 232 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (828 resets) in 2417 ms. (16 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (9 resets) in 306 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
[2024-06-01 23:58:42] [INFO ] Flow matrix only has 132 transitions (discarded 955 similar events)
[2024-06-01 23:58:42] [INFO ] Invariant cache hit.
[2024-06-01 23:58:43] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 110/364 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 0/232 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 232 stabilizing places and 1087 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 1087
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 201 transition count 832
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 201 transition count 832
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 195 rules applied. Total rules applied 257 place count 201 transition count 637
Applied a total of 257 rules in 139 ms. Remains 201 /232 variables (removed 31) and now considering 637/1087 (removed 450) transitions.
Running 629 sub problems to find dead transitions.
[2024-06-01 23:58:43] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
// Phase 1: matrix 101 rows 201 cols
[2024-06-01 23:58:43] [INFO ] Computed 100 invariants in 3 ms
[2024-06-01 23:58:43] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 394 constraints, problems are : Problem set: 0 solved, 629 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 629/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 1023 constraints, problems are : Problem set: 0 solved, 629 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
After SMT, in 40224ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 40235ms
[2024-06-01 23:59:23] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
[2024-06-01 23:59:23] [INFO ] Invariant cache hit.
[2024-06-01 23:59:24] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-06-01 23:59:24] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
[2024-06-01 23:59:24] [INFO ] Invariant cache hit.
[2024-06-01 23:59:24] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-01 23:59:25] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2024-06-01 23:59:25] [INFO ] Redundant transitions in 76 ms returned []
Running 629 sub problems to find dead transitions.
[2024-06-01 23:59:25] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
[2024-06-01 23:59:25] [INFO ] Invariant cache hit.
[2024-06-01 23:59:25] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 394 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 629/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 1023 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in SI_LTL mode, iteration 1 : 201/232 places, 637/1087 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102146 ms. Remains : 201/232 places, 637/1087 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-01
Product exploration explored 100000 steps with 2345 reset in 1501 ms.
Product exploration explored 100000 steps with 2320 reset in 1205 ms.
Computed a total of 201 stabilizing places and 637 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 637
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge 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 25 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-01 finished in 105508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U (F(!p1) U !p2))))'
Support contains 7 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 203 transition count 850
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 203 transition count 850
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Iterating post reduction 0 with 183 rules applied. Total rules applied 241 place count 203 transition count 667
Applied a total of 241 rules in 118 ms. Remains 203 /232 variables (removed 29) and now considering 667/1087 (removed 420) transitions.
Running 659 sub problems to find dead transitions.
[2024-06-02 00:00:29] [INFO ] Flow matrix only has 103 transitions (discarded 564 similar events)
// Phase 1: matrix 103 rows 203 cols
[2024-06-02 00:00:29] [INFO ] Computed 100 invariants in 8 ms
[2024-06-02 00:00:29] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 659 unsolved
SMT process timed out in 20217ms, After SMT, problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 20234ms
[2024-06-02 00:00:49] [INFO ] Flow matrix only has 103 transitions (discarded 564 similar events)
[2024-06-02 00:00:49] [INFO ] Invariant cache hit.
[2024-06-02 00:00:49] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-02 00:00:49] [INFO ] Flow matrix only has 103 transitions (discarded 564 similar events)
[2024-06-02 00:00:49] [INFO ] Invariant cache hit.
[2024-06-02 00:00:50] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 00:00:50] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2024-06-02 00:00:50] [INFO ] Redundant transitions in 33 ms returned []
Running 659 sub problems to find dead transitions.
[2024-06-02 00:00:50] [INFO ] Flow matrix only has 103 transitions (discarded 564 similar events)
[2024-06-02 00:00:50] [INFO ] Invariant cache hit.
[2024-06-02 00:00:50] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 398 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 659/1057 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 1057 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 203/232 places, 667/1087 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81972 ms. Remains : 203/232 places, 667/1087 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-02 finished in 82295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 202 transition count 833
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 202 transition count 833
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 252 place count 202 transition count 641
Applied a total of 252 rules in 109 ms. Remains 202 /232 variables (removed 30) and now considering 641/1087 (removed 446) transitions.
Running 632 sub problems to find dead transitions.
[2024-06-02 00:01:51] [INFO ] Flow matrix only has 102 transitions (discarded 539 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-02 00:01:51] [INFO ] Computed 100 invariants in 3 ms
[2024-06-02 00:01:51] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 395 constraints, problems are : Problem set: 0 solved, 632 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 632/1027 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1027 constraints, problems are : Problem set: 0 solved, 632 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints]
After SMT, in 40317ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 40337ms
[2024-06-02 00:02:31] [INFO ] Flow matrix only has 102 transitions (discarded 539 similar events)
[2024-06-02 00:02:31] [INFO ] Invariant cache hit.
[2024-06-02 00:02:32] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-02 00:02:32] [INFO ] Flow matrix only has 102 transitions (discarded 539 similar events)
[2024-06-02 00:02:32] [INFO ] Invariant cache hit.
[2024-06-02 00:02:32] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 00:02:33] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-06-02 00:02:33] [INFO ] Redundant transitions in 15 ms returned []
Running 632 sub problems to find dead transitions.
[2024-06-02 00:02:33] [INFO ] Flow matrix only has 102 transitions (discarded 539 similar events)
[2024-06-02 00:02:33] [INFO ] Invariant cache hit.
[2024-06-02 00:02:33] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 395 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 632/1027 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 632 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 1027 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 202/232 places, 641/1087 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102061 ms. Remains : 202/232 places, 641/1087 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-03
Product exploration explored 100000 steps with 2366 reset in 1170 ms.
Product exploration explored 100000 steps with 2306 reset in 1097 ms.
Computed a total of 202 stabilizing places and 641 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 641
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-03 finished in 104627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 202 transition count 831
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 202 transition count 831
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 256 place count 202 transition count 635
Applied a total of 256 rules in 17 ms. Remains 202 /232 variables (removed 30) and now considering 635/1087 (removed 452) transitions.
Running 626 sub problems to find dead transitions.
[2024-06-02 00:03:35] [INFO ] Flow matrix only has 102 transitions (discarded 533 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-02 00:03:35] [INFO ] Computed 100 invariants in 3 ms
[2024-06-02 00:03:35] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 395 constraints, problems are : Problem set: 0 solved, 626 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 626/1021 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1021 constraints, problems are : Problem set: 0 solved, 626 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 0/0 constraints]
After SMT, in 40215ms problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 40226ms
[2024-06-02 00:04:16] [INFO ] Flow matrix only has 102 transitions (discarded 533 similar events)
[2024-06-02 00:04:16] [INFO ] Invariant cache hit.
[2024-06-02 00:04:16] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-06-02 00:04:16] [INFO ] Flow matrix only has 102 transitions (discarded 533 similar events)
[2024-06-02 00:04:16] [INFO ] Invariant cache hit.
[2024-06-02 00:04:16] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 00:04:16] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 626 sub problems to find dead transitions.
[2024-06-02 00:04:17] [INFO ] Flow matrix only has 102 transitions (discarded 533 similar events)
[2024-06-02 00:04:17] [INFO ] Invariant cache hit.
[2024-06-02 00:04:17] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 395 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 626/1021 constraints. Problems are: Problem set: 0 solved, 626 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1021 constraints, problems are : Problem set: 0 solved, 626 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 626/626 constraints, Known Traps: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 626 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 635/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101308 ms. Remains : 202/232 places, 635/1087 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-04 finished in 101537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 202 transition count 838
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 202 transition count 838
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 0 with 191 rules applied. Total rules applied 251 place count 202 transition count 647
Applied a total of 251 rules in 16 ms. Remains 202 /232 variables (removed 30) and now considering 647/1087 (removed 440) transitions.
Running 639 sub problems to find dead transitions.
[2024-06-02 00:05:17] [INFO ] Flow matrix only has 102 transitions (discarded 545 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-02 00:05:17] [INFO ] Computed 100 invariants in 2 ms
[2024-06-02 00:05:17] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 396 constraints, problems are : Problem set: 0 solved, 639 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 639/1035 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1035 constraints, problems are : Problem set: 0 solved, 639 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 0/0 constraints]
After SMT, in 40222ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 40235ms
[2024-06-02 00:05:57] [INFO ] Flow matrix only has 102 transitions (discarded 545 similar events)
[2024-06-02 00:05:57] [INFO ] Invariant cache hit.
[2024-06-02 00:05:58] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-02 00:05:58] [INFO ] Flow matrix only has 102 transitions (discarded 545 similar events)
[2024-06-02 00:05:58] [INFO ] Invariant cache hit.
[2024-06-02 00:05:58] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 00:05:58] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2024-06-02 00:05:59] [INFO ] Flow matrix only has 102 transitions (discarded 545 similar events)
[2024-06-02 00:05:59] [INFO ] Invariant cache hit.
[2024-06-02 00:05:59] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 396 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 639/1035 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1035 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 647/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101839 ms. Remains : 202/232 places, 647/1087 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 847 ms.
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Computed a total of 202 stabilizing places and 647 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 647
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-05 finished in 103571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((G(p2)||p1)))))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 202 transition count 840
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 202 transition count 840
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 197 rules applied. Total rules applied 257 place count 202 transition count 643
Applied a total of 257 rules in 8 ms. Remains 202 /232 variables (removed 30) and now considering 643/1087 (removed 444) transitions.
Running 634 sub problems to find dead transitions.
[2024-06-02 00:07:00] [INFO ] Flow matrix only has 102 transitions (discarded 541 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-02 00:07:00] [INFO ] Computed 100 invariants in 5 ms
[2024-06-02 00:07:00] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 395 constraints, problems are : Problem set: 0 solved, 634 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 634/1029 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1029 constraints, problems are : Problem set: 0 solved, 634 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 0/0 constraints]
After SMT, in 40154ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 40160ms
[2024-06-02 00:07:41] [INFO ] Flow matrix only has 102 transitions (discarded 541 similar events)
[2024-06-02 00:07:41] [INFO ] Invariant cache hit.
[2024-06-02 00:07:41] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-02 00:07:41] [INFO ] Flow matrix only has 102 transitions (discarded 541 similar events)
[2024-06-02 00:07:41] [INFO ] Invariant cache hit.
[2024-06-02 00:07:41] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 00:07:42] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2024-06-02 00:07:42] [INFO ] Flow matrix only has 102 transitions (discarded 541 similar events)
[2024-06-02 00:07:42] [INFO ] Invariant cache hit.
[2024-06-02 00:07:42] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 395 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 93/395 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 634/1029 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 634 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 1029 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 643/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101702 ms. Remains : 202/232 places, 643/1087 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-07
Entered a terminal (fully accepting) state of product in 283 steps with 5 reset in 4 ms.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-07 finished in 101972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 201 transition count 831
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 201 transition count 831
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 256 place count 201 transition count 637
Applied a total of 256 rules in 89 ms. Remains 201 /232 variables (removed 31) and now considering 637/1087 (removed 450) transitions.
Running 629 sub problems to find dead transitions.
[2024-06-02 00:08:43] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
// Phase 1: matrix 101 rows 201 cols
[2024-06-02 00:08:43] [INFO ] Computed 100 invariants in 1 ms
[2024-06-02 00:08:43] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 394 constraints, problems are : Problem set: 0 solved, 629 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 629/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 1023 constraints, problems are : Problem set: 0 solved, 629 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
After SMT, in 40210ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 40219ms
[2024-06-02 00:09:23] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
[2024-06-02 00:09:23] [INFO ] Invariant cache hit.
[2024-06-02 00:09:23] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-06-02 00:09:23] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
[2024-06-02 00:09:23] [INFO ] Invariant cache hit.
[2024-06-02 00:09:24] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 00:09:24] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-06-02 00:09:24] [INFO ] Redundant transitions in 12 ms returned []
Running 629 sub problems to find dead transitions.
[2024-06-02 00:09:24] [INFO ] Flow matrix only has 101 transitions (discarded 536 similar events)
[2024-06-02 00:09:24] [INFO ] Invariant cache hit.
[2024-06-02 00:09:24] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 394 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (OVERLAPS) 8/201 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (OVERLAPS) 101/302 variables, 201/301 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 629/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 1023 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 201/201 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 201/232 places, 637/1087 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101891 ms. Remains : 201/232 places, 637/1087 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-10
Product exploration explored 100000 steps with 2564 reset in 1261 ms.
Product exploration explored 100000 steps with 2509 reset in 1019 ms.
Computed a total of 201 stabilizing places and 637 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 637
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge 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 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-10 finished in 104630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X((p1&&X(G(!p1))))))))'
Support contains 7 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 203 transition count 850
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 203 transition count 850
Ensure Unique test removed 181 transitions
Reduce isomorphic transitions removed 181 transitions.
Iterating post reduction 0 with 181 rules applied. Total rules applied 239 place count 203 transition count 669
Applied a total of 239 rules in 11 ms. Remains 203 /232 variables (removed 29) and now considering 669/1087 (removed 418) transitions.
Running 661 sub problems to find dead transitions.
[2024-06-02 00:10:27] [INFO ] Flow matrix only has 103 transitions (discarded 566 similar events)
// Phase 1: matrix 103 rows 203 cols
[2024-06-02 00:10:27] [INFO ] Computed 100 invariants in 2 ms
[2024-06-02 00:10:27] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 661 unsolved
SMT process timed out in 20120ms, After SMT, problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 20127ms
[2024-06-02 00:10:47] [INFO ] Flow matrix only has 103 transitions (discarded 566 similar events)
[2024-06-02 00:10:47] [INFO ] Invariant cache hit.
[2024-06-02 00:10:48] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-02 00:10:48] [INFO ] Flow matrix only has 103 transitions (discarded 566 similar events)
[2024-06-02 00:10:48] [INFO ] Invariant cache hit.
[2024-06-02 00:10:48] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 00:10:49] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Running 661 sub problems to find dead transitions.
[2024-06-02 00:10:49] [INFO ] Flow matrix only has 103 transitions (discarded 566 similar events)
[2024-06-02 00:10:49] [INFO ] Invariant cache hit.
[2024-06-02 00:10:49] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 398 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 661/1059 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 661 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 1059 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 203/232 places, 669/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81652 ms. Remains : 203/232 places, 669/1087 transitions.
Stuttering acceptance computed with spot in 384 ms :[true, true, true, p1, true, true]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-11 finished in 82057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&F((p1||X(p2))))))'
Support contains 7 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 203 transition count 846
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 203 transition count 846
Ensure Unique test removed 187 transitions
Reduce isomorphic transitions removed 187 transitions.
Iterating post reduction 0 with 187 rules applied. Total rules applied 245 place count 203 transition count 659
Applied a total of 245 rules in 14 ms. Remains 203 /232 variables (removed 29) and now considering 659/1087 (removed 428) transitions.
Running 650 sub problems to find dead transitions.
[2024-06-02 00:11:49] [INFO ] Flow matrix only has 103 transitions (discarded 556 similar events)
// Phase 1: matrix 103 rows 203 cols
[2024-06-02 00:11:49] [INFO ] Computed 100 invariants in 1 ms
[2024-06-02 00:11:49] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 20190ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 20201ms
[2024-06-02 00:12:09] [INFO ] Flow matrix only has 103 transitions (discarded 556 similar events)
[2024-06-02 00:12:09] [INFO ] Invariant cache hit.
[2024-06-02 00:12:10] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-02 00:12:10] [INFO ] Flow matrix only has 103 transitions (discarded 556 similar events)
[2024-06-02 00:12:10] [INFO ] Invariant cache hit.
[2024-06-02 00:12:10] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 00:12:11] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-02 00:12:11] [INFO ] Flow matrix only has 103 transitions (discarded 556 similar events)
[2024-06-02 00:12:11] [INFO ] Invariant cache hit.
[2024-06-02 00:12:11] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 94/397 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 397 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 94/397 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 650/1047 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 1047 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 203/232 places, 659/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81775 ms. Remains : 203/232 places, 659/1087 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-12
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-12 finished in 82103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 202 transition count 835
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 202 transition count 835
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Iterating post reduction 0 with 190 rules applied. Total rules applied 250 place count 202 transition count 645
Applied a total of 250 rules in 13 ms. Remains 202 /232 variables (removed 30) and now considering 645/1087 (removed 442) transitions.
Running 637 sub problems to find dead transitions.
[2024-06-02 00:13:11] [INFO ] Flow matrix only has 102 transitions (discarded 543 similar events)
// Phase 1: matrix 102 rows 202 cols
[2024-06-02 00:13:11] [INFO ] Computed 100 invariants in 2 ms
[2024-06-02 00:13:11] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 637 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 396 constraints, problems are : Problem set: 0 solved, 637 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 637/637 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 637 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 637/1033 constraints. Problems are: Problem set: 0 solved, 637 unsolved
(s121 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(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 0)
(s30 0)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 1)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 1)
(s88 1)
(s89 0)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1033 constraints, problems are : Problem set: 0 solved, 637 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 637/637 constraints, Known Traps: 0/0 constraints]
After SMT, in 40241ms problems are : Problem set: 0 solved, 637 unsolved
Search for dead transitions found 0 dead transitions in 40251ms
[2024-06-02 00:13:51] [INFO ] Flow matrix only has 102 transitions (discarded 543 similar events)
[2024-06-02 00:13:51] [INFO ] Invariant cache hit.
[2024-06-02 00:13:52] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-02 00:13:52] [INFO ] Flow matrix only has 102 transitions (discarded 543 similar events)
[2024-06-02 00:13:52] [INFO ] Invariant cache hit.
[2024-06-02 00:13:52] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 00:13:53] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
Running 637 sub problems to find dead transitions.
[2024-06-02 00:13:53] [INFO ] Flow matrix only has 102 transitions (discarded 543 similar events)
[2024-06-02 00:13:53] [INFO ] Invariant cache hit.
[2024-06-02 00:13:53] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 637 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 396 constraints, problems are : Problem set: 0 solved, 637 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 637/637 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 637 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 2 (OVERLAPS) 8/202 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 4 (OVERLAPS) 102/304 variables, 202/302 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 94/396 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 637/1033 constraints. Problems are: Problem set: 0 solved, 637 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 637 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 1033 constraints, problems are : Problem set: 0 solved, 637 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 202/202 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 637/637 constraints, Known Traps: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 637 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 202/232 places, 645/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101889 ms. Remains : 202/232 places, 645/1087 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-14
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-14 finished in 102092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&X(F(p2))))))'
Support contains 7 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 1087/1087 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 203 transition count 845
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 203 transition count 845
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Iterating post reduction 0 with 188 rules applied. Total rules applied 246 place count 203 transition count 657
Applied a total of 246 rules in 12 ms. Remains 203 /232 variables (removed 29) and now considering 657/1087 (removed 430) transitions.
Running 649 sub problems to find dead transitions.
[2024-06-02 00:14:53] [INFO ] Flow matrix only has 103 transitions (discarded 554 similar events)
// Phase 1: matrix 103 rows 203 cols
[2024-06-02 00:14:53] [INFO ] Computed 100 invariants in 1 ms
[2024-06-02 00:14:53] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 649 unsolved
SMT process timed out in 20184ms, After SMT, problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 20195ms
[2024-06-02 00:15:14] [INFO ] Flow matrix only has 103 transitions (discarded 554 similar events)
[2024-06-02 00:15:14] [INFO ] Invariant cache hit.
[2024-06-02 00:15:14] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-02 00:15:14] [INFO ] Flow matrix only has 103 transitions (discarded 554 similar events)
[2024-06-02 00:15:14] [INFO ] Invariant cache hit.
[2024-06-02 00:15:14] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 00:15:15] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Running 649 sub problems to find dead transitions.
[2024-06-02 00:15:15] [INFO ] Flow matrix only has 103 transitions (discarded 554 similar events)
[2024-06-02 00:15:15] [INFO ] Invariant cache hit.
[2024-06-02 00:15:15] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/306 variables, and 398 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 103/306 variables, 203/303 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 95/398 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 649/1047 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 1047 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 203/203 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 203/232 places, 657/1087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81752 ms. Remains : 203/232 places, 657/1087 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PhaseVariation-PT-D10CS010-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 697 ms.
Product exploration explored 100000 steps with 33333 reset in 739 ms.
Computed a total of 203 stabilizing places and 657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 203 transition count 657
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G p2)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 22 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS010-LTLFireability-15 finished in 83728 ms.
All properties solved by simple procedures.
Total runtime 1104654 ms.
ITS solved all properties within timeout

BK_STOP 1717287377922

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="PhaseVariation-PT-D10CS010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PhaseVariation-PT-D10CS010, 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 r512-smll-171654407400332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D10CS010.tgz
mv PhaseVariation-PT-D10CS010 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;