Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748866910091

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 12:21:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:21:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:21:53] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2025-06-02 12:21:53] [INFO ] Transformed 173 places.
[2025-06-02 12:21:53] [INFO ] Transformed 159 transitions.
[2025-06-02 12:21:53] [INFO ] Found NUPN structural information;
[2025-06-02 12:21:53] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 494 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-13-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 14 place count 159 transition count 150
Iterating global reduction 1 with 9 rules applied. Total rules applied 23 place count 159 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 158 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 158 transition count 149
Applied a total of 25 rules in 109 ms. Remains 158 /173 variables (removed 15) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 158 cols
[2025-06-02 12:21:53] [INFO ] Computed 16 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:54] [INFO ] Implicit Places using invariants in 545 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 627 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/173 places, 149/159 transitions.
Applied a total of 0 rules in 17 ms. Remains 157 /157 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 783 ms. Remains : 157/173 places, 149/159 transitions.
Support contains 35 out of 157 places after structural reductions.
[2025-06-02 12:21:54] [INFO ] Flatten gal took : 73 ms
[2025-06-02 12:21:54] [INFO ] Flatten gal took : 33 ms
[2025-06-02 12:21:55] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 40000 steps (1160 resets) in 2579 ms. (15 steps per ms) remains 4/32 properties
BEST_FIRST walk for 40004 steps (279 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (284 resets) in 177 ms. (224 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (293 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
// Phase 1: matrix 149 rows 157 cols
[2025-06-02 12:21:56] [INFO ] Computed 15 invariants in 12 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:56] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 6 (OVERLAPS) 57/157 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:56] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 8 ms to minimize.
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 157/306 variables, and 17 constraints, problems are : Problem set: 2 solved, 0 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 693ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA MedleyA-PT-13-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 12 stabilizing places and 12 stable transitions
FORMULA MedleyA-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||((p1||X(X(!p2))) U (G((p1||X(X(!p2))))||(!p2&&(p1||X(X(!p2)))))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 144 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 133
Applied a total of 32 rules in 40 ms. Remains 141 /157 variables (removed 16) and now considering 133/149 (removed 16) transitions.
// Phase 1: matrix 133 rows 141 cols
[2025-06-02 12:21:57] [INFO ] Computed 15 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:57] [INFO ] Implicit Places using invariants in 196 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 198 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/157 places, 133/149 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 140/157 places, 133/149 transitions.
Stuttering acceptance computed with spot in 688 ms :[(AND (NOT p1) p2 (NOT p0)), (AND p2 (NOT p0)), false, p2, (AND (NOT p0) p2), true, (AND p2 p0), (AND p2 p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-01
Product exploration explored 100000 steps with 6991 reset in 507 ms.
Product exploration explored 100000 steps with 7247 reset in 339 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/140 stabilizing places and 9/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 382 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p1) p2 (NOT p0)), (AND p2 (NOT p0)), false, p2, (AND (NOT p0) p2), true, (AND p2 p0), (AND p2 p0 (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (1159 resets) in 265 ms. (150 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (290 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (281 resets) in 113 ms. (350 steps per ms) remains 2/3 properties
// Phase 1: matrix 133 rows 140 cols
[2025-06-02 12:22:00] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/36 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/90 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/140 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:00] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 133/273 variables, 140/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 155 constraints, problems are : Problem set: 1 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/90 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/140 variables, 5/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 133/273 variables, 140/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 156 constraints, problems are : Problem set: 1 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 788ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 10 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) p0))), (F p2), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 684 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2025-06-02 12:22:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:22:02] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 12:22:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:22:03] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:22:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:06] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:06] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:07] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:09] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:11] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 160 constraints, problems are : Problem set: 0 solved, 132 unsolved in 14174 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/292 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:20] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:21] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:23] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:23] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:27] [INFO ] Deduced a trap along path composed of 9 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:27] [INFO ] Deduced a trap along path composed of 8 places in 109 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:27] [INFO ] Deduced a trap along path composed of 13 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:37] [INFO ] Deduced a trap along path composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 44263ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 44270ms
Finished structural reductions in LTL mode , in 1 iterations and 44707 ms. Remains : 140/140 places, 133/133 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/140 stabilizing places and 9/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 189 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
RANDOM walk for 40000 steps (1136 resets) in 238 ms. (167 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (282 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2025-06-02 12:22:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/90 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:48] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/140 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 133/273 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/90 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/140 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 133/273 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 8 factoid took 490 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
Product exploration explored 100000 steps with 7120 reset in 109 ms.
Product exploration explored 100000 steps with 7106 reset in 211 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2 p0), p2, (AND (NOT p0) p2), true, (AND p2 p0), (NOT p0)]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 140 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 140 transition count 132
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 27 place count 140 transition count 138
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 52 place count 140 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 129 transition count 127
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 129 transition count 127
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 99 place count 129 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 107 place count 121 transition count 120
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 115 place count 121 transition count 120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 121 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 130 place count 115 transition count 170
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 136 place count 115 transition count 170
Deduced a syphon composed of 60 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 115 transition count 168
Deduced a syphon composed of 60 places in 1 ms
Applied a total of 138 rules in 70 ms. Remains 115 /140 variables (removed 25) and now considering 168/133 (removed -35) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:22:50] [INFO ] Redundant transitions in 8 ms returned []
Running 166 sub problems to find dead transitions.
// Phase 1: matrix 168 rows 115 cols
[2025-06-02 12:22:50] [INFO ] Computed 14 invariants in 3 ms
[2025-06-02 12:22:50] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:53] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 12 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 12 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:54] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 8 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:55] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 9 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:55] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 7 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 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 TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 11/25 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/25 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 168/283 variables, 115/140 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 6/146 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/146 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/146 constraints. Problems are: Problem set: 102 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 146 constraints, problems are : Problem set: 102 solved, 64 unsolved in 8774 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 102 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 38/92 variables, 8/8 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 11/19 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 23/115 variables, 6/25 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/25 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 168/283 variables, 115/140 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 6/146 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 64/210 constraints. Problems are: Problem set: 102 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:02] [INFO ] Deduced a trap along path composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:02] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 2/212 constraints. Problems are: Problem set: 102 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:06] [INFO ] Deduced a trap along path composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 1/213 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/213 constraints. Problems are: Problem set: 102 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/213 constraints. Problems are: Problem set: 102 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 213 constraints, problems are : Problem set: 102 solved, 64 unsolved in 15594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 64/166 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24428ms problems are : Problem set: 102 solved, 64 unsolved
Search for dead transitions found 102 dead transitions in 24431ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) removed 102 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/140 places, 66/133 transitions.
Graph (complete) has 173 edges and 115 vertex of which 55 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.2 ms
Discarding 60 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 54 transition count 69
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 54 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 54 transition count 84
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 14 ms. Remains 54 /115 variables (removed 61) and now considering 84/66 (removed -18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/140 places, 84/133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24536 ms. Remains : 54/140 places, 84/133 transitions.
Built C files in :
/tmp/ltsmin2853800898325390933
[2025-06-02 12:23:15] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2853800898325390933
Running compilation step : cd /tmp/ltsmin2853800898325390933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin2853800898325390933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin2853800898325390933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6860866475960350337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 140 cols
[2025-06-02 12:23:30] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:23:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 12:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:23:30] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:32] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:33] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:33] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:33] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:35] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:36] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 160 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11882 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/292 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:46] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:46] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:49] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:49] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:53] [INFO ] Deduced a trap along path composed of 9 places in 105 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:53] [INFO ] Deduced a trap along path composed of 8 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:53] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:01] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 41915ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 41918ms
Finished structural reductions in LTL mode , in 1 iterations and 42231 ms. Remains : 140/140 places, 133/133 transitions.
Built C files in :
/tmp/ltsmin13499371949973309031
[2025-06-02 12:24:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13499371949973309031
Running compilation step : cd /tmp/ltsmin13499371949973309031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin13499371949973309031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13499371949973309031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15042364950717858975.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 12:24:27] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:24:27] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:24:27] [INFO ] Time to serialize gal into /tmp/LTL9040976213911685096.gal : 4 ms
[2025-06-02 12:24:27] [INFO ] Time to serialize properties into /tmp/LTL18144208259190936651.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9040976213911685096.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16531015641367619338.hoa' '-atoms' '/tmp/LTL18144208259190936651.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18144208259190936651.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16531015641367619338.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t21, t38, t40, t48, t53, t59, t62, t65, t68, t70, t72, t86, t89, t100, Intersection...242
Computing Next relation with stutter on 168 deadlock states
329 unique states visited
0 strongly connected components in search stack
443 transitions explored
113 items max in DFS search stack
222 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.26757,69216,1,0,677,200760,297,569,3951,230827,2695
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-13-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-13-LTLFireability-01 finished in 153197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 144 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 133
Applied a total of 32 rules in 16 ms. Remains 141 /157 variables (removed 16) and now considering 133/149 (removed 16) transitions.
// Phase 1: matrix 133 rows 141 cols
[2025-06-02 12:24:30] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:30] [INFO ] Implicit Places using invariants in 109 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/157 places, 133/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 140/157 places, 133/149 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-02
Entered a terminal (fully accepting) state of product in 278 steps with 8 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-02 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1||X(p2))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 143 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 140 transition count 132
Applied a total of 34 rules in 14 ms. Remains 140 /157 variables (removed 17) and now considering 132/149 (removed 17) transitions.
// Phase 1: matrix 132 rows 140 cols
[2025-06-02 12:24:30] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:30] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 12:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:31] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:34] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:34] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/272 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 158 constraints, problems are : Problem set: 0 solved, 131 unsolved in 12204 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/272 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 131/289 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:47] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:47] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:47] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:49] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:49] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:52] [INFO ] Deduced a trap along path composed of 11 places in 98 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:53] [INFO ] Deduced a trap along path composed of 3 places in 109 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:53] [INFO ] Deduced a trap along path composed of 14 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:54] [INFO ] Deduced a trap along path composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42229ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 42230ms
Starting structural reductions in LTL mode, iteration 1 : 140/157 places, 132/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42598 ms. Remains : 140/157 places, 132/149 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-03
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-03 finished in 42828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 156 transition count 118
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 32 rules applied. Total rules applied 62 place count 126 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 125 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 123 transition count 114
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 67 place count 123 transition count 89
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 117 place count 98 transition count 89
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 120 place count 96 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 95 transition count 88
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 128 place count 88 transition count 81
Iterating global reduction 6 with 7 rules applied. Total rules applied 135 place count 88 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 135 place count 88 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 141 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 84 transition count 77
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 83 transition count 76
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 82 transition count 75
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 82 transition count 75
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 195 place count 58 transition count 51
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 211 place count 50 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 212 place count 50 transition count 70
Applied a total of 212 rules in 36 ms. Remains 50 /157 variables (removed 107) and now considering 70/149 (removed 79) transitions.
// Phase 1: matrix 70 rows 50 cols
[2025-06-02 12:25:13] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:13] [INFO ] Implicit Places using invariants in 66 ms returned [0, 9, 13, 20, 24, 27]
[2025-06-02 12:25:13] [INFO ] Actually due to overlaps returned [13, 24, 0, 9, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 68 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/157 places, 70/149 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 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 44 transition count 63
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 38 transition count 63
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 2 with 2 rules applied. Total rules applied 16 place count 37 transition count 62
Applied a total of 16 rules in 12 ms. Remains 37 /45 variables (removed 8) and now considering 62/70 (removed 8) transitions.
// Phase 1: matrix 62 rows 37 cols
[2025-06-02 12:25:13] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:13] [INFO ] Implicit Places using invariants in 86 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/157 places, 62/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 61
Applied a total of 2 rules in 7 ms. Remains 35 /36 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 35 cols
[2025-06-02 12:25:13] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:13] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 12:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 12:25:14] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/157 places, 61/149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 416 ms. Remains : 35/157 places, 61/149 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-04 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0)) U (p1 U !p0))) U X(p1)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 144 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 133
Applied a total of 32 rules in 21 ms. Remains 141 /157 variables (removed 16) and now considering 133/149 (removed 16) transitions.
// Phase 1: matrix 133 rows 141 cols
[2025-06-02 12:25:14] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:14] [INFO ] Implicit Places using invariants in 166 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/157 places, 133/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 140/157 places, 133/149 transitions.
Stuttering acceptance computed with spot in 449 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), false, (NOT p0), p0, p0, (NOT p0), true]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-05
Product exploration explored 100000 steps with 22673 reset in 150 ms.
Product exploration explored 100000 steps with 22730 reset in 277 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/140 stabilizing places and 10/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
RANDOM walk for 2032 steps (53 resets) in 12 ms. (156 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 466 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
// Phase 1: matrix 133 rows 140 cols
[2025-06-02 12:25:17] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 12:25:17] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 12:25:17] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 22 ms returned sat
[2025-06-02 12:25:17] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2025-06-02 12:25:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 12:25:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 12:25:18] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 9 ms returned sat
[2025-06-02 12:25:18] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
[2025-06-02 12:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-02 12:25:18] [INFO ] Computed and/alt/rep : 132/195/132 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-02 12:25:19] [INFO ] Added : 116 causal constraints over 24 iterations in 764 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2025-06-02 12:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 12:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:19] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:22] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:22] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:22] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:22] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 158 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11730 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:32] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 132/291 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:35] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:36] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:36] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:36] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:40] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:42] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:46] [INFO ] Deduced a trap along path composed of 10 places in 99 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:46] [INFO ] Deduced a trap along path composed of 8 places in 77 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:46] [INFO ] Deduced a trap along path composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41762ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 41763ms
Finished structural reductions in LTL mode , in 1 iterations and 42140 ms. Remains : 140/140 places, 133/133 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/140 stabilizing places and 10/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
RANDOM walk for 2337 steps (63 resets) in 7 ms. (292 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 462 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
Stuttering acceptance computed with spot in 386 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
[2025-06-02 12:26:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 12:26:03] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-06-02 12:26:03] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 9 ms returned sat
[2025-06-02 12:26:03] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-06-02 12:26:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 12:26:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-06-02 12:26:03] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 7 ms returned sat
[2025-06-02 12:26:03] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:04] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
[2025-06-02 12:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-02 12:26:04] [INFO ] Computed and/alt/rep : 132/195/132 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-02 12:26:04] [INFO ] Added : 124 causal constraints over 25 iterations in 811 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
Product exploration explored 100000 steps with 17182 reset in 178 ms.
Product exploration explored 100000 steps with 17138 reset in 186 ms.
Applying partial POR strategy [false, false, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 369 ms :[(NOT p1), (NOT p1), false, (NOT p0), p0, p0, (NOT p0), true]
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 140 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 140 transition count 132
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28 place count 140 transition count 138
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 52 place count 140 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 129 transition count 127
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 129 transition count 127
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 101 place count 129 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 109 place count 121 transition count 120
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 117 place count 121 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 125 place count 121 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 116 transition count 165
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 116 transition count 165
Deduced a syphon composed of 62 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 116 transition count 163
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 137 rules in 47 ms. Remains 116 /140 variables (removed 24) and now considering 163/133 (removed -30) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:26:06] [INFO ] Redundant transitions in 10 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 163 rows 116 cols
[2025-06-02 12:26:06] [INFO ] Computed 14 invariants in 1 ms
[2025-06-02 12:26:06] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:09] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:09] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:09] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 9 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 10 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 9 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 7 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:10] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 8 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:11] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 8 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:11] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 5 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 13/27 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 163/279 variables, 116/143 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 6/149 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/149 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/149 constraints. Problems are: Problem set: 103 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 149 constraints, problems are : Problem set: 103 solved, 56 unsolved in 8245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 103 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 38/91 variables, 8/8 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 13/21 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 25/116 variables, 6/27 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/27 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 163/279 variables, 116/143 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 6/149 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 56/205 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/205 constraints. Problems are: Problem set: 103 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:21] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/279 variables, 1/206 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/206 constraints. Problems are: Problem set: 103 solved, 56 unsolved
At refinement iteration 12 (OVERLAPS) 0/279 variables, 0/206 constraints. Problems are: Problem set: 103 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 206 constraints, problems are : Problem set: 103 solved, 56 unsolved in 17421 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 56/159 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25712ms problems are : Problem set: 103 solved, 56 unsolved
Search for dead transitions found 103 dead transitions in 25715ms
Found 103 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 103 transitions
Dead transitions reduction (with SMT) removed 103 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 116/140 places, 60/133 transitions.
Graph (complete) has 162 edges and 116 vertex of which 54 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.1 ms
Discarding 62 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 53 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 53 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 14 ms. Remains 53 /116 variables (removed 63) and now considering 77/60 (removed -17) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/140 places, 77/133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25799 ms. Remains : 53/140 places, 77/133 transitions.
Built C files in :
/tmp/ltsmin17260754711943722245
[2025-06-02 12:26:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17260754711943722245
Running compilation step : cd /tmp/ltsmin17260754711943722245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin17260754711943722245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin17260754711943722245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6585843693828989468.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA MedleyA-PT-13-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-05 finished in 78600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 148 transition count 140
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 148 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 145 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 145 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 144 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Applied a total of 30 rules in 26 ms. Remains 142 /157 variables (removed 15) and now considering 134/149 (removed 15) transitions.
// Phase 1: matrix 134 rows 142 cols
[2025-06-02 12:26:32] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:33] [INFO ] Implicit Places using invariants in 145 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/157 places, 134/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 141/157 places, 134/149 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-06
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-06 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 156 transition count 119
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 31 rules applied. Total rules applied 60 place count 127 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 126 transition count 117
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 61 place count 126 transition count 90
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 116 place count 98 transition count 90
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 118 place count 97 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 96 transition count 89
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 127 place count 88 transition count 81
Iterating global reduction 5 with 8 rules applied. Total rules applied 135 place count 88 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 135 place count 88 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 143 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 83 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 81 transition count 74
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 195 place count 58 transition count 51
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 209 place count 51 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 51 transition count 62
Applied a total of 210 rules in 43 ms. Remains 51 /157 variables (removed 106) and now considering 62/149 (removed 87) transitions.
// Phase 1: matrix 62 rows 51 cols
[2025-06-02 12:26:33] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:33] [INFO ] Implicit Places using invariants in 109 ms returned [0, 11, 13, 20, 24, 27]
[2025-06-02 12:26:33] [INFO ] Actually due to overlaps returned [13, 24, 0, 11, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 113 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/157 places, 62/149 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 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 61
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 45 transition count 55
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 39 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 38 transition count 55
Applied a total of 16 rules in 6 ms. Remains 38 /46 variables (removed 8) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 38 cols
[2025-06-02 12:26:33] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:33] [INFO ] Implicit Places using invariants in 63 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/157 places, 55/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 57
Applied a total of 2 rules in 3 ms. Remains 36 /37 variables (removed 1) and now considering 57/55 (removed -2) transitions.
// Phase 1: matrix 57 rows 36 cols
[2025-06-02 12:26:33] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:33] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 12:26:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 12:26:33] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 36/157 places, 57/149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 399 ms. Remains : 36/157 places, 57/149 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-10 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 156 transition count 117
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 33 rules applied. Total rules applied 64 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 124 transition count 115
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 65 place count 124 transition count 88
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 120 place count 96 transition count 88
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 122 place count 95 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 94 transition count 87
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 130 place count 87 transition count 80
Iterating global reduction 5 with 7 rules applied. Total rules applied 137 place count 87 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 137 place count 87 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 84 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 83 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 82 transition count 75
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 193 place count 59 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 209 place count 51 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 51 transition count 63
Applied a total of 210 rules in 33 ms. Remains 51 /157 variables (removed 106) and now considering 63/149 (removed 86) transitions.
// Phase 1: matrix 63 rows 51 cols
[2025-06-02 12:26:33] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:33] [INFO ] Implicit Places using invariants in 72 ms returned [0, 9, 11, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 73 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/157 places, 63/149 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 47 transition count 58
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 42 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 41 transition count 57
Applied a total of 12 rules in 7 ms. Remains 41 /47 variables (removed 6) and now considering 57/63 (removed 6) transitions.
// Phase 1: matrix 57 rows 41 cols
[2025-06-02 12:26:33] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:34] [INFO ] Implicit Places using invariants in 60 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/157 places, 57/149 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 180 ms. Remains : 40/157 places, 57/149 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-11
Product exploration explored 100000 steps with 12268 reset in 266 ms.
Product exploration explored 100000 steps with 12253 reset in 533 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Detected a total of 3/40 stabilizing places and 8/57 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 1115 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (4935 resets) in 312 ms. (127 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (1016 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (985 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
// Phase 1: matrix 57 rows 40 cols
[2025-06-02 12:26:36] [INFO ] Computed 8 invariants in 0 ms
[2025-06-02 12:26:36] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/40 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 57/97 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 52 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/16 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/27 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/40 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:36] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 5 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Int declared 40/97 variables, and 10 constraints, problems are : Problem set: 2 solved, 0 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/40 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p0) p1)), (G (AND (OR p2 p0) (OR p2 p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 1637 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 57/57 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2025-06-02 12:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 12:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 12:26:38] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:26:38] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-02 12:26:38] [INFO ] Invariant cache hit.
[2025-06-02 12:26:38] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:39] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 57/97 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 54 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 57/97 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:26:42] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 107 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3882 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5839ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5839ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6028 ms. Remains : 40/40 places, 57/57 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 7374 steps (903 resets) in 18 ms. (388 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12271 reset in 188 ms.
Product exploration explored 100000 steps with 12283 reset in 209 ms.
Built C files in :
/tmp/ltsmin4445874727403642701
[2025-06-02 12:26:45] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2025-06-02 12:26:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:26:45] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2025-06-02 12:26:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:26:45] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2025-06-02 12:26:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:26:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4445874727403642701
Running compilation step : cd /tmp/ltsmin4445874727403642701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 313 ms.
Running link step : cd /tmp/ltsmin4445874727403642701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4445874727403642701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9482790010179361477.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA MedleyA-PT-13-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-11 finished in 11978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 141
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 147 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 147 transition count 139
Applied a total of 20 rules in 7 ms. Remains 147 /157 variables (removed 10) and now considering 139/149 (removed 10) transitions.
// Phase 1: matrix 139 rows 147 cols
[2025-06-02 12:26:45] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:45] [INFO ] Implicit Places using invariants in 150 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/157 places, 139/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 146/157 places, 139/149 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-13-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-12 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1&&F(p2)))))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 143 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 140 transition count 132
Applied a total of 34 rules in 16 ms. Remains 140 /157 variables (removed 17) and now considering 132/149 (removed 17) transitions.
// Phase 1: matrix 132 rows 140 cols
[2025-06-02 12:26:46] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:46] [INFO ] Implicit Places using invariants in 134 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/157 places, 132/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 139/157 places, 132/149 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-14
Product exploration explored 100000 steps with 2897 reset in 245 ms.
Product exploration explored 100000 steps with 2894 reset in 266 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (1131 resets) in 72 ms. (547 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (289 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
// Phase 1: matrix 132 rows 139 cols
[2025-06-02 12:26:47] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/88 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/139 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 33/271 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/9 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 138 transition count 102
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 31 rules applied. Total rules applied 60 place count 109 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 108 transition count 100
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 61 place count 108 transition count 73
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 116 place count 80 transition count 73
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 118 place count 79 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 78 transition count 72
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 165 place count 55 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 181 place count 47 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 47 transition count 64
Applied a total of 182 rules in 19 ms. Remains 47 /139 variables (removed 92) and now considering 64/132 (removed 68) transitions.
// Phase 1: matrix 64 rows 47 cols
[2025-06-02 12:26:48] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:48] [INFO ] Implicit Places using invariants in 112 ms returned [0, 10, 17, 21, 24]
[2025-06-02 12:26:48] [INFO ] Actually due to overlaps returned [10, 21, 0, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 114 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/139 places, 64/132 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 43 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 38 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 37 transition count 59
Applied a total of 12 rules in 5 ms. Remains 37 /43 variables (removed 6) and now considering 59/64 (removed 5) transitions.
// Phase 1: matrix 59 rows 37 cols
[2025-06-02 12:26:48] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:48] [INFO ] Implicit Places using invariants in 79 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/139 places, 59/132 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 61
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 61/59 (removed -2) transitions.
// Phase 1: matrix 61 rows 35 cols
[2025-06-02 12:26:48] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 12:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 12:26:49] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/139 places, 61/132 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 425 ms. Remains : 35/139 places, 61/132 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 98 steps (15 resets) in 6 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2), (X p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F p0), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 18979 reset in 228 ms.
Product exploration explored 100000 steps with 18999 reset in 251 ms.
Built C files in :
/tmp/ltsmin4774111795624953066
[2025-06-02 12:26:50] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2025-06-02 12:26:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:26:50] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2025-06-02 12:26:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:26:50] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2025-06-02 12:26:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:26:50] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4774111795624953066
Running compilation step : cd /tmp/ltsmin4774111795624953066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin4774111795624953066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4774111795624953066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14648767086749706203.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA MedleyA-PT-13-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-14 finished in 4487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(F(G(p1)) U p2))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 149/149 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 146 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 143 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 140 transition count 132
Applied a total of 34 rules in 13 ms. Remains 140 /157 variables (removed 17) and now considering 132/149 (removed 17) transitions.
// Phase 1: matrix 132 rows 140 cols
[2025-06-02 12:26:51] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:26:51] [INFO ] Implicit Places using invariants in 136 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/157 places, 132/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 139/157 places, 132/149 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-15 finished in 385 ms.
All properties solved by simple procedures.
Total runtime 298724 ms.

BK_STOP 1748867211453

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-13, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524100196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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