fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339200067
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Champagne-PT-H06T2O

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 299512.00 0.00 0.00 FTTFFFFFFFFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200067.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 Champagne-PT-H06T2O, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.0K Jun 6 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 11:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 137K Jun 5 20:08 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 Champagne-PT-H06T2O-LTLCardinality-00
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-01
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-02
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-03
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-04
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-05
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-06
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-07
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-08
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-09
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-10
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-11
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-12
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-13
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-14
FORMULA_NAME Champagne-PT-H06T2O-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749321081161

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H06T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 18:31:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 18:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:31:22] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-07 18:31:22] [INFO ] Transformed 759 places.
[2025-06-07 18:31:22] [INFO ] Transformed 928 transitions.
[2025-06-07 18:31:22] [INFO ] Found NUPN structural information;
[2025-06-07 18:31:22] [INFO ] Parsed PT model containing 759 places and 928 transitions and 2145 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H06T2O-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T2O-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T2O-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T2O-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T2O-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T2O-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T2O-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 928/928 transitions.
Discarding 131 places :
Symmetric choice reduction at 0 with 131 rule applications. Total rules 131 place count 628 transition count 797
Iterating global reduction 0 with 131 rules applied. Total rules applied 262 place count 628 transition count 797
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 348 place count 542 transition count 711
Iterating global reduction 0 with 86 rules applied. Total rules applied 434 place count 542 transition count 711
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 485 place count 491 transition count 660
Iterating global reduction 0 with 51 rules applied. Total rules applied 536 place count 491 transition count 660
Applied a total of 536 rules in 147 ms. Remains 491 /759 variables (removed 268) and now considering 660/928 (removed 268) transitions.
// Phase 1: matrix 660 rows 491 cols
[2025-06-07 18:31:22] [INFO ] Computed 20 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:23] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-07 18:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:23] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2025-06-07 18:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:31:38] [INFO ] Deduced a trap composed of 123 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:31:39] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 659 unsolved
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 30207ms
Starting structural reductions in LTL mode, iteration 1 : 491/759 places, 660/928 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30966 ms. Remains : 491/759 places, 660/928 transitions.
Support contains 29 out of 491 places after structural reductions.
[2025-06-07 18:31:53] [INFO ] Flatten gal took : 58 ms
[2025-06-07 18:31:53] [INFO ] Flatten gal took : 31 ms
[2025-06-07 18:31:54] [INFO ] Input system was already deterministic with 660 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 20435 steps (42 resets) in 562 ms. (36 steps per ms) remains 0/18 properties
FORMULA Champagne-PT-H06T2O-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Champagne-PT-H06T2O-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 24 stable transitions
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(((F(p0) U (p1&&F(p2)))&&X(p0))))'
Support contains 5 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 476 transition count 645
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 476 transition count 645
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 467 transition count 636
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 467 transition count 636
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 464 transition count 633
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 464 transition count 633
Applied a total of 54 rules in 33 ms. Remains 464 /491 variables (removed 27) and now considering 633/660 (removed 27) transitions.
// Phase 1: matrix 633 rows 464 cols
[2025-06-07 18:31:54] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:54] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-07 18:31:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:55] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2025-06-07 18:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (OVERLAPS) 633/1097 variables, 464/484 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 484 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (OVERLAPS) 633/1097 variables, 464/484 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1097 variables, 632/1116 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:53] [INFO ] Deduced a trap along path composed of 22 places in 53 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 3)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 0)
(t8 3)
(t9 1)
(t10 1)
(t11 0)
(t12 1)
(t13 1)
(t14 4)
(t15 4)
(t16 1)
(t17 3)
(t18 3)
(t19 4)
(t20 4)
(t21 1)
(t22 1)
(t23 1)
(t24 1)
(t25 0)
(t26 0)
(t27 1)
(t28 1)
(t29 3)
(t30 0)
(t31 3)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 1)
(t57 5)
(t58 1)
(t59 1)
(t60 1)
(t61 2)
(t62 2)
(t63 3)
(t64 3)
(t65 1)
(t66 2)
(t67 2)
(t68 3)
(t69 3)
(t70 1)
(t71 2)
(t72 2)
(t73 1)
(t74 1)
(t75 1)
(t76 2)
(t77 2)
(t78 5)
(t79 0)
(t80 5)
(t81 1)
(t82 1)
(t83 0)
(t84 0)
(t85 1)
(t86 1)
(t87 1)
(t88 2)
(t89 2)
(t90 1)
(t91 1)
(t92 1)
(t93 2)
(t94 2)
(t95 2)
(t96 2)
(t97 2)
(t98 1)
(t99 1)
(t100 1)
(t101 2)
(t102 2)
(t103 3)
(t104 0)
(t105 4)
(t106 1)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 3)
(t114 3)
(t115 0)
(t116 3)
(t117 3)
(t118 3)
(t119 3)
(t120 0)
(t121 1)
(t122 4)
(t123 4)
(t124 1)
(t125 3)
(t126 3)
(t127 4)
(t128 4)
(t129 1)
(t130 0)
(t131 1)
(t132 1)
(t133 5)
(t134 1)
(t135 1)
(t136 1)
(t137 2)
(t138 1)
(t139 4)
(t140 4)
(t141 1)
(t142 3)
(t143 3)
(t144 4)
(t145 4)
(t146 2)
(t147 2)
(t148 2)
(t149 1)
(t150 0)
(t151 0)
(t152 2)
(t153 2)
(t154 5)
(t155 0)
(t156 5)
(t157 3)
(t158 0)
(t159 0)
(t160 3)
(t161 3)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 3)
(t179 0)
(t180 3)
(t181 1)
(t182 3)
(t183 0)
(t184 0)
(t185 2)
(t186 2)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 3)
(t204 0)
(t205 3)
(t206 1)
(t207 2)
(t208 0)
(t209 0)
(t210 1)
(t211 1)
(t212 0)
(t213 0)
(t214 0)
(t215 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 1117 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 464/491 places, 633/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60585 ms. Remains : 464/491 places, 633/660 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-03
Product exploration explored 100000 steps with 2981 reset in 332 ms.
Product exploration explored 100000 steps with 3109 reset in 281 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Computed a total of 21 stabilizing places and 21 stable transitions
Detected a total of 21/464 stabilizing places and 21/633 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 198 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND p0 p1 (NOT p2)), false, false]
RANDOM walk for 40000 steps (79 resets) in 576 ms. (69 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
[2025-06-07 18:32:57] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 103/1097 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p2) p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 439 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
[2025-06-07 18:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:32:58] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2025-06-07 18:32:58] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-06-07 18:32:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:32:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2025-06-07 18:32:58] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2025-06-07 18:32:58] [INFO ] Computed and/alt/rep : 631/1169/631 causal constraints (skipped 1 transitions) in 34 ms.
[2025-06-07 18:33:04] [INFO ] Added : 627 causal constraints over 126 iterations in 5472 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 464 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 : 464/464 places, 633/633 transitions.
Graph (trivial) has 485 edges and 464 vertex of which 287 / 464 are part of one of the 19 SCC in 4 ms
Free SCC test removed 268 places
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 195 transition count 275
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 91 rules applied. Total rules applied 149 place count 138 transition count 241
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 166 place count 121 transition count 241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 166 place count 121 transition count 238
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 172 place count 118 transition count 238
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 185 place count 105 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 198 place count 105 transition count 187
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 210 place count 105 transition count 175
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 278 place count 71 transition count 141
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
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 286 place count 67 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 67 transition count 149
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 288 place count 66 transition count 143
Iterating global reduction 5 with 1 rules applied. Total rules applied 289 place count 66 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 290 place count 66 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 297 place count 66 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 64 transition count 133
Applied a total of 299 rules in 61 ms. Remains 64 /464 variables (removed 400) and now considering 133/633 (removed 500) transitions.
[2025-06-07 18:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 62 similar events)
// Phase 1: matrix 71 rows 64 cols
[2025-06-07 18:33:04] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:04] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 18:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 62 similar events)
[2025-06-07 18:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:33:04] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2025-06-07 18:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 62 similar events)
[2025-06-07 18:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 70/134 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 84 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1706 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 70/134 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 77/161 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 161 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3283ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/464 places, 133/633 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3448 ms. Remains : 64/464 places, 133/633 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/64 stabilizing places and 2/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 472 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
RANDOM walk for 934 steps (21 resets) in 12 ms. (71 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 591 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
[2025-06-07 18:33:09] [INFO ] Flow matrix only has 71 transitions (discarded 62 similar events)
[2025-06-07 18:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:33:09] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2025-06-07 18:33:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-07 18:33:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:33:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2025-06-07 18:33:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-07 18:33:09] [INFO ] Computed and/alt/rep : 76/90/32 causal constraints (skipped 1 transitions) in 3 ms.
[2025-06-07 18:33:09] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T2O-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T2O-LTLCardinality-03 finished in 75275 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 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Graph (trivial) has 523 edges and 491 vertex of which 325 / 491 are part of one of the 20 SCC in 2 ms
Free SCC test removed 305 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 185 transition count 263
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 92 rules applied. Total rules applied 150 place count 128 transition count 228
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 167 place count 111 transition count 228
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 183 place count 95 transition count 178
Iterating global reduction 3 with 16 rules applied. Total rules applied 199 place count 95 transition count 178
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 211 place count 95 transition count 166
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 279 place count 61 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 281 place count 59 transition count 124
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 59 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 285 place count 59 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 57 transition count 120
Applied a total of 287 rules in 31 ms. Remains 57 /491 variables (removed 434) and now considering 120/660 (removed 540) transitions.
[2025-06-07 18:33:09] [INFO ] Flow matrix only has 55 transitions (discarded 65 similar events)
// Phase 1: matrix 55 rows 57 cols
[2025-06-07 18:33:09] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:09] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 18:33:09] [INFO ] Flow matrix only has 55 transitions (discarded 65 similar events)
[2025-06-07 18:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:09] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:33:09] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-07 18:33:09] [INFO ] Flow matrix only has 55 transitions (discarded 65 similar events)
[2025-06-07 18:33:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 54/111 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 77 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 54/111 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 64/141 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 141 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2349ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/491 places, 120/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2498 ms. Remains : 57/491 places, 120/660 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-04
Stuttering criterion allowed to conclude after 458 steps with 13 reset in 4 ms.
FORMULA Champagne-PT-H06T2O-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T2O-LTLCardinality-04 finished in 2539 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)||G(p1)||(p1&&F((p2&&G(p3))))))'
Support contains 4 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Graph (trivial) has 517 edges and 491 vertex of which 320 / 491 are part of one of the 21 SCC in 1 ms
Free SCC test removed 299 places
Ensure Unique test removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 191 transition count 271
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 93 rules applied. Total rules applied 152 place count 133 transition count 236
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 169 place count 116 transition count 236
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 186 place count 99 transition count 185
Iterating global reduction 3 with 17 rules applied. Total rules applied 203 place count 99 transition count 185
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 214 place count 99 transition count 174
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 282 place count 65 transition count 140
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 285 place count 62 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 288 place count 62 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 291 place count 62 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 60 transition count 123
Applied a total of 293 rules in 19 ms. Remains 60 /491 variables (removed 431) and now considering 123/660 (removed 537) transitions.
[2025-06-07 18:33:12] [INFO ] Flow matrix only has 60 transitions (discarded 63 similar events)
// Phase 1: matrix 60 rows 60 cols
[2025-06-07 18:33:12] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 18:33:12] [INFO ] Flow matrix only has 60 transitions (discarded 63 similar events)
[2025-06-07 18:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:33:12] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-07 18:33:12] [INFO ] Flow matrix only has 60 transitions (discarded 63 similar events)
[2025-06-07 18:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/119 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 80 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 65/145 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 145 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2397ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/491 places, 123/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2522 ms. Remains : 60/491 places, 123/660 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-07
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T2O-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T2O-LTLCardinality-07 finished in 2927 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)&&G(p1))||X((!p2&&X(G(p2))))))'
Support contains 6 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 478 transition count 647
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 478 transition count 647
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 470 transition count 639
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 470 transition count 639
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 468 transition count 637
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 468 transition count 637
Applied a total of 46 rules in 38 ms. Remains 468 /491 variables (removed 23) and now considering 637/660 (removed 23) transitions.
// Phase 1: matrix 637 rows 468 cols
[2025-06-07 18:33:15] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:15] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-07 18:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:15] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 636 sub problems to find dead transitions.
[2025-06-07 18:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/468 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (OVERLAPS) 637/1105 variables, 468/488 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 488 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/468 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (OVERLAPS) 637/1105 variables, 468/488 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1105 variables, 636/1124 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:06] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 29 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1105 variables, 1/1125 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 1125 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 468/491 places, 637/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 468/491 places, 637/660 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 5045 steps with 11 reset in 13 ms.
FORMULA Champagne-PT-H06T2O-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T2O-LTLCardinality-08 finished in 60769 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((F(p1)&&p0))))'
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 476 transition count 645
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 476 transition count 645
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 467 transition count 636
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 467 transition count 636
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 463 transition count 632
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 463 transition count 632
Applied a total of 56 rules in 28 ms. Remains 463 /491 variables (removed 28) and now considering 632/660 (removed 28) transitions.
// Phase 1: matrix 632 rows 463 cols
[2025-06-07 18:34:16] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:34:16] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-07 18:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:34:16] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2025-06-07 18:34: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/462 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/463 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (OVERLAPS) 632/1095 variables, 463/483 constraints. Problems are: Problem set: 0 solved, 631 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 Real declared 1095/1095 variables, and 483 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 463/463 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/463 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (OVERLAPS) 632/1095 variables, 463/483 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 631/1114 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:35:14] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1115 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 463/463 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 463/491 places, 632/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60495 ms. Remains : 463/491 places, 632/660 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T2O-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T2O-LTLCardinality-09 finished in 60677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 491 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Graph (trivial) has 516 edges and 491 vertex of which 317 / 491 are part of one of the 20 SCC in 1 ms
Free SCC test removed 297 places
Ensure Unique test removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 193 transition count 273
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 91 rules applied. Total rules applied 148 place count 137 transition count 238
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 165 place count 120 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 165 place count 120 transition count 235
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 171 place count 117 transition count 235
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 186 place count 102 transition count 186
Iterating global reduction 3 with 15 rules applied. Total rules applied 201 place count 102 transition count 186
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 212 place count 102 transition count 175
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 280 place count 68 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 66 transition count 133
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 66 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 66 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 65 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 292 place count 65 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 63 transition count 128
Applied a total of 294 rules in 26 ms. Remains 63 /491 variables (removed 428) and now considering 128/660 (removed 532) transitions.
[2025-06-07 18:35:16] [INFO ] Flow matrix only has 65 transitions (discarded 63 similar events)
// Phase 1: matrix 65 rows 63 cols
[2025-06-07 18:35:16] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:35:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 18:35:16] [INFO ] Flow matrix only has 65 transitions (discarded 63 similar events)
[2025-06-07 18:35:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:35:16] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:35:16] [INFO ] Redundant transitions in 3 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-07 18:35:16] [INFO ] Flow matrix only has 65 transitions (discarded 63 similar events)
[2025-06-07 18:35: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/60 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 64/127 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 64/127 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 71/154 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2747ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2748ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/491 places, 128/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2899 ms. Remains : 63/491 places, 128/660 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T2O-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T2O-LTLCardinality-12 finished in 3025 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)))'
Support contains 2 out of 491 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 660/660 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 475 transition count 644
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 475 transition count 644
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 465 transition count 634
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 465 transition count 634
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 461 transition count 630
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 461 transition count 630
Applied a total of 60 rules in 27 ms. Remains 461 /491 variables (removed 30) and now considering 630/660 (removed 30) transitions.
// Phase 1: matrix 630 rows 461 cols
[2025-06-07 18:35:19] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:35:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 18:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:35:20] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 629 sub problems to find dead transitions.
[2025-06-07 18:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/461 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (OVERLAPS) 630/1091 variables, 461/481 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 481 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 629 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 1 (OVERLAPS) 1/461 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 3 (OVERLAPS) 630/1091 variables, 461/481 constraints. Problems are: Problem set: 0 solved, 629 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 629/1110 constraints. Problems are: Problem set: 0 solved, 629 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:36:17] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 1111 constraints, problems are : Problem set: 0 solved, 629 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 461/461 constraints, PredecessorRefiner: 629/629 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 629 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 461/491 places, 630/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60428 ms. Remains : 461/491 places, 630/660 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T2O-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H06T2O-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H06T2O-LTLCardinality-15 finished in 60862 ms.
All properties solved by simple procedures.
Total runtime 298293 ms.

BK_STOP 1749321380673

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Champagne-PT-H06T2O"
export BK_EXAMINATION="LTLCardinality"
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 Champagne-PT-H06T2O, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339200067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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