Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 52M
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.0M 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 809K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 591K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 174K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 7.1M 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 BART-PT-030-LTLFireability-00
FORMULA_NAME BART-PT-030-LTLFireability-01
FORMULA_NAME BART-PT-030-LTLFireability-02
FORMULA_NAME BART-PT-030-LTLFireability-03
FORMULA_NAME BART-PT-030-LTLFireability-04
FORMULA_NAME BART-PT-030-LTLFireability-05
FORMULA_NAME BART-PT-030-LTLFireability-06
FORMULA_NAME BART-PT-030-LTLFireability-07
FORMULA_NAME BART-PT-030-LTLFireability-08
FORMULA_NAME BART-PT-030-LTLFireability-09
FORMULA_NAME BART-PT-030-LTLFireability-10
FORMULA_NAME BART-PT-030-LTLFireability-11
FORMULA_NAME BART-PT-030-LTLFireability-12
FORMULA_NAME BART-PT-030-LTLFireability-13
FORMULA_NAME BART-PT-030-LTLFireability-14
FORMULA_NAME BART-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748674861431

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 07:01:02] [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 07:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:01:03] [INFO ] Load time of PNML (sax parser for PT used): 528 ms
[2025-05-31 07:01:03] [INFO ] Transformed 4170 places.
[2025-05-31 07:01:03] [INFO ] Transformed 6060 transitions.
[2025-05-31 07:01:03] [INFO ] Found NUPN structural information;
[2025-05-31 07:01:03] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 82 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2971 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 143 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2025-05-31 07:01:04] [INFO ] Computed 30 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:05] [INFO ] Implicit Places using invariants in 996 ms returned []
[2025-05-31 07:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:08] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 3900 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 07:01:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30106 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30079 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62892ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 62929ms
Finished structural reductions in LTL mode , in 1 iterations and 67020 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Support contains 2971 out of 3960 places after structural reductions.
[2025-05-31 07:02:11] [INFO ] Flatten gal took : 292 ms
[2025-05-31 07:02:12] [INFO ] Flatten gal took : 224 ms
[2025-05-31 07:02:13] [INFO ] Input system was already deterministic with 6060 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 35896 steps (7 resets) in 1856 ms. (19 steps per ms) remains 0/23 properties
FORMULA BART-PT-030-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(X(F((X(p0)||(p0&&G(p1))))))'
Support contains 2670 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 270 place count 3690 transition count 5790
Iterating global reduction 0 with 270 rules applied. Total rules applied 540 place count 3690 transition count 5790
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 720 place count 3510 transition count 5610
Iterating global reduction 0 with 180 rules applied. Total rules applied 900 place count 3510 transition count 5610
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 990 place count 3420 transition count 5520
Iterating global reduction 0 with 90 rules applied. Total rules applied 1080 place count 3420 transition count 5520
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 1170 place count 3330 transition count 5430
Iterating global reduction 0 with 90 rules applied. Total rules applied 1260 place count 3330 transition count 5430
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 1350 place count 3240 transition count 5340
Iterating global reduction 0 with 90 rules applied. Total rules applied 1440 place count 3240 transition count 5340
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 1530 place count 3150 transition count 5250
Iterating global reduction 0 with 90 rules applied. Total rules applied 1620 place count 3150 transition count 5250
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 1680 place count 3090 transition count 5190
Iterating global reduction 0 with 60 rules applied. Total rules applied 1740 place count 3090 transition count 5190
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 1800 place count 3030 transition count 5130
Iterating global reduction 0 with 60 rules applied. Total rules applied 1860 place count 3030 transition count 5130
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1890 place count 3000 transition count 5100
Iterating global reduction 0 with 30 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Applied a total of 1920 rules in 447 ms. Remains 3000 /3960 variables (removed 960) and now considering 5100/6060 (removed 960) transitions.
// Phase 1: matrix 5100 rows 3000 cols
[2025-05-31 07:02:14] [INFO ] Computed 30 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:02:15] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-05-31 07:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:02:17] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Running 4020 sub problems to find dead transitions.
[2025-05-31 07:02:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2970/8100 variables, and 0 constraints, problems are : Problem set: 0 solved, 4020 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3000 constraints, PredecessorRefiner: 4020/4020 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4020 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2970/8100 variables, and 0 constraints, problems are : Problem set: 0 solved, 4020 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3000 constraints, PredecessorRefiner: 0/4020 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62019ms problems are : Problem set: 0 solved, 4020 unsolved
Search for dead transitions found 0 dead transitions in 62028ms
Starting structural reductions in LTL mode, iteration 1 : 3000/3960 places, 5100/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64655 ms. Remains : 3000/3960 places, 5100/6060 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-00
Product exploration explored 100000 steps with 33319 reset in 7814 ms.
Product exploration explored 100000 steps with 33326 reset in 7780 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 308 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1827 ms. (21 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2981 ms. (13 steps per ms) remains 1/1 properties
[2025-05-31 07:04:10] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
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/2670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 330/3000 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3000 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5100/8100 variables, 3000/3030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8100 variables, 0/3030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/8100 variables, 0/3030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8100/8100 variables, and 3030 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 3000/3000 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 330/3000 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3000 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5100/8100 variables, 3000/3030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8100 variables, 0/3030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/8100 variables, 0/3030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8100/8100 variables, and 3030 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4703 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 3000/3000 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7922ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 173 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 4 factoid took 483 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2025-05-31 07:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
Support contains 2670 out of 3000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3000/3000 places, 5100/5100 transitions.
Applied a total of 0 rules in 15 ms. Remains 3000 /3000 variables (removed 0) and now considering 5100/5100 (removed 0) transitions.
[2025-05-31 07:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:04:39] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-31 07:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:04:41] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
Running 4020 sub problems to find dead transitions.
[2025-05-31 07:04:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2970/8100 variables, and 0 constraints, problems are : Problem set: 0 solved, 4020 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3000 constraints, PredecessorRefiner: 4020/4020 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4020 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 timeout
1)
(s1077 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2970/8100 variables, and 0 constraints, problems are : Problem set: 0 solved, 4020 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3000 constraints, PredecessorRefiner: 0/4020 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61979ms problems are : Problem set: 0 solved, 4020 unsolved
Search for dead transitions found 0 dead transitions in 61985ms
Finished structural reductions in LTL mode , in 1 iterations and 64116 ms. Remains : 3000/3000 places, 5100/5100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 30249 steps (6 resets) in 600 ms. (50 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 3 factoid took 353 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2025-05-31 07:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33322 reset in 7656 ms.
Product exploration explored 100000 steps with 33324 reset in 7595 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2670 out of 3000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3000/3000 places, 5100/5100 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 3000 transition count 5100
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 30 place count 3000 transition count 5100
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 60 place count 3000 transition count 5100
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 90 place count 2970 transition count 5070
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 120 place count 2970 transition count 5070
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 240 places in 2 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 330 place count 2970 transition count 5070
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 360 place count 2970 transition count 5040
Discarding 180 places :
Symmetric choice reduction at 2 with 180 rule applications. Total rules 540 place count 2790 transition count 4860
Deduced a syphon composed of 60 places in 2 ms
Iterating global reduction 2 with 180 rules applied. Total rules applied 720 place count 2790 transition count 4860
Deduced a syphon composed of 60 places in 1 ms
Applied a total of 720 rules in 518 ms. Remains 2790 /3000 variables (removed 210) and now considering 4860/5100 (removed 240) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:06:55] [INFO ] Redundant transitions in 565 ms returned []
Running 3780 sub problems to find dead transitions.
// Phase 1: matrix 4860 rows 2790 cols
[2025-05-31 07:06:55] [INFO ] Computed 30 invariants in 23 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2760/7650 variables, and 0 constraints, problems are : Problem set: 0 solved, 3780 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2790 constraints, PredecessorRefiner: 3780/3780 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3780 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2760/7650 variables, and 0 constraints, problems are : Problem set: 0 solved, 3780 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2790 constraints, PredecessorRefiner: 0/3780 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61692ms problems are : Problem set: 0 solved, 3780 unsolved
Search for dead transitions found 0 dead transitions in 61698ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2790/3000 places, 4860/5100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62811 ms. Remains : 2790/3000 places, 4860/5100 transitions.
Built C files in :
/tmp/ltsmin6645599753732196790
[2025-05-31 07:07:57] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6645599753732196790
Running compilation step : cd /tmp/ltsmin6645599753732196790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6645599753732196790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6645599753732196790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2670 out of 3000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3000/3000 places, 5100/5100 transitions.
Applied a total of 0 rules in 19 ms. Remains 3000 /3000 variables (removed 0) and now considering 5100/5100 (removed 0) transitions.
// Phase 1: matrix 5100 rows 3000 cols
[2025-05-31 07:08:00] [INFO ] Computed 30 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:08:01] [INFO ] Implicit Places using invariants in 606 ms returned []
[2025-05-31 07:08:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:08:02] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
Running 4020 sub problems to find dead transitions.
[2025-05-31 07:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2970/8100 variables, and 0 constraints, problems are : Problem set: 0 solved, 4020 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3000 constraints, PredecessorRefiner: 4020/4020 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4020 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2970/8100 variables, and 0 constraints, problems are : Problem set: 0 solved, 4020 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3000 constraints, PredecessorRefiner: 0/4020 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62156ms problems are : Problem set: 0 solved, 4020 unsolved
Search for dead transitions found 0 dead transitions in 62162ms
Finished structural reductions in LTL mode , in 1 iterations and 64507 ms. Remains : 3000/3000 places, 5100/5100 transitions.
Built C files in :
/tmp/ltsmin17942396436931649171
[2025-05-31 07:09:05] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17942396436931649171
Running compilation step : cd /tmp/ltsmin17942396436931649171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17942396436931649171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17942396436931649171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:09:08] [INFO ] Flatten gal took : 94 ms
[2025-05-31 07:09:08] [INFO ] Flatten gal took : 92 ms
[2025-05-31 07:09:08] [INFO ] Time to serialize gal into /tmp/LTL10922243163652503839.gal : 39 ms
[2025-05-31 07:09:08] [INFO ] Time to serialize properties into /tmp/LTL3673632075174744371.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10922243163652503839.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13133592393709259879.hoa' '-atoms' '/tmp/LTL3673632075174744371.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3673632075174744371.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13133592393709259879.hoa
Detected timeout of ITS tools.
[2025-05-31 07:09:24] [INFO ] Flatten gal took : 154 ms
[2025-05-31 07:09:24] [INFO ] Flatten gal took : 97 ms
[2025-05-31 07:09:24] [INFO ] Time to serialize gal into /tmp/LTL3567378451695092566.gal : 21 ms
[2025-05-31 07:09:24] [INFO ] Time to serialize properties into /tmp/LTL5371844411991668623.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3567378451695092566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5371844411991668623.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((((TrainState_8_2_26==1)||(TrainState_19_2_16==1))||((TrainState_1_3_15==1)||(TrainState_2_2_32==1)))||(((TrainSt...141551
Formula 0 simplified : XG(X!"(((((((((((((TrainState_8_2_26==1)||(TrainState_19_2_16==1))||((TrainState_1_3_15==1)||(TrainState_2_2_32==1)))||(((TrainState...141541
Detected timeout of ITS tools.
[2025-05-31 07:09:39] [INFO ] Flatten gal took : 90 ms
[2025-05-31 07:09:39] [INFO ] Applying decomposition
[2025-05-31 07:09:40] [INFO ] Flatten gal took : 223 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6502636105044185837.txt' '-o' '/tmp/graph6502636105044185837.bin' '-w' '/tmp/graph6502636105044185837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6502636105044185837.bin' '-l' '-1' '-v' '-w' '/tmp/graph6502636105044185837.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:09:40] [INFO ] Decomposing Gal with order
[2025-05-31 07:09:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:09:41] [INFO ] Removed a total of 1179 redundant transitions.
[2025-05-31 07:09:42] [INFO ] Flatten gal took : 574 ms
[2025-05-31 07:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 73 ms.
[2025-05-31 07:09:43] [INFO ] Time to serialize gal into /tmp/LTL7282814184457237053.gal : 88 ms
[2025-05-31 07:09:43] [INFO ] Time to serialize properties into /tmp/LTL3011532332135461461.ltl : 33 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7282814184457237053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3011532332135461461.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((((i2.i1.u413.TrainState_8_2_26==1)||(i22.i0.u131.TrainState_19_2_16==1))||((i19.i0.u162.TrainState_1_3_15==1)||(...201945
Formula 0 simplified : XG(X!"(((((((((((((i2.i1.u413.TrainState_8_2_26==1)||(i22.i0.u131.TrainState_19_2_16==1))||((i19.i0.u162.TrainState_1_3_15==1)||(i12...201935
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
443 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.84233,165020,1,0,268617,13100,27197,268341,2985,30403,480786
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-LTLFireability-00 finished in 454906 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 U p1))))'
Support contains 300 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1710 transitions
Trivial Post-agglo rules discarded 1710 transitions
Performed 1710 trivial Post agglomeration. Transition count delta: 1710
Iterating post reduction 0 with 1710 rules applied. Total rules applied 1710 place count 3960 transition count 4350
Reduce places removed 1710 places and 0 transitions.
Iterating post reduction 1 with 1710 rules applied. Total rules applied 3420 place count 2250 transition count 4350
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 3570 place count 2100 transition count 4200
Iterating global reduction 2 with 150 rules applied. Total rules applied 3720 place count 2100 transition count 4200
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 4620 place count 1650 transition count 3750
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4650 place count 1650 transition count 3720
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 4740 place count 1620 transition count 3660
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 4800 place count 1590 transition count 3630
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 4830 place count 1590 transition count 3600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 4890 place count 1560 transition count 3570
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 4920 place count 1560 transition count 3540
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 4980 place count 1530 transition count 3510
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 5040 place count 1530 transition count 3450
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 5100 place count 1500 transition count 3420
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 5160 place count 1500 transition count 3360
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 5220 place count 1470 transition count 3330
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 5280 place count 1470 transition count 3270
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 5340 place count 1440 transition count 3240
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 5400 place count 1440 transition count 3180
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 5460 place count 1410 transition count 3150
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 5520 place count 1410 transition count 3090
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 5580 place count 1380 transition count 3060
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 5640 place count 1380 transition count 3000
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 5700 place count 1350 transition count 2970
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 5760 place count 1350 transition count 2910
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 5820 place count 1320 transition count 2880
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 5880 place count 1320 transition count 2820
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 14 with 60 rules applied. Total rules applied 5940 place count 1290 transition count 2790
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 6000 place count 1290 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 15 with 60 rules applied. Total rules applied 6060 place count 1260 transition count 2700
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 6120 place count 1260 transition count 2640
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 6180 place count 1230 transition count 2610
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 6240 place count 1230 transition count 2550
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 6300 place count 1200 transition count 2520
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 6360 place count 1200 transition count 2460
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 18 with 60 rules applied. Total rules applied 6420 place count 1170 transition count 2430
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 6480 place count 1170 transition count 2370
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 6540 place count 1140 transition count 2340
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 6600 place count 1140 transition count 2280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 6660 place count 1110 transition count 2250
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 6720 place count 1110 transition count 2190
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 6780 place count 1080 transition count 2160
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 6840 place count 1080 transition count 2100
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 22 with 60 rules applied. Total rules applied 6900 place count 1050 transition count 2070
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 6960 place count 1050 transition count 2010
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 7020 place count 1020 transition count 1980
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 7080 place count 1020 transition count 1920
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 24 with 60 rules applied. Total rules applied 7140 place count 990 transition count 1890
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 7200 place count 990 transition count 1830
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 25 with 60 rules applied. Total rules applied 7260 place count 960 transition count 1800
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 25 with 30 rules applied. Total rules applied 7290 place count 960 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 26 with 60 rules applied. Total rules applied 7350 place count 930 transition count 1740
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 26 with 30 rules applied. Total rules applied 7380 place count 930 transition count 1710
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 27 with 60 rules applied. Total rules applied 7440 place count 900 transition count 1680
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 27 with 30 rules applied. Total rules applied 7470 place count 900 transition count 1650
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 28 with 60 rules applied. Total rules applied 7530 place count 870 transition count 1620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 7590 place count 870 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 29 with 60 rules applied. Total rules applied 7650 place count 840 transition count 1530
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 7710 place count 840 transition count 1470
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 30 with 60 rules applied. Total rules applied 7770 place count 810 transition count 1440
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 7830 place count 810 transition count 1380
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 31 with 60 rules applied. Total rules applied 7890 place count 780 transition count 1350
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 7950 place count 780 transition count 1290
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 32 with 60 rules applied. Total rules applied 8010 place count 750 transition count 1260
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 32 with 30 rules applied. Total rules applied 8040 place count 750 transition count 1230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 33 with 60 rules applied. Total rules applied 8100 place count 720 transition count 1200
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 8130 place count 720 transition count 1170
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 34 with 60 rules applied. Total rules applied 8190 place count 690 transition count 1140
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 8250 place count 690 transition count 1080
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 35 with 60 rules applied. Total rules applied 8310 place count 660 transition count 1050
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 8370 place count 660 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8400 place count 660 transition count 960
Partial Post-agglomeration rule applied 30 times.
Drop transitions (Partial Post agglomeration) removed 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8430 place count 660 transition count 960
Discarding 30 places :
Symmetric choice reduction at 36 with 30 rule applications. Total rules 8460 place count 630 transition count 930
Iterating global reduction 36 with 30 rules applied. Total rules applied 8490 place count 630 transition count 930
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 36 with 30 rules applied. Total rules applied 8520 place count 630 transition count 900
Applied a total of 8520 rules in 3043 ms. Remains 630 /3960 variables (removed 3330) and now considering 900/6060 (removed 5160) transitions.
// Phase 1: matrix 900 rows 630 cols
[2025-05-31 07:09:52] [INFO ] Computed 30 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:09:52] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-31 07:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:09:53] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:09:53] [INFO ] Redundant transitions in 39 ms returned []
Running 600 sub problems to find dead transitions.
[2025-05-31 07:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 660 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1530 variables, 600/1260 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 1260 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 630/3960 places, 900/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64438 ms. Remains : 630/3960 places, 900/6060 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 740 ms.
Product exploration explored 100000 steps with 14 reset in 736 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 464 ms. (86 steps per ms) remains 1/4 properties
BEST_FIRST walk for 10394 steps (1 resets) in 302 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 509 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
[2025-05-31 07:10:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:11:01] [INFO ] [Real]Absence check using 30 positive place invariants in 32 ms returned sat
[2025-05-31 07:11:02] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2025-05-31 07:11:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:11:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2025-05-31 07:11:07] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2025-05-31 07:11:07] [INFO ] Computed and/alt/rep : 600/870/600 causal constraints (skipped 0 transitions) in 44 ms.
[2025-05-31 07:11:07] [INFO ] Added : 0 causal constraints over 0 iterations in 138 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 300 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 630 /630 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2025-05-31 07:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:11:07] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-31 07:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:11:07] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:11:07] [INFO ] Redundant transitions in 13 ms returned []
Running 600 sub problems to find dead transitions.
[2025-05-31 07:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 660 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1530 variables, 600/1260 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 1260 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60555 ms. Remains : 630/630 places, 900/900 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 351 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 26708 steps (6 resets) in 146 ms. (181 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 503 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
[2025-05-31 07:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:12:12] [INFO ] [Real]Absence check using 30 positive place invariants in 32 ms returned sat
[2025-05-31 07:12:13] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2025-05-31 07:12:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:12:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 32 ms returned sat
[2025-05-31 07:12:18] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2025-05-31 07:12:18] [INFO ] Computed and/alt/rep : 600/870/600 causal constraints (skipped 0 transitions) in 44 ms.
[2025-05-31 07:12:18] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 508 ms.
Product exploration explored 100000 steps with 21 reset in 545 ms.
Built C files in :
/tmp/ltsmin6591493750030148711
[2025-05-31 07:12:19] [INFO ] Computing symmetric may disable matrix : 900 transitions.
[2025-05-31 07:12:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 07:12:19] [INFO ] Computing symmetric may enable matrix : 900 transitions.
[2025-05-31 07:12:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 07:12:19] [INFO ] Computing Do-Not-Accords matrix : 900 transitions.
[2025-05-31 07:12:19] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 07:12:19] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6591493750030148711
Running compilation step : cd /tmp/ltsmin6591493750030148711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2333 ms.
Running link step : cd /tmp/ltsmin6591493750030148711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin6591493750030148711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17802162046625499871.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 900/900 transitions.
Applied a total of 0 rules in 14 ms. Remains 630 /630 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2025-05-31 07:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:12:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-31 07:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:12:34] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:12:34] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2025-05-31 07:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 660 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1530 variables, 600/1260 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 1260 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60497 ms. Remains : 630/630 places, 900/900 transitions.
Built C files in :
/tmp/ltsmin5675934403241601573
[2025-05-31 07:13:34] [INFO ] Computing symmetric may disable matrix : 900 transitions.
[2025-05-31 07:13:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 07:13:34] [INFO ] Computing symmetric may enable matrix : 900 transitions.
[2025-05-31 07:13:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 07:13:35] [INFO ] Computing Do-Not-Accords matrix : 900 transitions.
[2025-05-31 07:13:35] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 07:13:35] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5675934403241601573
Running compilation step : cd /tmp/ltsmin5675934403241601573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2274 ms.
Running link step : cd /tmp/ltsmin5675934403241601573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5675934403241601573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17023383104614116660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 07:13:50] [INFO ] Flatten gal took : 14 ms
[2025-05-31 07:13:50] [INFO ] Flatten gal took : 14 ms
[2025-05-31 07:13:50] [INFO ] Time to serialize gal into /tmp/LTL6799694073744714618.gal : 2 ms
[2025-05-31 07:13:50] [INFO ] Time to serialize properties into /tmp/LTL12251413253116782435.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6799694073744714618.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11478925051784567237.hoa' '-atoms' '/tmp/LTL12251413253116782435.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12251413253116782435.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11478925051784567237.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
33 unique states visited
2 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
1069 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.7639,324992,1,0,255,1.50497e+06,31,93,16327,2.06004e+06,588
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-030-LTLFireability-01 finished in 253705 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' '!(((p0 U p1)&&((F(X(p0)) U p2)||G(p1)||G(p0))))'
Support contains 330 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1710 transitions
Trivial Post-agglo rules discarded 1710 transitions
Performed 1710 trivial Post agglomeration. Transition count delta: 1710
Iterating post reduction 0 with 1710 rules applied. Total rules applied 1710 place count 3960 transition count 4350
Reduce places removed 1710 places and 0 transitions.
Iterating post reduction 1 with 1710 rules applied. Total rules applied 3420 place count 2250 transition count 4350
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 3570 place count 2100 transition count 4200
Iterating global reduction 2 with 150 rules applied. Total rules applied 3720 place count 2100 transition count 4200
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 4620 place count 1650 transition count 3750
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4650 place count 1650 transition count 3720
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 4740 place count 1620 transition count 3660
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 4800 place count 1590 transition count 3630
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 4830 place count 1590 transition count 3600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 4890 place count 1560 transition count 3570
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 4920 place count 1560 transition count 3540
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 4980 place count 1530 transition count 3510
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 5040 place count 1530 transition count 3450
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 5100 place count 1500 transition count 3420
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 5160 place count 1500 transition count 3360
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 5220 place count 1470 transition count 3330
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 5280 place count 1470 transition count 3270
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 5340 place count 1440 transition count 3240
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 5400 place count 1440 transition count 3180
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 5460 place count 1410 transition count 3150
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 5520 place count 1410 transition count 3090
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 5580 place count 1380 transition count 3060
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 5640 place count 1380 transition count 3000
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 5700 place count 1350 transition count 2970
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 5760 place count 1350 transition count 2910
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 5820 place count 1320 transition count 2880
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 5880 place count 1320 transition count 2820
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 14 with 60 rules applied. Total rules applied 5940 place count 1290 transition count 2790
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 6000 place count 1290 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 15 with 60 rules applied. Total rules applied 6060 place count 1260 transition count 2700
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 6120 place count 1260 transition count 2640
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 6180 place count 1230 transition count 2610
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 6240 place count 1230 transition count 2550
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 6300 place count 1200 transition count 2520
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 6360 place count 1200 transition count 2460
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 18 with 60 rules applied. Total rules applied 6420 place count 1170 transition count 2430
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 6480 place count 1170 transition count 2370
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 6540 place count 1140 transition count 2340
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 6600 place count 1140 transition count 2280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 6660 place count 1110 transition count 2250
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 6720 place count 1110 transition count 2190
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 6780 place count 1080 transition count 2160
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 6840 place count 1080 transition count 2100
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 22 with 60 rules applied. Total rules applied 6900 place count 1050 transition count 2070
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 6960 place count 1050 transition count 2010
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 7020 place count 1020 transition count 1980
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 7080 place count 1020 transition count 1920
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 24 with 60 rules applied. Total rules applied 7140 place count 990 transition count 1890
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 7200 place count 990 transition count 1830
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 25 with 60 rules applied. Total rules applied 7260 place count 960 transition count 1800
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 25 with 30 rules applied. Total rules applied 7290 place count 960 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 26 with 60 rules applied. Total rules applied 7350 place count 930 transition count 1740
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 26 with 30 rules applied. Total rules applied 7380 place count 930 transition count 1710
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 27 with 60 rules applied. Total rules applied 7440 place count 900 transition count 1680
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 27 with 30 rules applied. Total rules applied 7470 place count 900 transition count 1650
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 28 with 60 rules applied. Total rules applied 7530 place count 870 transition count 1620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 7590 place count 870 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 29 with 60 rules applied. Total rules applied 7650 place count 840 transition count 1530
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 7710 place count 840 transition count 1470
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 30 with 60 rules applied. Total rules applied 7770 place count 810 transition count 1440
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 7830 place count 810 transition count 1380
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 31 with 60 rules applied. Total rules applied 7890 place count 780 transition count 1350
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 7950 place count 780 transition count 1290
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 32 with 60 rules applied. Total rules applied 8010 place count 750 transition count 1260
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 32 with 30 rules applied. Total rules applied 8040 place count 750 transition count 1230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 33 with 60 rules applied. Total rules applied 8100 place count 720 transition count 1200
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 8130 place count 720 transition count 1170
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 34 with 60 rules applied. Total rules applied 8190 place count 690 transition count 1140
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 8250 place count 690 transition count 1080
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 35 with 60 rules applied. Total rules applied 8310 place count 660 transition count 1050
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 8370 place count 660 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8400 place count 660 transition count 960
Partial Post-agglomeration rule applied 30 times.
Drop transitions (Partial Post agglomeration) removed 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 8430 place count 660 transition count 960
Discarding 30 places :
Symmetric choice reduction at 36 with 30 rule applications. Total rules 8460 place count 630 transition count 930
Iterating global reduction 36 with 30 rules applied. Total rules applied 8490 place count 630 transition count 930
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 36 with 30 rules applied. Total rules applied 8520 place count 630 transition count 900
Applied a total of 8520 rules in 1256 ms. Remains 630 /3960 variables (removed 3330) and now considering 900/6060 (removed 5160) transitions.
[2025-05-31 07:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-31 07:14:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:04] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:14:04] [INFO ] Redundant transitions in 12 ms returned []
Running 600 sub problems to find dead transitions.
[2025-05-31 07:14: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/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/1530 variables, and 660 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 30/630 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 900/1530 variables, 630/660 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1530 variables, 600/1260 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/1530 variables, and 1260 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 630/3960 places, 900/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61787 ms. Remains : 630/3960 places, 900/6060 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), true, (NOT p1), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-03
Entered a terminal (fully accepting) state of product in 5057 steps with 147 reset in 108 ms.
FORMULA BART-PT-030-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-03 finished in 62247 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(p0)||((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))))'
Support contains 2940 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 44 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2025-05-31 07:15:05] [INFO ] Computed 30 invariants in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:15:06] [INFO ] Implicit Places using invariants in 828 ms returned []
[2025-05-31 07:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:15:08] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3327 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 07:15:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30074 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30067 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62671ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 62678ms
Finished structural reductions in LTL mode , in 1 iterations and 66062 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Stuttering acceptance computed with spot in 393 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BART-PT-030-LTLFireability-05
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 6 ms.
FORMULA BART-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-05 finished in 66515 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(p1)) U p2)&&X(p3))))'
Support contains 5 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 958 places :
Symmetric choice reduction at 0 with 958 rule applications. Total rules 958 place count 3002 transition count 5102
Iterating global reduction 0 with 958 rules applied. Total rules applied 1916 place count 3002 transition count 5102
Discarding 808 places :
Symmetric choice reduction at 0 with 808 rule applications. Total rules 2724 place count 2194 transition count 4294
Iterating global reduction 0 with 808 rules applied. Total rules applied 3532 place count 2194 transition count 4294
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 3651 place count 2075 transition count 4175
Iterating global reduction 0 with 119 rules applied. Total rules applied 3770 place count 2075 transition count 4175
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3859 place count 1986 transition count 4086
Iterating global reduction 0 with 89 rules applied. Total rules applied 3948 place count 1986 transition count 4086
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4037 place count 1897 transition count 3997
Iterating global reduction 0 with 89 rules applied. Total rules applied 4126 place count 1897 transition count 3997
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4215 place count 1808 transition count 3908
Iterating global reduction 0 with 89 rules applied. Total rules applied 4304 place count 1808 transition count 3908
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4393 place count 1719 transition count 3819
Iterating global reduction 0 with 89 rules applied. Total rules applied 4482 place count 1719 transition count 3819
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4571 place count 1630 transition count 3730
Iterating global reduction 0 with 89 rules applied. Total rules applied 4660 place count 1630 transition count 3730
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4719 place count 1571 transition count 3671
Iterating global reduction 0 with 59 rules applied. Total rules applied 4778 place count 1571 transition count 3671
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4837 place count 1512 transition count 3612
Iterating global reduction 0 with 59 rules applied. Total rules applied 4896 place count 1512 transition count 3612
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4926 place count 1482 transition count 3582
Iterating global reduction 0 with 30 rules applied. Total rules applied 4956 place count 1482 transition count 3582
Applied a total of 4956 rules in 1167 ms. Remains 1482 /3960 variables (removed 2478) and now considering 3582/6060 (removed 2478) transitions.
// Phase 1: matrix 3582 rows 1482 cols
[2025-05-31 07:16:12] [INFO ] Computed 30 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:16:13] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-31 07:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:16:14] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 2502 sub problems to find dead transitions.
[2025-05-31 07:16:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1452/5064 variables, and 0 constraints, problems are : Problem set: 0 solved, 2502 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1482 constraints, PredecessorRefiner: 2502/2502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2502 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/5064 variables, and 0 constraints, problems are : Problem set: 0 solved, 2502 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1482 constraints, PredecessorRefiner: 0/2502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60826ms problems are : Problem set: 0 solved, 2502 unsolved
Search for dead transitions found 0 dead transitions in 60829ms
Starting structural reductions in LTL mode, iteration 1 : 1482/3960 places, 3582/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63150 ms. Remains : 1482/3960 places, 3582/6060 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p1), (NOT p2), (NOT p3), true]
Running random walk in product with property : BART-PT-030-LTLFireability-08
Product exploration explored 100000 steps with 27761 reset in 2632 ms.
Product exploration explored 100000 steps with 27710 reset in 2633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT p0)), (X (X p1)), (X (X p3)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 315 ms. (126 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT p0)), (X (X p1)), (X (X p3)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 470 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
[2025-05-31 07:17:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:17:23] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT p0)), (X (X p1)), (X (X p3)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 5 factoid took 527 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-08 finished in 72271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((X(X(p0))||F(p1)) U X(!p0))))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3865 place count 1983 transition count 4083
Iterating global reduction 0 with 89 rules applied. Total rules applied 3954 place count 1983 transition count 4083
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4043 place count 1894 transition count 3994
Iterating global reduction 0 with 89 rules applied. Total rules applied 4132 place count 1894 transition count 3994
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4221 place count 1805 transition count 3905
Iterating global reduction 0 with 89 rules applied. Total rules applied 4310 place count 1805 transition count 3905
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4399 place count 1716 transition count 3816
Iterating global reduction 0 with 89 rules applied. Total rules applied 4488 place count 1716 transition count 3816
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4577 place count 1627 transition count 3727
Iterating global reduction 0 with 89 rules applied. Total rules applied 4666 place count 1627 transition count 3727
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4726 place count 1567 transition count 3667
Iterating global reduction 0 with 60 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4934 place count 1478 transition count 3578
Iterating global reduction 0 with 30 rules applied. Total rules applied 4964 place count 1478 transition count 3578
Applied a total of 4964 rules in 1120 ms. Remains 1478 /3960 variables (removed 2482) and now considering 3578/6060 (removed 2482) transitions.
// Phase 1: matrix 3578 rows 1478 cols
[2025-05-31 07:17:25] [INFO ] Computed 30 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:17:25] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-31 07:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:17:26] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Running 2498 sub problems to find dead transitions.
[2025-05-31 07:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 2498/2498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1448/5056 variables, and 0 constraints, problems are : Problem set: 0 solved, 2498 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1478 constraints, PredecessorRefiner: 0/2498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60805ms problems are : Problem set: 0 solved, 2498 unsolved
Search for dead transitions found 0 dead transitions in 60809ms
Starting structural reductions in LTL mode, iteration 1 : 1478/3960 places, 3578/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62980 ms. Remains : 1478/3960 places, 3578/6060 transitions.
Stuttering acceptance computed with spot in 317 ms :[p0, p0, p0, false, p0, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-09
Product exploration explored 100000 steps with 316 reset in 688 ms.
Product exploration explored 100000 steps with 311 reset in 795 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[p0, p0, p0, false, p0, (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 28930 steps (6 resets) in 201 ms. (143 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[p0, p0, p0, false, p0, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 281 ms :[p0, p0, p0, false, p0, (AND (NOT p1) (NOT p0)), (NOT p1)]
[2025-05-31 07:18:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:18:31] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
Proved EG p0
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-09 finished in 67656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p0)) U X((X(p1) U p2))))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 1109 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2025-05-31 07:18:32] [INFO ] Computed 30 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:32] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-31 07:18:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:33] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2025-05-31 07:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 2490/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 0/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60806ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60809ms
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62952 ms. Remains : 1470/3960 places, 3570/6060 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-10
Product exploration explored 100000 steps with 274 reset in 742 ms.
Product exploration explored 100000 steps with 283 reset in 760 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 445 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 5683 steps (0 resets) in 50 ms. (111 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 3 factoid took 566 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-05-31 07:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:19:39] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F p2), (F (NOT p0)), (F (NOT (OR p0 p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 3 factoid took 580 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-10 finished in 68280 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&&X(p1)))))'
Support contains 2 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 1122 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
[2025-05-31 07:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:41] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-31 07:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:42] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2025-05-31 07:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 2490/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 0/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60815ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63086 ms. Remains : 1470/3960 places, 3570/6060 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 31632 steps (6 resets) in 224 ms. (140 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2025-05-31 07:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:20:46] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
Proved EG (NOT p0)
[2025-05-31 07:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 9 factoid took 276 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-11 finished in 67484 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(X(!((G((p0 U p1)) U p1) U X((F(p0)||p2))))))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4045 place count 1893 transition count 3993
Iterating global reduction 0 with 89 rules applied. Total rules applied 4134 place count 1893 transition count 3993
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4223 place count 1804 transition count 3904
Iterating global reduction 0 with 89 rules applied. Total rules applied 4312 place count 1804 transition count 3904
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4401 place count 1715 transition count 3815
Iterating global reduction 0 with 89 rules applied. Total rules applied 4490 place count 1715 transition count 3815
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4579 place count 1626 transition count 3726
Iterating global reduction 0 with 89 rules applied. Total rules applied 4668 place count 1626 transition count 3726
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4727 place count 1567 transition count 3667
Iterating global reduction 0 with 59 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4933 place count 1479 transition count 3579
Iterating global reduction 0 with 29 rules applied. Total rules applied 4962 place count 1479 transition count 3579
Applied a total of 4962 rules in 1102 ms. Remains 1479 /3960 variables (removed 2481) and now considering 3579/6060 (removed 2481) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2025-05-31 07:20:48] [INFO ] Computed 30 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:48] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-05-31 07:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:49] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 2499 sub problems to find dead transitions.
[2025-05-31 07:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 2499/2499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 0/2499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60840ms problems are : Problem set: 0 solved, 2499 unsolved
Search for dead transitions found 0 dead transitions in 60843ms
Starting structural reductions in LTL mode, iteration 1 : 1479/3960 places, 3579/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63178 ms. Remains : 1479/3960 places, 3579/6060 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-12
Product exploration explored 100000 steps with 73 reset in 496 ms.
Product exploration explored 100000 steps with 91 reset in 525 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 143 ms. Reduced automaton from 7 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 22436 steps (4 resets) in 178 ms. (125 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 456 ms. Reduced automaton from 7 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Stuttering acceptance computed with spot in 256 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Support contains 3 out of 1479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1479/1479 places, 3579/3579 transitions.
Applied a total of 0 rules in 64 ms. Remains 1479 /1479 variables (removed 0) and now considering 3579/3579 (removed 0) transitions.
[2025-05-31 07:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:21:54] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-31 07:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:21:55] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 2499 sub problems to find dead transitions.
[2025-05-31 07:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 2499/2499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 0/2499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60815ms problems are : Problem set: 0 solved, 2499 unsolved
Search for dead transitions found 0 dead transitions in 60817ms
Finished structural reductions in LTL mode , in 1 iterations and 61991 ms. Remains : 1479/1479 places, 3579/3579 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 7 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 23801 steps (4 resets) in 152 ms. (155 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 476 ms. Reduced automaton from 7 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Stuttering acceptance computed with spot in 260 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Stuttering acceptance computed with spot in 257 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Product exploration explored 100000 steps with 72 reset in 495 ms.
Product exploration explored 100000 steps with 76 reset in 510 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 245 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR (AND p0 p1) (AND p1 p2)), p0, (OR (AND p0 p1) (AND p1 p2)), (AND p0 p1)]
Support contains 3 out of 1479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1479/1479 places, 3579/3579 transitions.
Graph (trivial) has 3573 edges and 1479 vertex of which 1372 / 1479 are part of one of the 28 SCC in 3 ms
Free SCC test removed 1344 places
Ensure Unique test removed 3296 transitions
Reduce isomorphic transitions removed 3296 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 108 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 31 place count 108 transition count 256
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 108 transition count 256
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 106 transition count 254
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 106 transition count 254
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 106 transition count 256
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 75 place count 106 transition count 244
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 97 place count 84 transition count 222
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 119 place count 84 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 84 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 125 place count 84 transition count 218
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 82 transition count 216
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 82 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 82 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 135 place count 82 transition count 212
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 137 place count 80 transition count 210
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 80 transition count 210
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 80 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 145 place count 80 transition count 206
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 147 place count 78 transition count 204
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 78 transition count 204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 78 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 155 place count 78 transition count 200
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 157 place count 76 transition count 198
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 159 place count 76 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 161 place count 76 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 76 transition count 194
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 167 place count 74 transition count 192
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 169 place count 74 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 171 place count 74 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 175 place count 74 transition count 188
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 177 place count 72 transition count 186
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 179 place count 72 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 181 place count 72 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 185 place count 72 transition count 182
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 187 place count 70 transition count 180
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 189 place count 70 transition count 180
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 191 place count 70 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 195 place count 70 transition count 176
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 197 place count 68 transition count 174
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 199 place count 68 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 201 place count 68 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 205 place count 68 transition count 170
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 207 place count 66 transition count 168
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 209 place count 66 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 211 place count 66 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 215 place count 66 transition count 164
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 217 place count 64 transition count 162
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 219 place count 64 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 221 place count 64 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 225 place count 64 transition count 158
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 227 place count 62 transition count 156
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 229 place count 62 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 231 place count 62 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 235 place count 62 transition count 152
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 237 place count 60 transition count 150
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 239 place count 60 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 241 place count 60 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 245 place count 60 transition count 146
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 247 place count 58 transition count 144
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 249 place count 58 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 251 place count 58 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 255 place count 58 transition count 140
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 257 place count 56 transition count 138
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 259 place count 56 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 261 place count 56 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 265 place count 56 transition count 134
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 267 place count 54 transition count 132
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 269 place count 54 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 271 place count 54 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 275 place count 54 transition count 128
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 277 place count 52 transition count 126
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 279 place count 52 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 281 place count 52 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 285 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 287 place count 50 transition count 120
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 289 place count 50 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 291 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 295 place count 50 transition count 116
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 297 place count 48 transition count 114
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 299 place count 48 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 301 place count 48 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 305 place count 48 transition count 110
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 307 place count 46 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 309 place count 46 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 311 place count 46 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 315 place count 46 transition count 104
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 317 place count 44 transition count 102
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 319 place count 44 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 321 place count 44 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 325 place count 44 transition count 98
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 327 place count 42 transition count 96
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 329 place count 42 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 331 place count 42 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 335 place count 42 transition count 92
Discarding 2 places :
Symmetric choice reduction at 25 with 2 rule applications. Total rules 337 place count 40 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 339 place count 40 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 341 place count 40 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 345 place count 40 transition count 86
Discarding 2 places :
Symmetric choice reduction at 26 with 2 rule applications. Total rules 347 place count 38 transition count 84
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 349 place count 38 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 351 place count 38 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 355 place count 38 transition count 80
Discarding 2 places :
Symmetric choice reduction at 27 with 2 rule applications. Total rules 357 place count 36 transition count 78
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 359 place count 36 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 361 place count 36 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 365 place count 36 transition count 74
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 367 place count 34 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 369 place count 34 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 371 place count 34 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 375 place count 34 transition count 68
Discarding 2 places :
Symmetric choice reduction at 29 with 2 rule applications. Total rules 377 place count 32 transition count 66
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 379 place count 32 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 381 place count 32 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 385 place count 32 transition count 62
Discarding 2 places :
Symmetric choice reduction at 30 with 2 rule applications. Total rules 387 place count 30 transition count 60
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 389 place count 30 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 391 place count 30 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 395 place count 30 transition count 56
Discarding 2 places :
Symmetric choice reduction at 31 with 2 rule applications. Total rules 397 place count 28 transition count 54
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 399 place count 28 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 401 place count 28 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 405 place count 28 transition count 50
Discarding 2 places :
Symmetric choice reduction at 32 with 2 rule applications. Total rules 407 place count 26 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 409 place count 26 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 411 place count 26 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 415 place count 26 transition count 44
Discarding 2 places :
Symmetric choice reduction at 33 with 2 rule applications. Total rules 417 place count 24 transition count 42
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 419 place count 24 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 421 place count 24 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 425 place count 24 transition count 38
Discarding 2 places :
Symmetric choice reduction at 34 with 2 rule applications. Total rules 427 place count 22 transition count 36
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 429 place count 22 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 431 place count 22 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 435 place count 22 transition count 32
Discarding 2 places :
Symmetric choice reduction at 35 with 2 rule applications. Total rules 437 place count 20 transition count 30
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 439 place count 20 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 441 place count 20 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 445 place count 20 transition count 26
Discarding 2 places :
Symmetric choice reduction at 36 with 2 rule applications. Total rules 447 place count 18 transition count 24
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 449 place count 18 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 451 place count 18 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 455 place count 18 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 455 place count 18 transition count 20
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 457 place count 18 transition count 20
Discarding 8 places :
Symmetric choice reduction at 37 with 8 rule applications. Total rules 465 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 8 rules applied. Total rules applied 473 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 37 with 1 rules applied. Total rules applied 474 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 474 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 475 place count 10 transition count 11
Discarding 1 places :
Symmetric choice reduction at 37 with 1 rule applications. Total rules 476 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 477 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 477 rules in 113 ms. Remains 9 /1479 variables (removed 1470) and now considering 10/3579 (removed 3569) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:23:00] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 9 cols
[2025-05-31 07:23:00] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:23:00] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:23:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:23:00] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 15 constraints, problems are : Problem set: 3 solved, 3 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/18 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 18 constraints, problems are : Problem set: 3 solved, 3 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 3 solved, 3 unsolved
Search for dead transitions found 3 dead transitions in 191ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 9/1479 places, 7/3579 transitions.
Graph (complete) has 6 edges and 9 vertex of which 6 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/1479 places, 7/3579 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 312 ms. Remains : 6/1479 places, 7/3579 transitions.
Built C files in :
/tmp/ltsmin15294606137133249819
[2025-05-31 07:23:00] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15294606137133249819
Running compilation step : cd /tmp/ltsmin15294606137133249819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15294606137133249819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15294606137133249819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1479/1479 places, 3579/3579 transitions.
Applied a total of 0 rules in 63 ms. Remains 1479 /1479 variables (removed 0) and now considering 3579/3579 (removed 0) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2025-05-31 07:23:04] [INFO ] Computed 30 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:04] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-05-31 07:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:05] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Running 2499 sub problems to find dead transitions.
[2025-05-31 07:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 2499/2499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s435 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/5058 variables, and 0 constraints, problems are : Problem set: 0 solved, 2499 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1479 constraints, PredecessorRefiner: 0/2499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60888ms problems are : Problem set: 0 solved, 2499 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in LTL mode , in 1 iterations and 62207 ms. Remains : 1479/1479 places, 3579/3579 transitions.
Built C files in :
/tmp/ltsmin16607651382846868807
[2025-05-31 07:24:06] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16607651382846868807
Running compilation step : cd /tmp/ltsmin16607651382846868807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16607651382846868807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16607651382846868807;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:24:09] [INFO ] Flatten gal took : 47 ms
[2025-05-31 07:24:09] [INFO ] Flatten gal took : 90 ms
[2025-05-31 07:24:09] [INFO ] Time to serialize gal into /tmp/LTL15908234536892241050.gal : 23 ms
[2025-05-31 07:24:09] [INFO ] Time to serialize properties into /tmp/LTL10224123609687287089.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15908234536892241050.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6119844550588363938.hoa' '-atoms' '/tmp/LTL10224123609687287089.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10224123609687287089.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6119844550588363938.hoa
Detected timeout of ITS tools.
[2025-05-31 07:24:24] [INFO ] Flatten gal took : 41 ms
[2025-05-31 07:24:24] [INFO ] Flatten gal took : 41 ms
[2025-05-31 07:24:24] [INFO ] Time to serialize gal into /tmp/LTL11634541607087958841.gal : 9 ms
[2025-05-31 07:24:24] [INFO ] Time to serialize properties into /tmp/LTL12001691553381875006.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11634541607087958841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12001691553381875006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((G(("(TrainState_21_3_8==1)")U("(TrainState_10_1_1==1)")))U("(TrainState_10_1_1==1)"))U(X((F("(TrainState_21_3_8==1)"))||("(...185
Formula 0 simplified : XG((G("(TrainState_21_3_8==1)" U "(TrainState_10_1_1==1)") U "(TrainState_10_1_1==1)") U X("(TrainState_23_1_1==1)" | F"(TrainState_...168
Detected timeout of ITS tools.
[2025-05-31 07:24:39] [INFO ] Flatten gal took : 40 ms
[2025-05-31 07:24:39] [INFO ] Applying decomposition
[2025-05-31 07:24:39] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5979548750000429148.txt' '-o' '/tmp/graph5979548750000429148.bin' '-w' '/tmp/graph5979548750000429148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5979548750000429148.bin' '-l' '-1' '-v' '-w' '/tmp/graph5979548750000429148.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:24:40] [INFO ] Decomposing Gal with order
[2025-05-31 07:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:24:40] [INFO ] Removed a total of 1136 redundant transitions.
[2025-05-31 07:24:40] [INFO ] Flatten gal took : 179 ms
[2025-05-31 07:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 15 ms.
[2025-05-31 07:24:40] [INFO ] Time to serialize gal into /tmp/LTL13468744439403301223.gal : 17 ms
[2025-05-31 07:24:40] [INFO ] Time to serialize properties into /tmp/LTL10299971088932032815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13468744439403301223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10299971088932032815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((G(("(i10.u82.TrainState_21_3_8==1)")U("(i20.u15.TrainState_10_1_1==1)")))U("(i20.u15.TrainState_10_1_1==1)"))U(X((F("(i10.u...224
Formula 0 simplified : XG((G("(i10.u82.TrainState_21_3_8==1)" U "(i20.u15.TrainState_10_1_1==1)") U "(i20.u15.TrainState_10_1_1==1)") U X("(i9.u27.TrainSta...207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
9 unique states visited
7 strongly connected components in search stack
13 transitions explored
9 items max in DFS search stack
34 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.547901,34784,1,0,8960,1249,2982,12434,587,2740,18917
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-LTLFireability-12 finished in 233549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((F((!p0 U (G(!p0)||(!p0&&G(p1)))))&&(p2||X(p3))))))'
Support contains 4 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 808 places :
Symmetric choice reduction at 0 with 808 rule applications. Total rules 2726 place count 2193 transition count 4293
Iterating global reduction 0 with 808 rules applied. Total rules applied 3534 place count 2193 transition count 4293
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3654 place count 2073 transition count 4173
Iterating global reduction 0 with 120 rules applied. Total rules applied 3774 place count 2073 transition count 4173
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3863 place count 1984 transition count 4084
Iterating global reduction 0 with 89 rules applied. Total rules applied 3952 place count 1984 transition count 4084
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4041 place count 1895 transition count 3995
Iterating global reduction 0 with 89 rules applied. Total rules applied 4130 place count 1895 transition count 3995
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4219 place count 1806 transition count 3906
Iterating global reduction 0 with 89 rules applied. Total rules applied 4308 place count 1806 transition count 3906
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4397 place count 1717 transition count 3817
Iterating global reduction 0 with 89 rules applied. Total rules applied 4486 place count 1717 transition count 3817
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4575 place count 1628 transition count 3728
Iterating global reduction 0 with 89 rules applied. Total rules applied 4664 place count 1628 transition count 3728
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4723 place count 1569 transition count 3669
Iterating global reduction 0 with 59 rules applied. Total rules applied 4782 place count 1569 transition count 3669
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4841 place count 1510 transition count 3610
Iterating global reduction 0 with 59 rules applied. Total rules applied 4900 place count 1510 transition count 3610
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4929 place count 1481 transition count 3581
Iterating global reduction 0 with 29 rules applied. Total rules applied 4958 place count 1481 transition count 3581
Applied a total of 4958 rules in 1107 ms. Remains 1481 /3960 variables (removed 2479) and now considering 3581/6060 (removed 2479) transitions.
// Phase 1: matrix 3581 rows 1481 cols
[2025-05-31 07:24:42] [INFO ] Computed 30 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:24:42] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-31 07:24:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:24:43] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Running 2501 sub problems to find dead transitions.
[2025-05-31 07:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1451/5062 variables, and 0 constraints, problems are : Problem set: 0 solved, 2501 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1481 constraints, PredecessorRefiner: 2501/2501 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1451/5062 variables, and 0 constraints, problems are : Problem set: 0 solved, 2501 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1481 constraints, PredecessorRefiner: 0/2501 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 2501 unsolved
Search for dead transitions found 0 dead transitions in 60797ms
Starting structural reductions in LTL mode, iteration 1 : 1481/3960 places, 3581/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62992 ms. Remains : 1481/3960 places, 3581/6060 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR p0 (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), p0, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-13
Product exploration explored 100000 steps with 18 reset in 447 ms.
Product exploration explored 100000 steps with 14 reset in 466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 844 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR p0 (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), p0, (AND p0 (NOT p1)), (NOT p0)]
RANDOM walk for 34795 steps (7 resets) in 272 ms. (127 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (F (NOT (OR p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 1261 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR p0 (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), p0, (AND p0 (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(OR p0 (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), p0, (AND p0 (NOT p1)), (NOT p0)]
[2025-05-31 07:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:25:49] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
Proved EG (AND (NOT p2) (NOT p3))
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (F (NOT (OR p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (G (AND (NOT p2) (NOT p3)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p2) (NOT p3)))
Knowledge based reduction with 5 factoid took 1337 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-030-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-13 finished in 69769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6056 edges and 3960 vertex of which 3956 / 3960 are part of one of the 30 SCC in 2 ms
Free SCC test removed 3926 places
Ensure Unique test removed 6024 transitions
Reduce isomorphic transitions removed 6024 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 5 transition count 6
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 3 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 2 transition count 3
Applied a total of 37 rules in 18 ms. Remains 2 /3960 variables (removed 3958) and now considering 3/6060 (removed 6057) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 07:25:50] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-31 07:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:25:50] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-05-31 07:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3960 places, 3/6060 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 2/3960 places, 3/6060 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-15 finished in 187 ms.
All properties solved by simple procedures.
Total runtime 1488281 ms.

BK_STOP 1748676351100

--------------------
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="BART-PT-030"
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 BART-PT-030, 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 r002-tall-174853730100860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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