Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 248K 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 CO4-PT-17-LTLFireability-00
FORMULA_NAME CO4-PT-17-LTLFireability-01
FORMULA_NAME CO4-PT-17-LTLFireability-02
FORMULA_NAME CO4-PT-17-LTLFireability-03
FORMULA_NAME CO4-PT-17-LTLFireability-04
FORMULA_NAME CO4-PT-17-LTLFireability-05
FORMULA_NAME CO4-PT-17-LTLFireability-06
FORMULA_NAME CO4-PT-17-LTLFireability-07
FORMULA_NAME CO4-PT-17-LTLFireability-08
FORMULA_NAME CO4-PT-17-LTLFireability-09
FORMULA_NAME CO4-PT-17-LTLFireability-10
FORMULA_NAME CO4-PT-17-LTLFireability-11
FORMULA_NAME CO4-PT-17-LTLFireability-12
FORMULA_NAME CO4-PT-17-LTLFireability-13
FORMULA_NAME CO4-PT-17-LTLFireability-14
FORMULA_NAME CO4-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748609054711

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:44:15] [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-05-30 12:44:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:44:16] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-05-30 12:44:16] [INFO ] Transformed 967 places.
[2025-05-30 12:44:16] [INFO ] Transformed 1150 transitions.
[2025-05-30 12:44:16] [INFO ] Found NUPN structural information;
[2025-05-30 12:44:16] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-17-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 181 place count 589 transition count 750
Iterating global reduction 1 with 161 rules applied. Total rules applied 342 place count 589 transition count 750
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 349 place count 589 transition count 743
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 429 place count 509 transition count 663
Iterating global reduction 2 with 80 rules applied. Total rules applied 509 place count 509 transition count 663
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 522 place count 496 transition count 648
Iterating global reduction 2 with 13 rules applied. Total rules applied 535 place count 496 transition count 648
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 538 place count 496 transition count 645
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 540 place count 494 transition count 643
Iterating global reduction 3 with 2 rules applied. Total rules applied 542 place count 494 transition count 643
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 543 place count 493 transition count 642
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 493 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 493 transition count 641
Applied a total of 545 rules in 210 ms. Remains 493 /769 variables (removed 276) and now considering 641/912 (removed 271) transitions.
// Phase 1: matrix 641 rows 493 cols
[2025-05-30 12:44:16] [INFO ] Computed 5 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:16] [INFO ] Implicit Places using invariants in 356 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 492/769 places, 641/912 transitions.
Applied a total of 0 rules in 9 ms. Remains 492 /492 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 492/769 places, 641/912 transitions.
Support contains 26 out of 492 places after structural reductions.
[2025-05-30 12:44:17] [INFO ] Flatten gal took : 55 ms
[2025-05-30 12:44:17] [INFO ] Flatten gal took : 40 ms
[2025-05-30 12:44:17] [INFO ] Input system was already deterministic with 641 transitions.
RANDOM walk for 40000 steps (102 resets) in 1416 ms. (28 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 43 ms. (90 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 28 ms. (138 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 46 ms. (85 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4002 steps (20 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (16 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (17 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
// Phase 1: matrix 641 rows 492 cols
[2025-05-30 12:44:17] [INFO ] Computed 4 invariants in 5 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 86/105 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 336/441 variables, 115/134 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 8/449 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 16/465 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 423/888 variables, 211/349 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/888 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 203/1091 variables, 118/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1091 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 39/1130 variables, 27/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1130 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 3/1133 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1133 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/1133 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 496 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 86/105 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 336/441 variables, 115/136 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 8/449 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 16/465 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 423/888 variables, 211/365 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/888 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 203/1091 variables, 118/483 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1091 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 39/1130 variables, 27/510 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 3/1133 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 512 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8078ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 641/641 transitions.
Graph (trivial) has 501 edges and 492 vertex of which 2 / 492 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 830 edges and 491 vertex of which 470 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 470 transition count 448
Reduce places removed 156 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 161 rules applied. Total rules applied 336 place count 314 transition count 443
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 341 place count 309 transition count 443
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 341 place count 309 transition count 384
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 459 place count 250 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 249 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 249 transition count 383
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 462 place count 248 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 248 transition count 382
Performed 71 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 605 place count 177 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 614 place count 177 transition count 287
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 616 place count 176 transition count 286
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 622 place count 170 transition count 280
Iterating global reduction 5 with 6 rules applied. Total rules applied 628 place count 170 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 629 place count 170 transition count 279
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 6 with 2 rules applied. Total rules applied 631 place count 169 transition count 278
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 723 place count 123 transition count 283
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 747 place count 123 transition count 259
Discarding 36 places :
Symmetric choice reduction at 7 with 36 rule applications. Total rules 783 place count 87 transition count 187
Iterating global reduction 7 with 36 rules applied. Total rules applied 819 place count 87 transition count 187
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 841 place count 87 transition count 165
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 846 place count 82 transition count 151
Iterating global reduction 8 with 5 rules applied. Total rules applied 851 place count 82 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 852 place count 82 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 858 place count 82 transition count 144
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 866 place count 82 transition count 136
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 876 place count 74 transition count 134
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 879 place count 74 transition count 134
Graph (complete) has 216 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 880 place count 73 transition count 134
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 881 place count 73 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 882 place count 73 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 883 place count 73 transition count 132
Graph (complete) has 212 edges and 73 vertex of which 72 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 884 place count 72 transition count 132
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 885 place count 72 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 886 place count 72 transition count 131
Graph (complete) has 209 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 887 place count 71 transition count 131
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 888 place count 71 transition count 130
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 890 place count 71 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 891 place count 70 transition count 129
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t48.t555 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 3 rules applied. Total rules applied 894 place count 66 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 895 place count 65 transition count 126
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 18 with 2 rules applied. Total rules applied 897 place count 64 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 899 place count 64 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 19 with 13 rules applied. Total rules applied 912 place count 64 transition count 111
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 915 place count 61 transition count 108
Iterating global reduction 19 with 3 rules applied. Total rules applied 918 place count 61 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 921 place count 61 transition count 105
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 922 place count 60 transition count 104
Iterating global reduction 20 with 1 rules applied. Total rules applied 923 place count 60 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 924 place count 60 transition count 103
Free-agglomeration rule applied 9 times.
Iterating global reduction 21 with 9 rules applied. Total rules applied 933 place count 60 transition count 94
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 942 place count 51 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 943 place count 51 transition count 93
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 947 place count 51 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 948 place count 51 transition count 92
Applied a total of 948 rules in 154 ms. Remains 51 /492 variables (removed 441) and now considering 92/641 (removed 549) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 51/492 places, 92/641 transitions.
RANDOM walk for 40000 steps (742 resets) in 354 ms. (112 steps per ms) remains 1/16 properties
BEST_FIRST walk for 24171 steps (82 resets) in 27 ms. (863 steps per ms) remains 0/1 properties
FORMULA CO4-PT-17-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 832 edges and 492 vertex of which 486 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 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(p0) U G((p1 U (p0 U p2))))))'
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 483 transition count 631
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 483 transition count 631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 483 transition count 630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 477 transition count 624
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 477 transition count 624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 474 transition count 621
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 474 transition count 621
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 474 transition count 620
Applied a total of 38 rules in 31 ms. Remains 474 /492 variables (removed 18) and now considering 620/641 (removed 21) transitions.
// Phase 1: matrix 620 rows 474 cols
[2025-05-30 12:44:26] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 12:44:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:44:26] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2025-05-30 12:44:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:55] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:55] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 474/492 places, 620/641 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60558 ms. Remains : 474/492 places, 620/641 transitions.
Stuttering acceptance computed with spot in 352 ms :[p2, p2, p2, (AND p0 p2), p2]
Running random walk in product with property : CO4-PT-17-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR p1 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 15 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-17-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-17-LTLFireability-01 finished in 61467 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(p0)||F((p1||X(((p2 U G(p3)) U (p1&&(p2 U G(p3)))))))))'
Support contains 2 out of 492 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 : 492/492 places, 641/641 transitions.
Graph (trivial) has 530 edges and 492 vertex of which 2 / 492 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 831 edges and 491 vertex of which 485 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 484 transition count 460
Reduce places removed 171 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 172 rules applied. Total rules applied 346 place count 313 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 312 transition count 459
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 347 place count 312 transition count 398
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 469 place count 251 transition count 398
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 475 place count 245 transition count 391
Iterating global reduction 3 with 6 rules applied. Total rules applied 481 place count 245 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 482 place count 245 transition count 390
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 482 place count 245 transition count 386
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 490 place count 241 transition count 386
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 494 place count 237 transition count 382
Iterating global reduction 4 with 4 rules applied. Total rules applied 498 place count 237 transition count 382
Performed 80 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 658 place count 157 transition count 283
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 4 with 8 rules applied. Total rules applied 666 place count 157 transition count 275
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 668 place count 156 transition count 274
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 674 place count 150 transition count 268
Iterating global reduction 6 with 6 rules applied. Total rules applied 680 place count 150 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 681 place count 150 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 685 place count 148 transition count 265
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 775 place count 103 transition count 268
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 804 place count 103 transition count 239
Discarding 40 places :
Symmetric choice reduction at 8 with 40 rule applications. Total rules 844 place count 63 transition count 159
Iterating global reduction 8 with 40 rules applied. Total rules applied 884 place count 63 transition count 159
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 910 place count 63 transition count 133
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 920 place count 53 transition count 104
Iterating global reduction 9 with 10 rules applied. Total rules applied 930 place count 53 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 936 place count 53 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 938 place count 53 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 940 place count 51 transition count 94
Applied a total of 940 rules in 67 ms. Remains 51 /492 variables (removed 441) and now considering 94/641 (removed 547) transitions.
[2025-05-30 12:45:28] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
// Phase 1: matrix 87 rows 51 cols
[2025-05-30 12:45:28] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 12:45:28] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
[2025-05-30 12:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:45:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:45:28] [INFO ] Redundant transitions in 3 ms returned []
Running 81 sub problems to find dead transitions.
[2025-05-30 12:45:28] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
[2025-05-30 12:45:28] [INFO ] Invariant cache hit.
[2025-05-30 12:45:28] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 86/137 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/138 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 58 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 86/137 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 81/138 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 139 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4432ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 4433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/492 places, 94/641 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4591 ms. Remains : 51/492 places, 94/641 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stuttering criterion allowed to conclude after 105 steps with 8 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-02 finished in 4839 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(((p0 U p1)||X((p2||G(p3))))))'
Support contains 3 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 481 transition count 629
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 481 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 481 transition count 628
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 475 transition count 622
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 473 transition count 620
Applied a total of 39 rules in 38 ms. Remains 473 /492 variables (removed 19) and now considering 620/641 (removed 21) transitions.
// Phase 1: matrix 620 rows 473 cols
[2025-05-30 12:45:32] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 12:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:33] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2025-05-30 12:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1093 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:46:01] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:46:01] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 479 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1093 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1093 variables, 619/1098 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 1098 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 473/492 places, 620/641 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 473/492 places, 620/641 transitions.
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CO4-PT-17-LTLFireability-04
Product exploration explored 100000 steps with 15 reset in 120 ms.
Product exploration explored 100000 steps with 2 reset in 116 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 805 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p2) p3))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 88 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (77 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31984 steps (55 resets) in 70 ms. (450 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p2) p3))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 15 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 1 out of 473 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 620/620 transitions.
Applied a total of 0 rules in 11 ms. Remains 473 /473 variables (removed 0) and now considering 620/620 (removed 0) transitions.
[2025-05-30 12:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:34] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 12:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:46:35] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2025-05-30 12:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1093 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:03] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:03] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 479 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1093 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1093 variables, 619/1098 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1093 variables, and 1098 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Finished structural reductions in LTL mode , in 1 iterations and 60466 ms. Remains : 473/473 places, 620/620 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 805 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p3]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (116 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31907 steps (19 resets) in 32 ms. (966 steps per ms) remains 0/1 properties
Knowledge obtained : [p3]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 6 reset in 99 ms.
Product exploration explored 100000 steps with 15 reset in 83 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 620/620 transitions.
Graph (trivial) has 518 edges and 473 vertex of which 2 / 473 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 804 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 469 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 169 place count 469 transition count 614
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 169 place count 469 transition count 675
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 233 place count 469 transition count 675
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 267 place count 435 transition count 641
Deduced a syphon composed of 195 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 301 place count 435 transition count 641
Performed 55 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 356 place count 435 transition count 708
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 364 place count 435 transition count 700
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 391 place count 408 transition count 667
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 418 place count 408 transition count 667
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 420 place count 406 transition count 664
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 422 place count 406 transition count 664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 406 transition count 663
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 424 place count 405 transition count 662
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 405 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 405 transition count 662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 427 place count 405 transition count 661
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 429 place count 403 transition count 659
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 431 place count 403 transition count 659
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 403 transition count 659
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 433 place count 402 transition count 658
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 402 transition count 658
Performed 75 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 75 rules applied. Total rules applied 509 place count 402 transition count 967
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 5 with 69 rules applied. Total rules applied 578 place count 402 transition count 898
Discarding 156 places :
Symmetric choice reduction at 6 with 156 rule applications. Total rules 734 place count 246 transition count 549
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 6 with 156 rules applied. Total rules applied 890 place count 246 transition count 549
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 940 place count 246 transition count 499
Discarding 101 places :
Symmetric choice reduction at 7 with 101 rule applications. Total rules 1041 place count 145 transition count 317
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 1142 place count 145 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1151 place count 145 transition count 308
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1171 place count 125 transition count 268
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1191 place count 125 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1192 place count 125 transition count 293
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1199 place count 125 transition count 286
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1202 place count 122 transition count 268
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1205 place count 122 transition count 268
Deduced a syphon composed of 73 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1223 place count 122 transition count 250
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1225 place count 120 transition count 248
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1227 place count 120 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1228 place count 120 transition count 269
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1229 place count 119 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1230 place count 119 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Applied a total of 1230 rules in 136 ms. Remains 119 /473 variables (removed 354) and now considering 261/620 (removed 359) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:47:36] [INFO ] Redundant transitions in 10 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-30 12:47:36] [INFO ] Flow matrix only has 254 transitions (discarded 7 similar events)
// Phase 1: matrix 254 rows 119 cols
[2025-05-30 12:47:36] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 12:47:36] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:38] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 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-05-30 12:47:38] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 248 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 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 TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 4 (OVERLAPS) 253/372 variables, 119/127 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 15/142 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/142 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/143 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/143 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/143 constraints. Problems are: Problem set: 172 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 143 constraints, problems are : Problem set: 172 solved, 88 unsolved in 7610 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 172 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 11/58 variables, 4/4 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/8 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 240/298 variables, 58/66 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 15/81 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 88/169 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/169 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 74/372 variables, 61/230 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/230 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/373 variables, 1/231 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/231 constraints. Problems are: Problem set: 172 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/373 variables, 0/231 constraints. Problems are: Problem set: 172 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 231 constraints, problems are : Problem set: 172 solved, 88 unsolved in 8832 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/260 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16489ms problems are : Problem set: 172 solved, 88 unsolved
Search for dead transitions found 172 dead transitions in 16490ms
Found 172 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 172 transitions
Dead transitions reduction (with SMT) removed 172 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/473 places, 89/620 transitions.
Graph (complete) has 173 edges and 119 vertex of which 48 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.1 ms
Discarding 71 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 48 /119 variables (removed 71) and now considering 89/89 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/473 places, 89/620 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16647 ms. Remains : 48/473 places, 89/620 transitions.
Built C files in :
/tmp/ltsmin17618375493835462853
[2025-05-30 12:47:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17618375493835462853
Running compilation step : cd /tmp/ltsmin17618375493835462853;'/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 917 ms.
Running link step : cd /tmp/ltsmin17618375493835462853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin17618375493835462853;'/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/stateBased8723958055250440909.hoa' '--buchi-type=spotba'
LTSmin run took 2456 ms.
FORMULA CO4-PT-17-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-04 finished in 143819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(p1)))))'
Support contains 3 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 481 transition count 629
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 481 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 481 transition count 628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 474 transition count 621
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 474 transition count 621
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 471 transition count 618
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 471 transition count 617
Applied a total of 44 rules in 50 ms. Remains 471 /492 variables (removed 21) and now considering 617/641 (removed 24) transitions.
// Phase 1: matrix 617 rows 471 cols
[2025-05-30 12:47:56] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:56] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-30 12:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:57] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:47:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:48:25] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:48:25] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 471/492 places, 617/641 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 471/492 places, 617/641 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-05 finished in 60686 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((p0&&X(p0))))'
Support contains 1 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 481 transition count 629
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 481 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 481 transition count 628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 474 transition count 621
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 474 transition count 621
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 471 transition count 618
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 471 transition count 617
Applied a total of 44 rules in 34 ms. Remains 471 /492 variables (removed 21) and now considering 617/641 (removed 24) transitions.
[2025-05-30 12:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:48:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 12:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:48:57] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:49:25] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:49:26] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 471/492 places, 617/641 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 471/492 places, 617/641 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-17-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 200 ms.
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-17-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-17-LTLFireability-08 finished in 61059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U (F(p1) U p2)) U p3))))'
Support contains 4 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 483 transition count 632
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 483 transition count 632
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 483 transition count 631
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 477 transition count 625
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 477 transition count 625
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 475 transition count 623
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 475 transition count 623
Applied a total of 35 rules in 35 ms. Remains 475 /492 variables (removed 17) and now considering 623/641 (removed 18) transitions.
// Phase 1: matrix 623 rows 475 cols
[2025-05-30 12:49:58] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:58] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-05-30 12:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:49:59] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 622 sub problems to find dead transitions.
[2025-05-30 12:49:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 3 (OVERLAPS) 623/1098 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:50:27] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:50:27] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 481 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 4 (OVERLAPS) 623/1098 variables, 475/481 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 622/1103 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 622 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 475/492 places, 623/641 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60716 ms. Remains : 475/492 places, 623/641 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : CO4-PT-17-LTLFireability-09
Product exploration explored 100000 steps with 45 reset in 93 ms.
Product exploration explored 100000 steps with 79 reset in 102 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 808 edges and 475 vertex of which 472 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 90 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (50 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (102 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (110 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (27 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (77 resets) in 89 ms. (444 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (174 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
[2025-05-30 12:51:00] [INFO ] Invariant cache hit.
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 35/49 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 141/190 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 12/202 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 10/212 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 437/649 variables, 177/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 370/1019 variables, 201/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1019 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 70/1089 variables, 47/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1089 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 9/1098 variables, 7/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1098 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1098 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 479 constraints, problems are : Problem set: 0 solved, 5 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 35/49 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 141/190 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/202 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 10/212 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 437/649 variables, 177/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 370/1019 variables, 201/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1019 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 70/1089 variables, 47/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1089 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 9/1098 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1098 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1098 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 484 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2199ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 263 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 623/623 transitions.
Graph (trivial) has 519 edges and 475 vertex of which 2 / 475 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 806 edges and 474 vertex of which 453 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 453 transition count 418
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 168 rules applied. Total rules applied 355 place count 286 transition count 417
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 355 place count 286 transition count 351
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 487 place count 220 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 488 place count 219 transition count 350
Iterating global reduction 2 with 1 rules applied. Total rules applied 489 place count 219 transition count 350
Performed 74 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 637 place count 145 transition count 260
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 646 place count 145 transition count 251
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 648 place count 144 transition count 250
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 655 place count 137 transition count 243
Iterating global reduction 4 with 7 rules applied. Total rules applied 662 place count 137 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 137 transition count 242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 669 place count 134 transition count 239
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 755 place count 91 transition count 242
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 783 place count 91 transition count 214
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 822 place count 52 transition count 136
Iterating global reduction 6 with 39 rules applied. Total rules applied 861 place count 52 transition count 136
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 888 place count 52 transition count 109
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 897 place count 43 transition count 83
Iterating global reduction 7 with 9 rules applied. Total rules applied 906 place count 43 transition count 83
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 913 place count 43 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 915 place count 42 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 918 place count 42 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 922 place count 42 transition count 77
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 927 place count 42 transition count 72
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 935 place count 37 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 936 place count 37 transition count 69
Graph (complete) has 123 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 937 place count 36 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 938 place count 36 transition count 68
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 939 place count 36 transition count 68
Graph (complete) has 120 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 940 place count 35 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 941 place count 35 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 942 place count 35 transition count 67
Graph (complete) has 117 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 943 place count 34 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 944 place count 34 transition count 66
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 946 place count 34 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 947 place count 33 transition count 65
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t48.t555 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 26 edges and 29 vertex of which 3 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 950 place count 27 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 955 place count 27 transition count 58
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 956 place count 26 transition count 55
Iterating global reduction 18 with 1 rules applied. Total rules applied 957 place count 26 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 958 place count 26 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 19 with 10 rules applied. Total rules applied 968 place count 26 transition count 44
Discarding 5 places :
Symmetric choice reduction at 19 with 5 rule applications. Total rules 973 place count 21 transition count 38
Iterating global reduction 19 with 5 rules applied. Total rules applied 978 place count 21 transition count 38
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 983 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 984 place count 20 transition count 32
Iterating global reduction 20 with 1 rules applied. Total rules applied 985 place count 20 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 986 place count 20 transition count 31
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 21 with 2 rules applied. Total rules applied 988 place count 19 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 39 edges and 19 vertex of which 15 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Iterating post reduction 21 with 2 rules applied. Total rules applied 990 place count 15 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 993 place count 15 transition count 23
Free-agglomeration rule applied 4 times.
Iterating global reduction 23 with 4 rules applied. Total rules applied 997 place count 15 transition count 19
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 1001 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 24 with 3 rules applied. Total rules applied 1004 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 1005 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 1007 place count 10 transition count 14
Applied a total of 1007 rules in 35 ms. Remains 10 /475 variables (removed 465) and now considering 14/623 (removed 609) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/475 places, 14/623 transitions.
RANDOM walk for 194 steps (0 resets) in 4 ms. (38 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F p0), (F p2), (F (NOT (OR p2 p3 p0 p1))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 15 factoid took 311 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 4 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 623/623 transitions.
Graph (trivial) has 514 edges and 475 vertex of which 2 / 475 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 807 edges and 474 vertex of which 471 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 165 rules applied. Total rules applied 167 place count 470 transition count 453
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 165 rules applied. Total rules applied 332 place count 306 transition count 452
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 332 place count 306 transition count 385
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 466 place count 239 transition count 385
Performed 77 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 620 place count 162 transition count 288
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 629 place count 162 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 631 place count 161 transition count 278
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 638 place count 154 transition count 271
Iterating global reduction 4 with 7 rules applied. Total rules applied 645 place count 154 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 646 place count 154 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 652 place count 151 transition count 267
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 742 place count 106 transition count 270
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 771 place count 106 transition count 241
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 811 place count 66 transition count 161
Iterating global reduction 6 with 40 rules applied. Total rules applied 851 place count 66 transition count 161
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 876 place count 66 transition count 136
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 884 place count 58 transition count 113
Iterating global reduction 7 with 8 rules applied. Total rules applied 892 place count 58 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 897 place count 58 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 57 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 906 place count 57 transition count 109
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 911 place count 57 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 913 place count 55 transition count 107
Applied a total of 913 rules in 36 ms. Remains 55 /475 variables (removed 420) and now considering 107/623 (removed 516) transitions.
[2025-05-30 12:51:03] [INFO ] Flow matrix only has 97 transitions (discarded 10 similar events)
// Phase 1: matrix 97 rows 55 cols
[2025-05-30 12:51:03] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-30 12:51:03] [INFO ] Flow matrix only has 97 transitions (discarded 10 similar events)
[2025-05-30 12:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:51:03] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:51:03] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2025-05-30 12:51:03] [INFO ] Flow matrix only has 97 transitions (discarded 10 similar events)
[2025-05-30 12:51:03] [INFO ] Invariant cache hit.
[2025-05-30 12:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 96/151 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/152 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 62 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 96/151 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 94/155 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 156 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5626ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5627ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/475 places, 107/623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5757 ms. Remains : 55/475 places, 107/623 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 99 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 36094 steps (3354 resets) in 319 ms. (112 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT (OR p0 p1 p2 p3))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT p3)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 365 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 15 reset in 60 ms.
Product exploration explored 100000 steps with 11 reset in 59 ms.
Built C files in :
/tmp/ltsmin8981549386435850203
[2025-05-30 12:51:10] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2025-05-30 12:51:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:51:10] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2025-05-30 12:51:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:51:10] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2025-05-30 12:51:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:51:10] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8981549386435850203
Running compilation step : cd /tmp/ltsmin8981549386435850203;'/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 207 ms.
Running link step : cd /tmp/ltsmin8981549386435850203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8981549386435850203;'/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/stateBased17585181806555126605.hoa' '--buchi-type=spotba'
LTSmin run took 107 ms.
FORMULA CO4-PT-17-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-09 finished in 72618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Graph (trivial) has 534 edges and 492 vertex of which 2 / 492 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 831 edges and 491 vertex of which 485 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 174 rules applied. Total rules applied 176 place count 484 transition count 458
Reduce places removed 173 places and 0 transitions.
Iterating post reduction 1 with 173 rules applied. Total rules applied 349 place count 311 transition count 458
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 349 place count 311 transition count 397
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 471 place count 250 transition count 397
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 476 place count 245 transition count 391
Iterating global reduction 2 with 5 rules applied. Total rules applied 481 place count 245 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 245 transition count 390
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 482 place count 245 transition count 387
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 488 place count 242 transition count 387
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 491 place count 239 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 494 place count 239 transition count 384
Performed 82 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 658 place count 157 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 667 place count 157 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 669 place count 156 transition count 272
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 675 place count 150 transition count 266
Iterating global reduction 5 with 6 rules applied. Total rules applied 681 place count 150 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 682 place count 150 transition count 265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 688 place count 147 transition count 262
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 780 place count 101 transition count 266
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 810 place count 101 transition count 236
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 849 place count 62 transition count 158
Iterating global reduction 7 with 39 rules applied. Total rules applied 888 place count 62 transition count 158
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 915 place count 62 transition count 131
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 924 place count 53 transition count 105
Iterating global reduction 8 with 9 rules applied. Total rules applied 933 place count 53 transition count 105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 938 place count 53 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 941 place count 53 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 943 place count 51 transition count 95
Applied a total of 943 rules in 43 ms. Remains 51 /492 variables (removed 441) and now considering 95/641 (removed 546) transitions.
[2025-05-30 12:51:11] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
// Phase 1: matrix 85 rows 51 cols
[2025-05-30 12:51:11] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 12:51:11] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
[2025-05-30 12:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:51:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:51:11] [INFO ] Redundant transitions in 0 ms returned []
Running 82 sub problems to find dead transitions.
[2025-05-30 12:51:11] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
[2025-05-30 12:51:11] [INFO ] Invariant cache hit.
[2025-05-30 12:51:11] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 84/135 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 1/136 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 57 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1983 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 84/135 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 82/138 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 139 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2823 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4822ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 4823ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/492 places, 95/641 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4954 ms. Remains : 51/492 places, 95/641 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-10 finished in 5003 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(F(p0)))))'
Support contains 1 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 482 transition count 630
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 482 transition count 630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 482 transition count 629
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 476 transition count 623
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 476 transition count 623
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 473 transition count 620
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 473 transition count 619
Applied a total of 40 rules in 34 ms. Remains 473 /492 variables (removed 19) and now considering 619/641 (removed 22) transitions.
// Phase 1: matrix 619 rows 473 cols
[2025-05-30 12:51:16] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:16] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 12:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:16] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2025-05-30 12:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:51:44] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:51:44] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 473/492 places, 619/641 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60521 ms. Remains : 473/492 places, 619/641 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (44 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30635 steps (58 resets) in 24 ms. (1225 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 619/619 transitions.
Applied a total of 0 rules in 11 ms. Remains 473 /473 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2025-05-30 12:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:52:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-05-30 12:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:52:18] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2025-05-30 12:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:52:46] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:52:46] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 473/473 places, 619/619 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (64 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (94 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1377323 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :0 out of 1
Probabilistic random walk after 1377323 steps, saw 244650 distinct states, run finished after 3009 ms. (steps per millisecond=457 ) properties seen :0
[2025-05-30 12:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/340 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/352 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/362 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 357/719 variables, 166/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 269/988 variables, 132/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/988 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 98/1086 variables, 66/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 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
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 276/340 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/352 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/362 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 357/719 variables, 166/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 269/988 variables, 132/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/988 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 98/1086 variables, 66/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 619/619 transitions.
Graph (trivial) has 518 edges and 473 vertex of which 2 / 473 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 805 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 469 transition count 614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 469 transition count 613
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 167 place count 469 transition count 674
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 231 place count 469 transition count 674
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 436 transition count 641
Deduced a syphon composed of 194 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 436 transition count 641
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 251 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 354 place count 436 transition count 718
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 362 place count 436 transition count 710
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 389 place count 409 transition count 677
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 416 place count 409 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 418 place count 407 transition count 674
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 420 place count 407 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 407 transition count 673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 422 place count 406 transition count 672
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 423 place count 406 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 424 place count 406 transition count 672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 406 transition count 671
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 427 place count 404 transition count 669
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 429 place count 404 transition count 669
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 404 transition count 669
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 431 place count 403 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 403 transition count 668
Performed 74 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 74 rules applied. Total rules applied 506 place count 403 transition count 975
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 5 with 77 rules applied. Total rules applied 583 place count 403 transition count 898
Discarding 157 places :
Symmetric choice reduction at 6 with 157 rule applications. Total rules 740 place count 246 transition count 541
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 6 with 157 rules applied. Total rules applied 897 place count 246 transition count 541
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 945 place count 246 transition count 493
Discarding 100 places :
Symmetric choice reduction at 7 with 100 rule applications. Total rules 1045 place count 146 transition count 314
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 7 with 100 rules applied. Total rules applied 1145 place count 146 transition count 314
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1155 place count 146 transition count 304
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1175 place count 126 transition count 264
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1195 place count 126 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1197 place count 126 transition count 309
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1209 place count 126 transition count 297
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1215 place count 120 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1221 place count 120 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1232 place count 120 transition count 250
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1233 place count 119 transition count 249
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1234 place count 119 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1235 place count 119 transition count 270
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1236 place count 118 transition count 262
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1237 place count 118 transition count 262
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1237 rules in 87 ms. Remains 118 /473 variables (removed 355) and now considering 262/619 (removed 357) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:53:23] [INFO ] Redundant transitions in 4 ms returned []
Running 261 sub problems to find dead transitions.
[2025-05-30 12:53:23] [INFO ] Flow matrix only has 254 transitions (discarded 8 similar events)
// Phase 1: matrix 254 rows 118 cols
[2025-05-30 12:53:23] [INFO ] Computed 4 invariants in 2 ms
[2025-05-30 12:53:23] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:53:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:53:24] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:53:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 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-05-30 12:53:24] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 249 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 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 TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 4 (OVERLAPS) 253/371 variables, 118/126 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 15/141 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/141 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/142 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/142 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/142 constraints. Problems are: Problem set: 176 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 142 constraints, problems are : Problem set: 176 solved, 85 unsolved in 7749 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 176 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 11/58 variables, 4/4 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/8 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 239/297 variables, 58/66 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 15/81 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 85/166 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/166 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 74/371 variables, 60/226 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/226 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/227 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/227 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/227 constraints. Problems are: Problem set: 176 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 227 constraints, problems are : Problem set: 176 solved, 85 unsolved in 9080 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 85/261 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16870ms problems are : Problem set: 176 solved, 85 unsolved
Search for dead transitions found 176 dead transitions in 16871ms
Found 176 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 176 transitions
Dead transitions reduction (with SMT) removed 176 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/473 places, 86/619 transitions.
Graph (complete) has 177 edges and 118 vertex of which 48 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 48 /118 variables (removed 70) and now considering 86/86 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/473 places, 86/619 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16976 ms. Remains : 48/473 places, 86/619 transitions.
Built C files in :
/tmp/ltsmin12690319718771923967
[2025-05-30 12:53:40] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12690319718771923967
Running compilation step : cd /tmp/ltsmin12690319718771923967;'/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 840 ms.
Running link step : cd /tmp/ltsmin12690319718771923967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12690319718771923967;'/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/stateBased8378437282763525233.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA CO4-PT-17-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-12 finished in 145216 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 (G(p1)||F(p2))))'
Support contains 3 out of 492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Graph (trivial) has 531 edges and 492 vertex of which 2 / 492 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 831 edges and 491 vertex of which 485 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 484 transition count 460
Reduce places removed 171 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 173 rules applied. Total rules applied 347 place count 313 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 349 place count 311 transition count 458
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 349 place count 311 transition count 397
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 471 place count 250 transition count 397
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 476 place count 245 transition count 391
Iterating global reduction 3 with 5 rules applied. Total rules applied 481 place count 245 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 482 place count 245 transition count 390
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 482 place count 245 transition count 387
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 488 place count 242 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 491 place count 239 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 494 place count 239 transition count 384
Performed 80 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 654 place count 159 transition count 284
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 663 place count 159 transition count 275
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 665 place count 158 transition count 274
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 671 place count 152 transition count 268
Iterating global reduction 6 with 6 rules applied. Total rules applied 677 place count 152 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 678 place count 152 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 684 place count 149 transition count 264
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 776 place count 103 transition count 268
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 804 place count 103 transition count 240
Discarding 40 places :
Symmetric choice reduction at 8 with 40 rule applications. Total rules 844 place count 63 transition count 160
Iterating global reduction 8 with 40 rules applied. Total rules applied 884 place count 63 transition count 160
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 909 place count 63 transition count 135
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 918 place count 54 transition count 109
Iterating global reduction 9 with 9 rules applied. Total rules applied 927 place count 54 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 932 place count 54 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 938 place count 54 transition count 98
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 942 place count 54 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 944 place count 52 transition count 96
Applied a total of 944 rules in 36 ms. Remains 52 /492 variables (removed 440) and now considering 96/641 (removed 545) transitions.
[2025-05-30 12:53:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 52 cols
[2025-05-30 12:53:41] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 12:53:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2025-05-30 12:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:53:41] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:53:41] [INFO ] Redundant transitions in 0 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-30 12:53:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2025-05-30 12:53:41] [INFO ] Invariant cache hit.
[2025-05-30 12:53:41] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 87/139 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 1/140 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 58 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1895 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 87/139 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 83/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 141 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2674 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4581ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/492 places, 96/641 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4704 ms. Remains : 52/492 places, 96/641 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-13
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-13 finished in 4793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 492 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 492/492 places, 641/641 transitions.
Graph (trivial) has 533 edges and 492 vertex of which 2 / 492 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 831 edges and 491 vertex of which 488 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 487 transition count 460
Reduce places removed 175 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 176 rules applied. Total rules applied 354 place count 312 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 311 transition count 459
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 355 place count 311 transition count 399
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 475 place count 251 transition count 399
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 481 place count 245 transition count 392
Iterating global reduction 3 with 6 rules applied. Total rules applied 487 place count 245 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 488 place count 245 transition count 391
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 488 place count 245 transition count 387
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 496 place count 241 transition count 387
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 500 place count 237 transition count 383
Iterating global reduction 4 with 4 rules applied. Total rules applied 504 place count 237 transition count 383
Performed 82 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 668 place count 155 transition count 281
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 677 place count 155 transition count 272
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 679 place count 154 transition count 271
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 685 place count 148 transition count 265
Iterating global reduction 6 with 6 rules applied. Total rules applied 691 place count 148 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 692 place count 148 transition count 264
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 698 place count 145 transition count 261
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 786 place count 101 transition count 264
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 814 place count 101 transition count 236
Discarding 38 places :
Symmetric choice reduction at 8 with 38 rule applications. Total rules 852 place count 63 transition count 160
Iterating global reduction 8 with 38 rules applied. Total rules applied 890 place count 63 transition count 160
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 916 place count 63 transition count 134
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 926 place count 53 transition count 105
Iterating global reduction 9 with 10 rules applied. Total rules applied 936 place count 53 transition count 105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 943 place count 53 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 947 place count 53 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 949 place count 51 transition count 92
Applied a total of 949 rules in 40 ms. Remains 51 /492 variables (removed 441) and now considering 92/641 (removed 549) transitions.
[2025-05-30 12:53:46] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
// Phase 1: matrix 83 rows 51 cols
[2025-05-30 12:53:46] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 12:53:46] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2025-05-30 12:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:53:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:53:46] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2025-05-30 12:53:46] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2025-05-30 12:53:46] [INFO ] Invariant cache hit.
[2025-05-30 12:53:46] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 57 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 79/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4321ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/492 places, 92/641 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4453 ms. Remains : 51/492 places, 92/641 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 14 reset in 40 ms.
Product exploration explored 100000 steps with 7 reset in 41 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Graph (complete) has 180 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 33 ms :[(NOT p0)]
RANDOM walk for 861 steps (77 resets) in 7 ms. (107 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 116 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 40 ms :[(NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2025-05-30 12:53:50] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2025-05-30 12:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 12:53:51] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2025-05-30 12:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:53:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:53:51] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2025-05-30 12:53:51] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2025-05-30 12:53:51] [INFO ] Invariant cache hit.
[2025-05-30 12:53:51] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 57 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 79/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4377ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4475 ms. Remains : 51/51 places, 92/92 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Graph (complete) has 180 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 36 ms :[(NOT p0)]
RANDOM walk for 2770 steps (258 resets) in 11 ms. (230 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 117 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 39 ms.
Product exploration explored 100000 steps with 6 reset in 50 ms.
Built C files in :
/tmp/ltsmin658753646873569159
[2025-05-30 12:53:55] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2025-05-30 12:53:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:53:55] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2025-05-30 12:53:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:53:55] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2025-05-30 12:53:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:53:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin658753646873569159
Running compilation step : cd /tmp/ltsmin658753646873569159;'/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 202 ms.
Running link step : cd /tmp/ltsmin658753646873569159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin658753646873569159;'/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/stateBased2688511146143257763.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA CO4-PT-17-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-15 finished in 10261 ms.
All properties solved by simple procedures.
Total runtime 580406 ms.

BK_STOP 1748609636316

--------------------
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="CO4-PT-17"
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 CO4-PT-17, 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 r044-tall-174854028600508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-17.tgz
mv CO4-PT-17 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 ;