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

About the Execution of ITS-Tools for CSRepetitions-PT-07

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 116K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 426K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 209K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 882K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 95K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 247K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 394K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 220K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 809K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 359K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 424K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748652328049

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 00:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 00:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:45:29] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-05-31 00:45:29] [INFO ] Transformed 498 places.
[2025-05-31 00:45:29] [INFO ] Transformed 833 transitions.
[2025-05-31 00:45:29] [INFO ] Parsed PT model containing 498 places and 833 transitions and 3087 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 498 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 14 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2025-05-31 00:45:29] [INFO ] Computed 56 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:30] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-05-31 00:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:45:30] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:45:30] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:45:30] [INFO ] Invariant cache hit.
[2025-05-31 00:45:30] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1331 variables, and 56 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/498 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60751ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Finished structural reductions in LTL mode , in 1 iterations and 61525 ms. Remains : 498/498 places, 833/833 transitions.
Support contains 498 out of 498 places after structural reductions.
[2025-05-31 00:46:31] [INFO ] Flatten gal took : 125 ms
[2025-05-31 00:46:31] [INFO ] Flatten gal took : 84 ms
[2025-05-31 00:46:32] [INFO ] Input system was already deterministic with 833 transitions.
RANDOM walk for 33620 steps (316 resets) in 1561 ms. (21 steps per ms) remains 0/30 properties
Computed a total of 0 stabilizing places and 49 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(p0)&&X(X(G(p1)))))'
Support contains 442 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 6 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:33] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-31 00:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:46:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:46:33] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:46:33] [INFO ] Invariant cache hit.
[2025-05-31 00:46:33] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30509ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30514ms
Finished structural reductions in LTL mode , in 1 iterations and 31040 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 2 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-01 finished in 31401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 392 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 47 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:04] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-31 00:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:05] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:47:05] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:47:05] [INFO ] Redundant transitions in 52 ms returned []
Running 784 sub problems to find dead transitions.
[2025-05-31 00:47:05] [INFO ] Invariant cache hit.
[2025-05-31 00:47:05] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30398ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31015 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-02
Stuttering criterion allowed to conclude after 15083 steps with 901 reset in 471 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-02 finished in 31587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U (G(p2)||X(X(G(!p0))))))'
Support contains 155 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 31 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:36] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-31 00:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:47:37] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:47:37] [INFO ] Invariant cache hit.
[2025-05-31 00:47:37] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30398ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30402ms
Finished structural reductions in LTL mode , in 1 iterations and 31813 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p1) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-03
Product exploration explored 100000 steps with 767 reset in 3654 ms.
Stack based approach found an accepted trace after 40634 steps with 315 reset with depth 112 and stack size 112 in 1510 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-03 finished in 37428 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)&&p1) U G((G(X(G(p2))) U p3))))'
Support contains 491 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 7 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-31 00:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:48:14] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:48:14] [INFO ] Invariant cache hit.
[2025-05-31 00:48:14] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 timeout
0.0)
(s263 0.0)
(s264 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30424ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30428ms
Finished structural reductions in LTL mode , in 1 iterations and 30882 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 469 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p3), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-06
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-06 finished in 31396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1) U X(p2)))'
Support contains 449 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-31 00:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:48:45] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:48:45] [INFO ] Invariant cache hit.
[2025-05-31 00:48:45] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30417ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30420ms
Finished structural reductions in LTL mode , in 1 iterations and 30826 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), p0, (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-07
Product exploration explored 100000 steps with 2892 reset in 1914 ms.
Stack based approach found an accepted trace after 581 steps with 20 reset with depth 18 and stack size 18 in 13 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-07 finished in 33064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F((p1&&(p1 U p2))))&&p0))))'
Support contains 5 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 28 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-31 00:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:49:19] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:49:19] [INFO ] Invariant cache hit.
[2025-05-31 00:49:19] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30418ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30421ms
Finished structural reductions in LTL mode , in 1 iterations and 31664 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-08 finished in 31940 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((G(p0)||X(G(p1))||(p2&&X(G(p3))))))'
Support contains 6 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 33 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:50] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-31 00:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:49:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:49:51] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:49:51] [INFO ] Invariant cache hit.
[2025-05-31 00:49:51] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30424ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30428ms
Finished structural reductions in LTL mode , in 1 iterations and 31674 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), true, (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-10 finished in 32060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0&&F(G(p1)))))))))'
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 15 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:22] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-05-31 00:50:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:50:23] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:50:23] [INFO ] Invariant cache hit.
[2025-05-31 00:50:23] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30430ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30432ms
Finished structural reductions in LTL mode , in 1 iterations and 31707 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-11
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-11 finished in 32011 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&&X(p1)) U G(p2)) U p3)))'
Support contains 5 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 11 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:54] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-05-31 00:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:50:55] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:50:55] [INFO ] Invariant cache hit.
[2025-05-31 00:50:55] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30448ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30451ms
Finished structural reductions in LTL mode , in 1 iterations and 31672 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p3), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-12
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-12 finished in 32019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((X(X(p1))&&F(p2))||X(X(G(p1))))))))'
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 7 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:26] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-31 00:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:26] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:51:27] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:51:27] [INFO ] Invariant cache hit.
[2025-05-31 00:51:27] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30407ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30409ms
Finished structural reductions in LTL mode , in 1 iterations and 31646 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-13 finished in 32037 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))))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-05-31 00:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:51:59] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:51:59] [INFO ] Invariant cache hit.
[2025-05-31 00:51:59] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30452ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30454ms
Finished structural reductions in LTL mode , in 1 iterations and 31672 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-14 finished in 31829 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) U p1)) U (p2&&X(F(p3)))))'
Support contains 6 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 12 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2025-05-31 00:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:52:30] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-31 00:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:52:30] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 00:52:31] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2025-05-31 00:52:31] [INFO ] Invariant cache hit.
[2025-05-31 00:52:31] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
SMT process timed out in 30507ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 30508ms
Finished structural reductions in LTL mode , in 1 iterations and 31692 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p1), (NOT p3)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-15
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-15 finished in 31899 ms.
All properties solved by simple procedures.
Total runtime 452625 ms.

BK_STOP 1748652782006

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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