Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 177K 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-12-LTLFireability-00
FORMULA_NAME CO4-PT-12-LTLFireability-01
FORMULA_NAME CO4-PT-12-LTLFireability-02
FORMULA_NAME CO4-PT-12-LTLFireability-03
FORMULA_NAME CO4-PT-12-LTLFireability-04
FORMULA_NAME CO4-PT-12-LTLFireability-05
FORMULA_NAME CO4-PT-12-LTLFireability-06
FORMULA_NAME CO4-PT-12-LTLFireability-07
FORMULA_NAME CO4-PT-12-LTLFireability-08
FORMULA_NAME CO4-PT-12-LTLFireability-09
FORMULA_NAME CO4-PT-12-LTLFireability-10
FORMULA_NAME CO4-PT-12-LTLFireability-11
FORMULA_NAME CO4-PT-12-LTLFireability-12
FORMULA_NAME CO4-PT-12-LTLFireability-13
FORMULA_NAME CO4-PT-12-LTLFireability-14
FORMULA_NAME CO4-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748607083711

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:11:24] [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:11:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:11:25] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-05-30 12:11:25] [INFO ] Transformed 649 places.
[2025-05-30 12:11:25] [INFO ] Transformed 782 transitions.
[2025-05-30 12:11:25] [INFO ] Found NUPN structural information;
[2025-05-30 12:11:25] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 9 ms
Reduce places removed 172 places and 219 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-12-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 103 place count 378 transition count 475
Iterating global reduction 1 with 83 rules applied. Total rules applied 186 place count 378 transition count 475
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 252 place count 312 transition count 400
Iterating global reduction 1 with 66 rules applied. Total rules applied 318 place count 312 transition count 400
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 323 place count 312 transition count 395
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 357 place count 278 transition count 357
Iterating global reduction 2 with 34 rules applied. Total rules applied 391 place count 278 transition count 357
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 411 place count 258 transition count 336
Iterating global reduction 2 with 20 rules applied. Total rules applied 431 place count 258 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 436 place count 258 transition count 331
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 442 place count 252 transition count 325
Iterating global reduction 3 with 6 rules applied. Total rules applied 448 place count 252 transition count 325
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 450 place count 250 transition count 323
Iterating global reduction 3 with 2 rules applied. Total rules applied 452 place count 250 transition count 323
Applied a total of 452 rules in 110 ms. Remains 250 /477 variables (removed 227) and now considering 323/563 (removed 240) transitions.
// Phase 1: matrix 323 rows 250 cols
[2025-05-30 12:11:25] [INFO ] Computed 6 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:25] [INFO ] Implicit Places using invariants in 217 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 249/477 places, 323/563 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 249/477 places, 323/563 transitions.
Support contains 20 out of 249 places after structural reductions.
[2025-05-30 12:11:25] [INFO ] Flatten gal took : 41 ms
[2025-05-30 12:11:25] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:11:25] [INFO ] Input system was already deterministic with 323 transitions.
RANDOM walk for 40000 steps (287 resets) in 1197 ms. (33 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40000 steps (178 resets) in 437 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (231 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (170 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (146 resets) in 148 ms. (268 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (121 resets) in 154 ms. (258 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (249 resets) in 122 ms. (325 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40001 steps (150 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (250 resets) in 108 ms. (366 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (109 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
// Phase 1: matrix 323 rows 249 cols
[2025-05-30 12:11:26] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 21/43 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:27] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 84/127 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 187/314 variables, 68/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 178/492 variables, 88/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 70/562 variables, 43/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 14 (OVERLAPS) 9/571 variables, 6/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/572 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/572 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/572 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 255 constraints, problems are : Problem set: 1 solved, 6 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 79/120 variables, 41/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 177/297 variables, 64/111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 6/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 178/475 variables, 86/203 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 75/550 variables, 45/248 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 15/565 variables, 8/256 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/571 variables, 4/260 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/572 variables, 1/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/572 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/572 variables, 0/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 261 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1960ms problems are : Problem set: 1 solved, 6 unsolved
Finished Parikh walk after 1371 steps, including 103 resets, run visited all 1 properties in 3 ms. (steps per millisecond=457 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 172 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA CO4-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 28 stable transitions
Graph (complete) has 455 edges and 249 vertex of which 244 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Graph (trivial) has 260 edges and 249 vertex of which 3 / 249 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 453 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 241 transition count 223
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 184 place count 150 transition count 223
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 184 place count 150 transition count 201
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 228 place count 128 transition count 201
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 233 place count 123 transition count 191
Iterating global reduction 2 with 5 rules applied. Total rules applied 238 place count 123 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 240 place count 123 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 240 place count 123 transition count 188
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 122 transition count 188
Performed 50 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 342 place count 72 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 344 place count 72 transition count 120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 348 place count 68 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 352 place count 68 transition count 116
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 4 with 2 rules applied. Total rules applied 354 place count 67 transition count 115
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 384 place count 52 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 389 place count 52 transition count 116
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 400 place count 41 transition count 94
Iterating global reduction 5 with 11 rules applied. Total rules applied 411 place count 41 transition count 94
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 421 place count 41 transition count 84
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 424 place count 38 transition count 75
Iterating global reduction 6 with 3 rules applied. Total rules applied 427 place count 38 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 429 place count 38 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 444 place count 38 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 446 place count 36 transition count 56
Applied a total of 446 rules in 58 ms. Remains 36 /249 variables (removed 213) and now considering 56/323 (removed 267) transitions.
[2025-05-30 12:11:29] [INFO ] Flow matrix only has 52 transitions (discarded 4 similar events)
// Phase 1: matrix 52 rows 36 cols
[2025-05-30 12:11:29] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:29] [INFO ] Implicit Places using invariants in 38 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/249 places, 56/323 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 35/249 places, 56/323 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 12 reset in 165 ms.
Product exploration explored 100000 steps with 6 reset in 63 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5817 steps (710 resets) in 69 ms. (83 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 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-05-30 12:11:30] [INFO ] Flow matrix only has 52 transitions (discarded 4 similar events)
// Phase 1: matrix 52 rows 35 cols
[2025-05-30 12:11:30] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 12:11:30] [INFO ] Flow matrix only has 52 transitions (discarded 4 similar events)
[2025-05-30 12:11:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:11:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:11:30] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2025-05-30 12:11:30] [INFO ] Flow matrix only has 52 transitions (discarded 4 similar events)
[2025-05-30 12:11:30] [INFO ] Invariant cache hit.
[2025-05-30 12:11:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 51/86 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 40 constraints, problems are : Problem set: 0 solved, 41 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 51/86 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 41/80 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 81 constraints, problems are : Problem set: 0 solved, 41 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1556ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1557ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1642 ms. Remains : 35/35 places, 56/56 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1725 steps (211 resets) in 12 ms. (132 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 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 34 ms.
Product exploration explored 100000 steps with 72 reset in 138 ms.
Built C files in :
/tmp/ltsmin17096562659203454919
[2025-05-30 12:11:32] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2025-05-30 12:11:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:32] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2025-05-30 12:11:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:32] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2025-05-30 12:11:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17096562659203454919
Running compilation step : cd /tmp/ltsmin17096562659203454919;'/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 249 ms.
Running link step : cd /tmp/ltsmin17096562659203454919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17096562659203454919;'/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/stateBased7778950563647646587.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA CO4-PT-12-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-12-LTLFireability-00 finished in 3762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(X(F((p1||G(p2))))))||G(F((p1||G(p2)))))))'
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 239 transition count 308
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 239 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 239 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 238 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 238 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 238 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 237 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 237 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 236 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 236 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 236 transition count 301
Applied a total of 30 rules in 21 ms. Remains 236 /249 variables (removed 13) and now considering 301/323 (removed 22) transitions.
// Phase 1: matrix 301 rows 236 cols
[2025-05-30 12:11:33] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:33] [INFO ] Implicit Places using invariants in 78 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/249 places, 301/323 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 235/249 places, 301/323 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-04
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-04 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 241 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 241 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 241 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 240 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 240 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 240 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 239 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 239 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 238 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 238 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 238 transition count 307
Applied a total of 26 rules in 14 ms. Remains 238 /249 variables (removed 11) and now considering 307/323 (removed 16) transitions.
// Phase 1: matrix 307 rows 238 cols
[2025-05-30 12:11:33] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:33] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-30 12:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:33] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-05-30 12:11: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/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:36] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
Problem TDEAD252 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:37] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
Problem TDEAD262 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 6/11 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 307/545 variables, 238/249 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/249 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/249 constraints. Problems are: Problem set: 4 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 249 constraints, problems are : Problem set: 4 solved, 302 unsolved in 19780 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 6/11 constraints. Problems are: Problem set: 4 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 2/13 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 307/545 variables, 238/251 constraints. Problems are: Problem set: 4 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 302/553 constraints. Problems are: Problem set: 4 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 1/554 constraints. Problems are: Problem set: 4 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/555 constraints. Problems are: Problem set: 4 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 555 constraints, problems are : Problem set: 4 solved, 302 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 302/306 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49852ms problems are : Problem set: 4 solved, 302 unsolved
Search for dead transitions found 4 dead transitions in 49855ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/249 places, 303/323 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50089 ms. Remains : 238/249 places, 303/323 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-05 finished in 50174 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((p0||X(X(X(p1)))))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 239 transition count 308
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 239 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 239 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 238 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 238 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 238 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 237 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 237 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 236 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 236 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 236 transition count 301
Applied a total of 30 rules in 21 ms. Remains 236 /249 variables (removed 13) and now considering 301/323 (removed 22) transitions.
// Phase 1: matrix 301 rows 236 cols
[2025-05-30 12:12:23] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:23] [INFO ] Implicit Places using invariants in 86 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/249 places, 301/323 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 235/249 places, 301/323 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-12-LTLFireability-07
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-07 finished in 307 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 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Graph (trivial) has 261 edges and 249 vertex of which 3 / 249 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 453 edges and 247 vertex of which 242 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 241 transition count 222
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 149 transition count 222
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 186 place count 149 transition count 200
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 230 place count 127 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 235 place count 122 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 240 place count 122 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 122 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 242 place count 122 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 244 place count 121 transition count 187
Performed 50 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 344 place count 71 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 348 place count 71 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 352 place count 67 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 67 transition count 112
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 4 with 2 rules applied. Total rules applied 358 place count 66 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 386 place count 52 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 395 place count 52 transition count 105
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 405 place count 42 transition count 85
Iterating global reduction 5 with 10 rules applied. Total rules applied 415 place count 42 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 422 place count 42 transition count 78
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 425 place count 39 transition count 69
Iterating global reduction 6 with 3 rules applied. Total rules applied 428 place count 39 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 430 place count 39 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 432 place count 38 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 441 place count 38 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 443 place count 36 transition count 63
Applied a total of 443 rules in 50 ms. Remains 36 /249 variables (removed 213) and now considering 63/323 (removed 260) transitions.
[2025-05-30 12:12:23] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 36 cols
[2025-05-30 12:12:23] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:23] [INFO ] Implicit Places using invariants in 34 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/249 places, 63/323 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 35/249 places, 63/323 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-11 finished in 131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||F(p2)||X(p3)))))'
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 242 transition count 312
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 242 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 241 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 241 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 241 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 240 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 240 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 239 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 239 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 239 transition count 307
Applied a total of 22 rules in 17 ms. Remains 239 /249 variables (removed 10) and now considering 307/323 (removed 16) transitions.
// Phase 1: matrix 307 rows 239 cols
[2025-05-30 12:12:23] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:24] [INFO ] Implicit Places using invariants in 67 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/249 places, 307/323 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 238/249 places, 307/323 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : CO4-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-13 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||X(F(p2)))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 323/323 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 242 transition count 311
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 242 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 242 transition count 309
Applied a total of 16 rules in 5 ms. Remains 242 /249 variables (removed 7) and now considering 309/323 (removed 14) transitions.
// Phase 1: matrix 309 rows 242 cols
[2025-05-30 12:12:24] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:24] [INFO ] Implicit Places using invariants in 61 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/249 places, 309/323 transitions.
Applied a total of 0 rules in 2 ms. Remains 241 /241 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 241/249 places, 309/323 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLFireability-15 finished in 151 ms.
All properties solved by simple procedures.
Total runtime 59543 ms.

BK_STOP 1748607144473

--------------------
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-12"
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-12, 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-174854028500468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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