fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102700516
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FlexibleBarrier-PT-18a

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700516.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 FlexibleBarrier-PT-18a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 265K 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 FlexibleBarrier-PT-18a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-18a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748969440806

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 16:50:42] [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-06-03 16:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 16:50:43] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2025-06-03 16:50:43] [INFO ] Transformed 219 places.
[2025-06-03 16:50:43] [INFO ] Transformed 886 transitions.
[2025-06-03 16:50:43] [INFO ] Found NUPN structural information;
[2025-06-03 16:50:43] [INFO ] Parsed PT model containing 219 places and 886 transitions and 4355 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 290 transitions
Reduce redundant transitions removed 290 transitions.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 596/596 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 219 transition count 578
Applied a total of 18 rules in 62 ms. Remains 219 /219 variables (removed 0) and now considering 578/596 (removed 18) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:50:43] [INFO ] Computed 20 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:44] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-06-03 16:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:50:44] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:50:44] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:50:45] [INFO ] Invariant cache hit.
[2025-06-03 16:50:45] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30050 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30030 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60959ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 61009ms
Starting structural reductions in LTL mode, iteration 1 : 219/219 places, 578/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62513 ms. Remains : 219/219 places, 578/596 transitions.
Support contains 36 out of 219 places after structural reductions.
[2025-06-03 16:51:46] [INFO ] Flatten gal took : 102 ms
[2025-06-03 16:51:46] [INFO ] Flatten gal took : 54 ms
[2025-06-03 16:51:46] [INFO ] Input system was already deterministic with 578 transitions.
RANDOM walk for 9566 steps (1 resets) in 1000 ms. (9 steps per ms) remains 0/27 properties
Computed a total of 3 stabilizing places and 1 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' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 170 edges and 219 vertex of which 42 / 219 are part of one of the 14 SCC in 11 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 137 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 308 place count 137 transition count 219
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 310 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 312 place count 135 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 314 place count 135 transition count 217
Applied a total of 314 rules in 128 ms. Remains 135 /219 variables (removed 84) and now considering 217/578 (removed 361) transitions.
[2025-06-03 16:51:47] [INFO ] Flow matrix only has 186 transitions (discarded 31 similar events)
// Phase 1: matrix 186 rows 135 cols
[2025-06-03 16:51:47] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:51:47] [INFO ] Implicit Places using invariants in 187 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 189 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/219 places, 217/578 transitions.
Graph (trivial) has 176 edges and 134 vertex of which 42 / 134 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 106 transition count 143
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 88 transition count 143
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 88 transition count 125
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 70 transition count 125
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 117 place count 48 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 135 place count 48 transition count 85
Applied a total of 135 rules in 29 ms. Remains 48 /134 variables (removed 86) and now considering 85/217 (removed 132) transitions.
[2025-06-03 16:51:47] [INFO ] Flow matrix only has 64 transitions (discarded 21 similar events)
// Phase 1: matrix 64 rows 48 cols
[2025-06-03 16:51:47] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:51:47] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 16:51:47] [INFO ] Flow matrix only has 64 transitions (discarded 21 similar events)
[2025-06-03 16:51:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:51:47] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-03 16:51:47] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/219 places, 85/578 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 48/219 places, 85/578 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-00 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 179 edges and 219 vertex of which 54 / 219 are part of one of the 18 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 129 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 153 transitions
Redundant transition composition rules discarded 153 transitions
Iterating global reduction 0 with 153 rules applied. Total rules applied 262 place count 129 transition count 199
Applied a total of 262 rules in 34 ms. Remains 129 /219 variables (removed 90) and now considering 199/578 (removed 379) transitions.
[2025-06-03 16:51:48] [INFO ] Flow matrix only has 164 transitions (discarded 35 similar events)
// Phase 1: matrix 164 rows 129 cols
[2025-06-03 16:51:48] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:51:48] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-03 16:51:48] [INFO ] Flow matrix only has 164 transitions (discarded 35 similar events)
[2025-06-03 16:51:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:51:48] [INFO ] State equation strengthened by 127 read => feed constraints.
[2025-06-03 16:51:48] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:51:48] [INFO ] Redundant transitions in 14 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 16:51:48] [INFO ] Flow matrix only has 164 transitions (discarded 35 similar events)
[2025-06-03 16:51:48] [INFO ] Invariant cache hit.
[2025-06-03 16:51:48] [INFO ] State equation strengthened by 127 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 163/292 variables, 129/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 126/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 405 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20029 ms.
Refiners :[Domain max(s): 129/129 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 129/129 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 163/292 variables, 129/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 126/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 198/602 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 603 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19226 ms.
Refiners :[Domain max(s): 129/129 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 129/129 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39295ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 39297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/219 places, 199/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39824 ms. Remains : 129/219 places, 199/578 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-01
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-01 finished in 39923 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)&&X(p1)) U X(X(G((F(p2) U p3)))))))'
Support contains 9 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:52:28] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:52:28] [INFO ] Implicit Places using invariants in 338 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 1026 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-02
Product exploration explored 100000 steps with 3578 reset in 1428 ms.
Stack based approach found an accepted trace after 115 steps with 2 reset with depth 77 and stack size 77 in 4 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-02 finished in 2871 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) U p1) U (p2||X(X(G((p2||G(p1)))))))))'
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:52:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:52:31] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-06-03 16:52:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:52:31] [INFO ] State equation strengthened by 397 read => feed constraints.
[2025-06-03 16:52:32] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 577 sub problems to find dead transitions.
[2025-06-03 16:52:32] [INFO ] Invariant cache hit.
[2025-06-03 16:52:32] [INFO ] State equation strengthened by 397 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 855 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30022 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 578/797 variables, 219/458 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 397/855 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 577/1432 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 1432 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30023 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 219/219 constraints, ReadFeed: 397/397 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in LTL mode , in 1 iterations and 61480 ms. Remains : 219/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 556 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-05
Product exploration explored 100000 steps with 809 reset in 841 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-05 finished in 62932 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)||(p1 U X(G(!p2)))))'
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:53:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:34] [INFO ] Implicit Places using invariants in 212 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p2), (AND p2 (NOT p0)), (AND (NOT p0) p2), true, p2, p2]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1862 ms.
Product exploration explored 100000 steps with 50000 reset in 1880 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 27 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-06 finished in 4239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 175 edges and 219 vertex of which 48 / 219 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 133 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 291 place count 133 transition count 205
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 133 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 132 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 132 transition count 204
Applied a total of 294 rules in 41 ms. Remains 132 /219 variables (removed 87) and now considering 204/578 (removed 374) transitions.
[2025-06-03 16:53:38] [INFO ] Flow matrix only has 171 transitions (discarded 33 similar events)
// Phase 1: matrix 171 rows 132 cols
[2025-06-03 16:53:38] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:38] [INFO ] Implicit Places using invariants in 168 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/219 places, 204/578 transitions.
Graph (trivial) has 178 edges and 131 vertex of which 48 / 131 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 99 transition count 122
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 81 transition count 122
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 37 place count 81 transition count 104
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 73 place count 63 transition count 104
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 113 place count 43 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 131 place count 43 transition count 66
Applied a total of 131 rules in 11 ms. Remains 43 /131 variables (removed 88) and now considering 66/204 (removed 138) transitions.
[2025-06-03 16:53:38] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
// Phase 1: matrix 47 rows 43 cols
[2025-06-03 16:53:38] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-03 16:53:38] [INFO ] Flow matrix only has 47 transitions (discarded 19 similar events)
[2025-06-03 16:53:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-03 16:53:38] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/219 places, 66/578 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 43/219 places, 66/578 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-08
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-08 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((X(p2)&&p1)))))'
Support contains 8 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
// Phase 1: matrix 578 rows 219 cols
[2025-06-03 16:53:38] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:39] [INFO ] Implicit Places using invariants in 317 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 325 ms. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-09 finished in 761 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(!p0))) U ((X(X(X(!p0)))&&G((p1&&F(!p2))))||X(X(X(G(!p0)))))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:53:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:39] [INFO ] Implicit Places using invariants in 333 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 335 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 576 ms :[p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0), p0, p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0), true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 99 steps with 22 reset in 2 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-10 finished in 955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((p1 U X(p1)))))'
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:40] [INFO ] Implicit Places using invariants in 229 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-12 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(!p1)))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2025-06-03 16:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:41] [INFO ] Implicit Places using invariants in 371 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/219 places, 578/578 transitions.
Applied a total of 0 rules in 3 ms. Remains 218 /218 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 218/219 places, 578/578 transitions.
Stuttering acceptance computed with spot in 206 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 16 steps with 3 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-14 finished in 605 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))||G(!p1)) U G(p2)))'
Support contains 9 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 578/578 transitions.
Graph (trivial) has 164 edges and 219 vertex of which 39 / 219 are part of one of the 13 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 103 place count 142 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 0 with 182 rules applied. Total rules applied 285 place count 142 transition count 241
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 290 place count 142 transition count 241
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 294 place count 138 transition count 237
Iterating global reduction 0 with 4 rules applied. Total rules applied 298 place count 138 transition count 237
Applied a total of 298 rules in 56 ms. Remains 138 /219 variables (removed 81) and now considering 237/578 (removed 341) transitions.
[2025-06-03 16:53:41] [INFO ] Flow matrix only has 196 transitions (discarded 41 similar events)
// Phase 1: matrix 196 rows 138 cols
[2025-06-03 16:53:41] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:41] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-03 16:53:41] [INFO ] Flow matrix only has 196 transitions (discarded 41 similar events)
[2025-06-03 16:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 16:53:41] [INFO ] State equation strengthened by 145 read => feed constraints.
[2025-06-03 16:53:42] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 16:53:42] [INFO ] Redundant transitions in 39 ms returned [100, 101, 102, 103, 126, 127, 128]
Found 7 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
Running 229 sub problems to find dead transitions.
[2025-06-03 16:53:42] [INFO ] Flow matrix only has 189 transitions (discarded 41 similar events)
// Phase 1: matrix 189 rows 138 cols
[2025-06-03 16:53:42] [INFO ] Computed 20 invariants in 2 ms
[2025-06-03 16:53:42] [INFO ] State equation strengthened by 138 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 188/326 variables, 138/158 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 137/295 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 296 constraints, problems are : Problem set: 0 solved, 229 unsolved in 22854 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 138/138 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 188/326 variables, 138/158 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 137/295 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 229/524 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 525 constraints, problems are : Problem set: 0 solved, 229 unsolved in 22736 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 138/138 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45614ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 45616ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/219 places, 230/578 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46190 ms. Remains : 138/219 places, 230/578 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2 p1), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-18a-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18a-LTLFireability-15 finished in 46471 ms.
All properties solved by simple procedures.
Total runtime 225185 ms.

BK_STOP 1748969668054

--------------------
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="FlexibleBarrier-PT-18a"
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 FlexibleBarrier-PT-18a, 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 r086-smll-174860102700516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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