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.r553-tall-171734900900107.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 CO4-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 174K Jun 2 16:33 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 CO4-PT-14-LTLCardinality-00
FORMULA_NAME CO4-PT-14-LTLCardinality-01
FORMULA_NAME CO4-PT-14-LTLCardinality-02
FORMULA_NAME CO4-PT-14-LTLCardinality-03
FORMULA_NAME CO4-PT-14-LTLCardinality-04
FORMULA_NAME CO4-PT-14-LTLCardinality-05
FORMULA_NAME CO4-PT-14-LTLCardinality-06
FORMULA_NAME CO4-PT-14-LTLCardinality-07
FORMULA_NAME CO4-PT-14-LTLCardinality-08
FORMULA_NAME CO4-PT-14-LTLCardinality-09
FORMULA_NAME CO4-PT-14-LTLCardinality-10
FORMULA_NAME CO4-PT-14-LTLCardinality-11
FORMULA_NAME CO4-PT-14-LTLCardinality-12
FORMULA_NAME CO4-PT-14-LTLCardinality-13
FORMULA_NAME CO4-PT-14-LTLCardinality-14
FORMULA_NAME CO4-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717351759175

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:20] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-02 18:09:20] [INFO ] Transformed 680 places.
[2024-06-02 18:09:20] [INFO ] Transformed 812 transitions.
[2024-06-02 18:09:20] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:20] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-14-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 129 place count 452 transition count 574
Iterating global reduction 1 with 117 rules applied. Total rules applied 246 place count 452 transition count 574
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 251 place count 452 transition count 569
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 311 place count 392 transition count 509
Iterating global reduction 2 with 60 rules applied. Total rules applied 371 place count 392 transition count 509
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 381 place count 382 transition count 498
Iterating global reduction 2 with 10 rules applied. Total rules applied 391 place count 382 transition count 498
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 393 place count 382 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 394 place count 381 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 395 place count 381 transition count 495
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 396 place count 380 transition count 494
Iterating global reduction 3 with 1 rules applied. Total rules applied 397 place count 380 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 398 place count 380 transition count 493
Applied a total of 398 rules in 145 ms. Remains 380 /580 variables (removed 200) and now considering 493/692 (removed 199) transitions.
// Phase 1: matrix 493 rows 380 cols
[2024-06-02 18:09:20] [INFO ] Computed 5 invariants in 20 ms
[2024-06-02 18:09:21] [INFO ] Implicit Places using invariants in 282 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 379/580 places, 493/692 transitions.
Applied a total of 0 rules in 12 ms. Remains 379 /379 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 483 ms. Remains : 379/580 places, 493/692 transitions.
Support contains 30 out of 379 places after structural reductions.
[2024-06-02 18:09:21] [INFO ] Flatten gal took : 63 ms
[2024-06-02 18:09:21] [INFO ] Flatten gal took : 41 ms
[2024-06-02 18:09:21] [INFO ] Input system was already deterministic with 493 transitions.
Support contains 27 out of 379 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (41 resets) in 1888 ms. (21 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40001 steps (155 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (36 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (167 resets) in 130 ms. (305 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (45 resets) in 200 ms. (199 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (117 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (104 resets) in 101 ms. (392 steps per ms) remains 4/6 properties
// Phase 1: matrix 493 rows 379 cols
[2024-06-02 18:09:22] [INFO ] Computed 4 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/33 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/158 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 356/514 variables, 138/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 13/527 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/539 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 281/820 variables, 171/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 49/869 variables, 33/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/872 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/872 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/872 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 383 constraints, problems are : Problem set: 0 solved, 4 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/33 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/158 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 356/514 variables, 138/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 13/527 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/539 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 281/820 variables, 171/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 49/869 variables, 33/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/872 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/872 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/872 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 387 constraints, problems are : Problem set: 0 solved, 4 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1422ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 2217 steps, including 45 resets, run visited all 2 properties in 18 ms. (steps per millisecond=123 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 201 ms.
FORMULA CO4-PT-14-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 640 edges and 379 vertex of which 376 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 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 p1)&&X(X(G(p0)))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 473
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 472
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 356 transition count 465
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 356 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 356 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 355 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 355 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 355 transition count 462
Applied a total of 51 rules in 24 ms. Remains 355 /379 variables (removed 24) and now considering 462/493 (removed 31) transitions.
// Phase 1: matrix 462 rows 355 cols
[2024-06-02 18:09:24] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:09:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:09:24] [INFO ] Invariant cache hit.
[2024-06-02 18:09:24] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 18:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/817 variables, 355/359 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 18:09:36] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 22 ms to minimize.
[2024-06-02 18:09:36] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 3 ms to minimize.
[2024-06-02 18:09:37] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 timeout
0.0)
(s272 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/817 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 362 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/817 variables, 355/362 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 461/823 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/817 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 823 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 3/3 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 355/379 places, 462/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 355/379 places, 462/493 transitions.
Stuttering acceptance computed with spot in 448 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-02
Product exploration explored 100000 steps with 33 reset in 186 ms.
Entered a terminal (fully accepting) state of product in 164 steps with 4 reset in 1 ms.
FORMULA CO4-PT-14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-02 finished in 61193 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(((p1 U p2)&&p0)))'
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 401 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 375 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 374 transition count 357
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 134 rules applied. Total rules applied 267 place count 243 transition count 354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 269 place count 241 transition count 354
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 269 place count 241 transition count 312
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 353 place count 199 transition count 312
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 360 place count 192 transition count 302
Iterating global reduction 3 with 7 rules applied. Total rules applied 367 place count 192 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 369 place count 192 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 369 place count 192 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 371 place count 191 transition count 299
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 373 place count 189 transition count 297
Iterating global reduction 4 with 2 rules applied. Total rules applied 375 place count 189 transition count 297
Performed 62 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 499 place count 127 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 505 place count 127 transition count 216
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 509 place count 123 transition count 212
Iterating global reduction 5 with 4 rules applied. Total rules applied 513 place count 123 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 515 place count 122 transition count 211
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 583 place count 88 transition count 215
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 603 place count 88 transition count 195
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 631 place count 60 transition count 139
Iterating global reduction 6 with 28 rules applied. Total rules applied 659 place count 60 transition count 139
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 676 place count 60 transition count 122
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 682 place count 54 transition count 105
Iterating global reduction 7 with 6 rules applied. Total rules applied 688 place count 54 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 690 place count 54 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 692 place count 53 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 703 place count 53 transition count 101
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 711 place count 53 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 713 place count 51 transition count 99
Applied a total of 713 rules in 95 ms. Remains 51 /379 variables (removed 328) and now considering 99/493 (removed 394) transitions.
[2024-06-02 18:10:25] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
// Phase 1: matrix 92 rows 51 cols
[2024-06-02 18:10:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:10:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 18:10:25] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
[2024-06-02 18:10:25] [INFO ] Invariant cache hit.
[2024-06-02 18:10:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:10:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-02 18:10:25] [INFO ] Redundant transitions in 2 ms returned []
Running 86 sub problems to find dead transitions.
[2024-06-02 18:10:25] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
[2024-06-02 18:10:25] [INFO ] Invariant cache hit.
[2024-06-02 18:10:25] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 91/142 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 58 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 91/142 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 86/143 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 144 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 2650ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 2652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/379 places, 99/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2876 ms. Remains : 51/379 places, 99/493 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-14-LTLCardinality-05
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-05 finished in 2977 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(p0)))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 473
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 472
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 357 transition count 466
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 357 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 357 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 356 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 356 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 356 transition count 463
Applied a total of 49 rules in 46 ms. Remains 356 /379 variables (removed 23) and now considering 463/493 (removed 30) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:10:28] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:10:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:10:28] [INFO ] Invariant cache hit.
[2024-06-02 18:10:28] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:10:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 4 ms to minimize.
[2024-06-02 18:10:40] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 356/379 places, 463/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60454 ms. Remains : 356/379 places, 463/493 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-07 finished in 60605 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)))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 411 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 375 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 374 transition count 351
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 237 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 236 transition count 349
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 279 place count 236 transition count 307
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 363 place count 194 transition count 307
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 371 place count 186 transition count 295
Iterating global reduction 3 with 8 rules applied. Total rules applied 379 place count 186 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 383 place count 186 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 384 place count 185 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 386 place count 184 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 387 place count 183 transition count 289
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 183 transition count 289
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 514 place count 120 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 520 place count 120 transition count 205
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 524 place count 116 transition count 201
Iterating global reduction 6 with 4 rules applied. Total rules applied 528 place count 116 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 529 place count 116 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 533 place count 114 transition count 198
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 601 place count 80 transition count 201
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 622 place count 80 transition count 180
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 650 place count 52 transition count 124
Iterating global reduction 8 with 28 rules applied. Total rules applied 678 place count 52 transition count 124
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 697 place count 52 transition count 105
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 704 place count 45 transition count 85
Iterating global reduction 9 with 7 rules applied. Total rules applied 711 place count 45 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 715 place count 45 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 719 place count 45 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 721 place count 43 transition count 75
Applied a total of 721 rules in 55 ms. Remains 43 /379 variables (removed 336) and now considering 75/493 (removed 418) transitions.
[2024-06-02 18:11:29] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
// Phase 1: matrix 70 rows 43 cols
[2024-06-02 18:11:29] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:11:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 18:11:29] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2024-06-02 18:11:29] [INFO ] Invariant cache hit.
[2024-06-02 18:11:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:11:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 18:11:29] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2024-06-02 18:11:29] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2024-06-02 18:11:29] [INFO ] Invariant cache hit.
[2024-06-02 18:11:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 69/112 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 49 constraints, problems are : Problem set: 0 solved, 62 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 69/112 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 62/110 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 111 constraints, problems are : Problem set: 0 solved, 62 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 1639ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 1640ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/379 places, 75/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1786 ms. Remains : 43/379 places, 75/493 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-08
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-08 finished in 1835 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(p0))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 473
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 472
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 357 transition count 466
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 357 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 357 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 356 transition count 464
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 356 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 356 transition count 463
Applied a total of 49 rules in 18 ms. Remains 356 /379 variables (removed 23) and now considering 463/493 (removed 30) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:11:31] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:11:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:11:31] [INFO ] Invariant cache hit.
[2024-06-02 18:11:31] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:11:42] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:11:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 29717 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 59802ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 59807ms
Starting structural reductions in LTL mode, iteration 1 : 356/379 places, 463/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60068 ms. Remains : 356/379 places, 463/493 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-14-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 502 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (117 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (230 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1918023 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :0 out of 1
Probabilistic random walk after 1918023 steps, saw 336479 distinct states, run finished after 3004 ms. (steps per millisecond=638 ) properties seen :0
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/149 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/158 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/173 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 383/556 variables, 169/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/556 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 230/786 variables, 142/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/786 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 28/814 variables, 19/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/814 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/819 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/819 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/819 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 127/149 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/158 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/173 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 383/556 variables, 169/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/556 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 230/786 variables, 142/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/786 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 28/814 variables, 19/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/814 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/819 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/819 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/819 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
[2024-06-02 18:12:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 18:12:36] [INFO ] Invariant cache hit.
[2024-06-02 18:12:36] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:12:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:12:48] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 3 ms to minimize.
[2024-06-02 18:12:48] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in LTL mode , in 1 iterations and 60370 ms. Remains : 356/356 places, 463/463 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (136 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (70 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1947135 steps, run timeout after 3001 ms. (steps per millisecond=648 ) properties seen :0 out of 1
Probabilistic random walk after 1947135 steps, saw 340451 distinct states, run finished after 3001 ms. (steps per millisecond=648 ) properties seen :0
[2024-06-02 18:13:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/149 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/158 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/173 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 383/556 variables, 169/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/556 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 230/786 variables, 142/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/786 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 28/814 variables, 19/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/814 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/819 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/819 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/819 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 127/149 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/158 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/173 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 383/556 variables, 169/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/556 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 230/786 variables, 142/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/786 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 28/814 variables, 19/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/814 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/819 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/819 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/819 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 361 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Graph (trivial) has 384 edges and 356 vertex of which 2 / 356 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 352 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 352 transition count 458
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 125 place count 352 transition count 501
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 170 place count 352 transition count 501
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 197 place count 325 transition count 474
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 224 place count 325 transition count 474
Performed 42 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 182 places in 1 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 266 place count 325 transition count 523
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 273 place count 325 transition count 516
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 294 place count 304 transition count 491
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 315 place count 304 transition count 491
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 317 place count 302 transition count 488
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 302 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 302 transition count 487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 321 place count 301 transition count 486
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 301 transition count 486
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 301 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 301 transition count 485
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 326 place count 299 transition count 483
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 299 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 329 place count 299 transition count 483
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 330 place count 298 transition count 482
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 298 transition count 482
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 385 place count 298 transition count 696
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 433 place count 298 transition count 648
Discarding 110 places :
Symmetric choice reduction at 6 with 110 rule applications. Total rules 543 place count 188 transition count 399
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 6 with 110 rules applied. Total rules applied 653 place count 188 transition count 399
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 687 place count 188 transition count 365
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 754 place count 121 transition count 246
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 821 place count 121 transition count 246
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 828 place count 121 transition count 239
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 840 place count 109 transition count 215
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 852 place count 109 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 853 place count 109 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 860 place count 109 transition count 233
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 863 place count 106 transition count 215
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 866 place count 106 transition count 215
Deduced a syphon composed of 59 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 879 place count 106 transition count 202
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 880 place count 105 transition count 201
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 881 place count 105 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 882 place count 105 transition count 222
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 883 place count 104 transition count 214
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 884 place count 104 transition count 214
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 884 rules in 121 ms. Remains 104 /356 variables (removed 252) and now considering 214/463 (removed 249) transitions.
[2024-06-02 18:13:41] [INFO ] Redundant transitions in 9 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 18:13:41] [INFO ] Flow matrix only has 207 transitions (discarded 7 similar events)
// Phase 1: matrix 207 rows 104 cols
[2024-06-02 18:13:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:13:41] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 18:13:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:13:42] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:13:42] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:13:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 201 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 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 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 TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 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 TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 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 TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 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 TDEAD120 is UNSAT
Problem TDEAD121 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 TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 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 TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 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 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
At refinement iteration 4 (OVERLAPS) 206/310 variables, 104/112 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 18/130 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/130 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/311 variables, 1/131 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/131 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/131 constraints. Problems are: Problem set: 137 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 131 constraints, problems are : Problem set: 137 solved, 76 unsolved in 3854 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 137 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 11/56 variables, 4/4 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 4/8 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 197/253 variables, 56/64 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 18/82 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 76/158 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/158 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 57/310 variables, 48/206 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/206 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/311 variables, 1/207 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/207 constraints. Problems are: Problem set: 137 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/207 constraints. Problems are: Problem set: 137 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 207 constraints, problems are : Problem set: 137 solved, 76 unsolved in 2982 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 76/213 constraints, Known Traps: 4/4 constraints]
After SMT, in 6885ms problems are : Problem set: 137 solved, 76 unsolved
Search for dead transitions found 137 dead transitions in 6889ms
Found 137 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 137 transitions
Dead transitions reduction (with SMT) removed 137 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/356 places, 77/463 transitions.
Graph (complete) has 153 edges and 104 vertex of which 46 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 46 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 8 ms. Remains 46 /104 variables (removed 58) and now considering 90/77 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/356 places, 90/463 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7038 ms. Remains : 46/356 places, 90/463 transitions.
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 7 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:13:48] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:13:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:13:48] [INFO ] Invariant cache hit.
[2024-06-02 18:13:48] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:13:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:13:59] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:14:00] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 29327 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 59404ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 59409ms
Finished structural reductions in LTL mode , in 1 iterations and 59667 ms. Remains : 356/356 places, 463/463 transitions.
Treatment of property CO4-PT-14-LTLCardinality-11 finished in 196961 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)))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 409 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 376 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 375 transition count 351
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 237 transition count 350
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 279 place count 237 transition count 308
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 363 place count 195 transition count 308
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 372 place count 186 transition count 296
Iterating global reduction 2 with 9 rules applied. Total rules applied 381 place count 186 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 385 place count 186 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 386 place count 185 transition count 292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 386 place count 185 transition count 290
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 390 place count 183 transition count 290
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 393 place count 180 transition count 287
Iterating global reduction 4 with 3 rules applied. Total rules applied 396 place count 180 transition count 287
Performed 64 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 524 place count 116 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 530 place count 116 transition count 201
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 534 place count 112 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 538 place count 112 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 539 place count 112 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 543 place count 110 transition count 194
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 605 place count 79 transition count 196
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 625 place count 79 transition count 176
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 653 place count 51 transition count 120
Iterating global reduction 7 with 28 rules applied. Total rules applied 681 place count 51 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 700 place count 51 transition count 101
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 707 place count 44 transition count 81
Iterating global reduction 8 with 7 rules applied. Total rules applied 714 place count 44 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 719 place count 44 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 721 place count 43 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 732 place count 43 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 734 place count 41 transition count 78
Applied a total of 734 rules in 31 ms. Remains 41 /379 variables (removed 338) and now considering 78/493 (removed 415) transitions.
[2024-06-02 18:14:47] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 41 cols
[2024-06-02 18:14:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:14:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:14:48] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-06-02 18:14:48] [INFO ] Invariant cache hit.
[2024-06-02 18:14:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:14:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-02 18:14:48] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-02 18:14:48] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2024-06-02 18:14:48] [INFO ] Invariant cache hit.
[2024-06-02 18:14:48] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 70/111 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/112 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 48 constraints, problems are : Problem set: 0 solved, 65 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 70/111 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 65/112 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 113 constraints, problems are : Problem set: 0 solved, 65 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1653ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1654ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/379 places, 78/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1777 ms. Remains : 41/379 places, 78/493 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-12
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-12 finished in 1830 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 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Graph (trivial) has 411 edges and 379 vertex of which 2 / 379 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 639 edges and 378 vertex of which 375 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 374 transition count 350
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 236 transition count 349
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 279 place count 236 transition count 307
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 363 place count 194 transition count 307
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 372 place count 185 transition count 295
Iterating global reduction 2 with 9 rules applied. Total rules applied 381 place count 185 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 384 place count 185 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 385 place count 184 transition count 292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 385 place count 184 transition count 290
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 389 place count 182 transition count 290
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 392 place count 179 transition count 287
Iterating global reduction 4 with 3 rules applied. Total rules applied 395 place count 179 transition count 287
Performed 63 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 521 place count 116 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 527 place count 116 transition count 202
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 531 place count 112 transition count 198
Iterating global reduction 5 with 4 rules applied. Total rules applied 535 place count 112 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 536 place count 112 transition count 197
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 540 place count 110 transition count 195
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 606 place count 77 transition count 197
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 627 place count 77 transition count 176
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 655 place count 49 transition count 120
Iterating global reduction 7 with 28 rules applied. Total rules applied 683 place count 49 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 702 place count 49 transition count 101
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 709 place count 42 transition count 81
Iterating global reduction 8 with 7 rules applied. Total rules applied 716 place count 42 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 721 place count 42 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 723 place count 41 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 735 place count 41 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 737 place count 39 transition count 79
Applied a total of 737 rules in 29 ms. Remains 39 /379 variables (removed 340) and now considering 79/493 (removed 414) transitions.
[2024-06-02 18:14:49] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 39 cols
[2024-06-02 18:14:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:14:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:14:49] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:49] [INFO ] Invariant cache hit.
[2024-06-02 18:14:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:14:49] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 18:14:49] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:14:49] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:49] [INFO ] Invariant cache hit.
[2024-06-02 18:14:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 68/107 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 46 constraints, problems are : Problem set: 0 solved, 66 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 68/107 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 66/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 112 constraints, problems are : Problem set: 0 solved, 66 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1899ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1900ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/379 places, 79/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2096 ms. Remains : 39/379 places, 79/493 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLCardinality-13
Product exploration explored 100000 steps with 12 reset in 68 ms.
Product exploration explored 100000 steps with 17 reset in 89 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 899 steps (95 resets) in 10 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-06-02 18:14:52] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:52] [INFO ] Invariant cache hit.
[2024-06-02 18:14:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:14:52] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:52] [INFO ] Invariant cache hit.
[2024-06-02 18:14:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:14:52] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-02 18:14:52] [INFO ] Redundant transitions in 0 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:14:52] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:52] [INFO ] Invariant cache hit.
[2024-06-02 18:14:52] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 68/107 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 46 constraints, problems are : Problem set: 0 solved, 66 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 68/107 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 66/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 112 constraints, problems are : Problem set: 0 solved, 66 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1723ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1724ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1816 ms. Remains : 39/39 places, 79/79 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1245 steps (132 resets) in 7 ms. (155 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 53 reset in 50 ms.
Product exploration explored 100000 steps with 1 reset in 84 ms.
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 79/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-06-02 18:14:55] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:55] [INFO ] Invariant cache hit.
[2024-06-02 18:14:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:14:55] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:55] [INFO ] Invariant cache hit.
[2024-06-02 18:14:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:14:55] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 18:14:55] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:14:55] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-06-02 18:14:55] [INFO ] Invariant cache hit.
[2024-06-02 18:14:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 68/107 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 46 constraints, problems are : Problem set: 0 solved, 66 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 68/107 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 66/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 112 constraints, problems are : Problem set: 0 solved, 66 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1696ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1697ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1786 ms. Remains : 39/39 places, 79/79 transitions.
Treatment of property CO4-PT-14-LTLCardinality-13 finished in 7417 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((X((p0 U p1))&&(G(p3)||p2))))'
Support contains 5 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 493/493 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 363 transition count 474
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 363 transition count 474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 363 transition count 473
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 358 transition count 468
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 358 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 358 transition count 467
Applied a total of 44 rules in 21 ms. Remains 358 /379 variables (removed 21) and now considering 467/493 (removed 26) transitions.
// Phase 1: matrix 467 rows 358 cols
[2024-06-02 18:14:57] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:14:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:14:57] [INFO ] Invariant cache hit.
[2024-06-02 18:14:57] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-02 18:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (OVERLAPS) 467/825 variables, 358/362 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-02 18:15:09] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:15:09] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 0/825 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 466 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 364 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 467/825 variables, 358/364 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 466/830 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/825 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 830 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 2/2 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 358/379 places, 467/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60398 ms. Remains : 358/379 places, 467/493 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : CO4-PT-14-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLCardinality-14 finished in 60673 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(p0))))'
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)))'
[2024-06-02 18:15:58] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:15:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-02 18:15:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 379 places, 493 transitions and 1127 arcs took 4 ms.
Total runtime 397818 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-14-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-14-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717352214890

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name CO4-PT-14-LTLCardinality-11
ltl formula formula --ltl=/tmp/1242/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 379 places, 493 transitions and 1127 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1242/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1242/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1242/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1242/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 381 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 380, there are 501 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15 states 21 transitions, fanout: 1.400
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 81.8 B/state, compr.: 5.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 505 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name CO4-PT-14-LTLCardinality-13
ltl formula formula --ltl=/tmp/1242/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 379 places, 493 transitions and 1127 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1242/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1242/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1242/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1242/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 381 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 380, there are 498 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~66 levels ~10000 states ~30724 transitions
pnml2lts-mc( 0/ 4): ~55 levels ~20000 states ~67800 transitions
pnml2lts-mc( 2/ 4): ~373 levels ~40000 states ~118196 transitions
pnml2lts-mc( 2/ 4): ~847 levels ~80000 states ~234452 transitions
pnml2lts-mc( 0/ 4): ~756 levels ~160000 states ~516964 transitions
pnml2lts-mc( 0/ 4): ~796 levels ~320000 states ~1035596 transitions
pnml2lts-mc( 0/ 4): ~2883 levels ~640000 states ~2089280 transitions
pnml2lts-mc( 0/ 4): ~7259 levels ~1280000 states ~4807768 transitions
pnml2lts-mc( 0/ 4): ~7259 levels ~2560000 states ~10902804 transitions
pnml2lts-mc( 0/ 4): ~7259 levels ~5120000 states ~23023880 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~268!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2583437
pnml2lts-mc( 0/ 4): unique states count: 6883767
pnml2lts-mc( 0/ 4): unique transitions count: 32350242
pnml2lts-mc( 0/ 4): - self-loop count: 12094
pnml2lts-mc( 0/ 4): - claim dead count: 17234836
pnml2lts-mc( 0/ 4): - claim found count: 8224353
pnml2lts-mc( 0/ 4): - claim success count: 6886776
pnml2lts-mc( 0/ 4): - cum. max stack depth: 27949
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6894594 states 32407014 transitions, fanout: 4.700
pnml2lts-mc( 0/ 4): Total exploration time 55.950 sec (55.940 sec minimum, 55.945 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123228, Transitions per second: 579214
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 55.9MB, 8.5 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 505 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 55.9MB (~256.0MB paged-in)

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="CO4-PT-14"
export BK_EXAMINATION="LTLCardinality"
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 CO4-PT-14, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734900900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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