Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 60M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 6 09:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 16K Jun 6 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Jun 6 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 6 09:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 60M Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749363202057

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1007
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 06:13:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 06:13:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 06:13:25] [INFO ] Load time of PNML (sax parser for PT used): 2131 ms
[2025-06-08 06:13:25] [INFO ] Transformed 285 places.
[2025-06-08 06:13:26] [INFO ] Transformed 52780 transitions.
[2025-06-08 06:13:26] [INFO ] Found NUPN structural information;
[2025-06-08 06:13:26] [INFO ] Parsed PT model containing 285 places and 52780 transitions and 1225525 arcs in 2631 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 52780/52780 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 221 transition count 52716
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 221 transition count 52716
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 159 place count 190 transition count 52685
Iterating global reduction 0 with 31 rules applied. Total rules applied 190 place count 190 transition count 52685
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 200 place count 180 transition count 35571
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 212 place count 178 transition count 35571
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 220 place count 170 transition count 1347
Iterating global reduction 0 with 8 rules applied. Total rules applied 228 place count 170 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 169 transition count 1345
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 169 transition count 1345
Applied a total of 230 rules in 6314 ms. Remains 169 /285 variables (removed 116) and now considering 1345/52780 (removed 51435) transitions.
// Phase 1: matrix 1345 rows 169 cols
[2025-06-08 06:13:33] [INFO ] Computed 24 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:34] [INFO ] Implicit Places using invariants in 1148 ms returned [126]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/285 places, 1345/52780 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7533 ms. Remains : 168/285 places, 1345/52780 transitions.
Support contains 26 out of 168 places after structural reductions.
[2025-06-08 06:13:34] [INFO ] Flatten gal took : 341 ms
[2025-06-08 06:13:34] [INFO ] Flatten gal took : 192 ms
[2025-06-08 06:13:35] [INFO ] Input system was already deterministic with 1345 transitions.
RANDOM walk for 40000 steps (8 resets) in 1990 ms. (20 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
// Phase 1: matrix 1345 rows 168 cols
[2025-06-08 06:13:36] [INFO ] Computed 23 invariants in 29 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/84 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/168 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1345/1513 variables, 168/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1513 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1513 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1513/1513 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 168/168 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/84 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 168/1513 variables, and 23 constraints, problems are : Problem set: 1 solved, 0 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 27 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(p0)))'
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 1345/1345 transitions.
Graph (trivial) has 128 edges and 168 vertex of which 6 / 168 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 164 transition count 1325
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 148 transition count 1325
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 33 place count 148 transition count 1311
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 61 place count 134 transition count 1311
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 78 place count 117 transition count 532
Ensure Unique test removed 3 places
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 114 transition count 532
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 114 transition count 530
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 100 place count 114 transition count 525
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 109 transition count 525
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 103 transition count 149
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 102 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 99 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 99 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 98 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 98 transition count 135
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 215 place count 56 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 218 place count 53 transition count 82
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 223 place count 51 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 51 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 226 place count 49 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 49 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 240 place count 43 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 256 place count 43 transition count 66
Applied a total of 256 rules in 153 ms. Remains 43 /168 variables (removed 125) and now considering 66/1345 (removed 1279) transitions.
[2025-06-08 06:13:37] [INFO ] Flow matrix only has 45 transitions (discarded 21 similar events)
// Phase 1: matrix 45 rows 43 cols
[2025-06-08 06:13:37] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:37] [INFO ] Implicit Places using invariants in 42 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/168 places, 66/1345 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 64
Applied a total of 4 rules in 4 ms. Remains 40 /42 variables (removed 2) and now considering 64/66 (removed 2) transitions.
[2025-06-08 06:13:37] [INFO ] Flow matrix only has 43 transitions (discarded 21 similar events)
// Phase 1: matrix 43 rows 40 cols
[2025-06-08 06:13:37] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 06:13:37] [INFO ] Flow matrix only has 43 transitions (discarded 21 similar events)
[2025-06-08 06:13:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 06:13:37] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/168 places, 64/1345 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 40/168 places, 64/1345 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLCardinality-00
Stuttering criterion allowed to conclude after 154 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLCardinality-00 finished in 699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1&&(p1 U p2))))))'
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 1345/1345 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 153 transition count 981
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 32 place count 151 transition count 981
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 141 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 53 place count 140 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 56 place count 137 transition count 212
Ensure Unique test removed 2 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 61 place count 135 transition count 212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 64 place count 132 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 132 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 68 place count 131 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 69 place count 131 transition count 184
Applied a total of 69 rules in 26 ms. Remains 131 /168 variables (removed 37) and now considering 184/1345 (removed 1161) transitions.
// Phase 1: matrix 184 rows 131 cols
[2025-06-08 06:13:37] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:37] [INFO ] Implicit Places using invariants in 56 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/168 places, 184/1345 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 130/168 places, 184/1345 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLCardinality-04 finished in 408 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((G(p0)||X(X(F(p1)))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 1345/1345 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 153 transition count 981
Ensure Unique test removed 2 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 32 place count 151 transition count 981
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 141 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 53 place count 140 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 135 transition count 208
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 65 place count 133 transition count 208
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 68 place count 130 transition count 182
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 130 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 73 place count 128 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 75 place count 128 transition count 178
Applied a total of 75 rules in 27 ms. Remains 128 /168 variables (removed 40) and now considering 178/1345 (removed 1167) transitions.
// Phase 1: matrix 178 rows 128 cols
[2025-06-08 06:13:37] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:38] [INFO ] Implicit Places using invariants in 59 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/168 places, 178/1345 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 127/168 places, 178/1345 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLCardinality-06
Product exploration explored 100000 steps with 584 reset in 256 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLCardinality-06 finished in 495 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((X(X(X((!p0 U p1))))||(F(p2) U p3))))'
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 1345/1345 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 154 transition count 975
Ensure Unique test removed 3 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 31 place count 151 transition count 975
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 41 place count 141 transition count 249
Iterating global reduction 0 with 10 rules applied. Total rules applied 51 place count 141 transition count 249
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 56 place count 136 transition count 225
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 63 place count 134 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 66 place count 131 transition count 185
Iterating global reduction 0 with 3 rules applied. Total rules applied 69 place count 131 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 70 place count 130 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 71 place count 130 transition count 183
Applied a total of 71 rules in 22 ms. Remains 130 /168 variables (removed 38) and now considering 183/1345 (removed 1162) transitions.
// Phase 1: matrix 183 rows 130 cols
[2025-06-08 06:13:38] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:38] [INFO ] Implicit Places using invariants in 55 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 183/1345 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 129/168 places, 183/1345 transitions.
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLCardinality-10
Product exploration explored 100000 steps with 11 reset in 176 ms.
Product exploration explored 100000 steps with 9 reset in 183 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
// Phase 1: matrix 183 rows 129 cols
[2025-06-08 06:13:40] [INFO ] Computed 17 invariants in 1 ms
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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 63/129 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 183/312 variables, 129/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 146 constraints, problems are : Problem set: 0 solved, 6 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/35 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/66 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem apf5 is UNSAT
At refinement iteration 5 (OVERLAPS) 63/129 variables, 10/17 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:40] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 129/312 variables, and 20 constraints, problems are : Problem set: 6 solved, 0 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/129 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 558ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (G (OR p1 p2 (NOT p0) p3)), (G (OR p2 p3)), (G (OR p1 p2 (NOT p0))), (G (OR p1 p0 p3)), (G (OR p1 p2 p0 p3)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p0) p3))), (F (NOT p2)), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 290 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Support contains 4 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 183/183 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2025-06-08 06:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-08 06:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:13:41] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-06-08 06:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:43] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:43] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/312 variables, 129/149 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 150 constraints, problems are : Problem set: 0 solved, 182 unsolved in 9167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:51] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/312 variables, 129/151 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 182/333 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:53] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:53] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:53] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:53] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 13/346 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:57] [INFO ] Deduced a trap along path composed of 7 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:57] [INFO ] Deduced a trap along path composed of 11 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:13:57] [INFO ] Deduced a trap along path composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/312 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 349 constraints, problems are : Problem set: 0 solved, 182 unsolved in 21119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 30337ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 30340ms
Finished structural reductions in LTL mode , in 1 iterations and 30532 ms. Remains : 129/129 places, 183/183 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p3 p1), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
RANDOM walk for 33103 steps (7 resets) in 180 ms. (182 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p3 p1), (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT (OR p1 p3))), (F (NOT p1)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 9 reset in 146 ms.
Product exploration explored 100000 steps with 10 reset in 153 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 183/183 transitions.
Graph (trivial) has 104 edges and 129 vertex of which 6 / 129 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 126 transition count 180
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 11 place count 126 transition count 197
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 24 place count 126 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 118 transition count 189
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 118 transition count 189
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 117 transition count 187
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 117 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 116 transition count 183
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 116 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 115 transition count 181
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 115 transition count 181
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 85 place count 115 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 98 place count 102 transition count 153
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 111 place count 102 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 102 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 100 transition count 149
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 100 transition count 149
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 128 place count 100 transition count 181
Deduced a syphon composed of 54 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 169 place count 100 transition count 140
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 179 place count 90 transition count 130
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 189 place count 90 transition count 130
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 189 rules in 41 ms. Remains 90 /129 variables (removed 39) and now considering 130/183 (removed 53) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 06:14:14] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2025-06-08 06:14:14] [INFO ] Flow matrix only has 114 transitions (discarded 16 similar events)
// Phase 1: matrix 114 rows 90 cols
[2025-06-08 06:14:14] [INFO ] Computed 17 invariants in 1 ms
[2025-06-08 06:14:14] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 06:14:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 16/33 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 113/203 variables, 90/123 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 24/147 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/147 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/148 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/148 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/148 constraints. Problems are: Problem set: 63 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 148 constraints, problems are : Problem set: 63 solved, 66 unsolved in 3543 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 15/60 variables, 7/7 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 16/23 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/23 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 30/90 variables, 10/33 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 113/203 variables, 90/123 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 24/147 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 66/213 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/213 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 1/204 variables, 1/214 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/214 constraints. Problems are: Problem set: 63 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/214 constraints. Problems are: Problem set: 63 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 214 constraints, problems are : Problem set: 63 solved, 66 unsolved in 5303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 90/90 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 66/129 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8877ms problems are : Problem set: 63 solved, 66 unsolved
Search for dead transitions found 63 dead transitions in 8877ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 90/129 places, 67/183 transitions.
Graph (complete) has 264 edges and 90 vertex of which 46 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 46 /90 variables (removed 44) and now considering 80/67 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/129 places, 80/183 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8935 ms. Remains : 46/129 places, 80/183 transitions.
Built C files in :
/tmp/ltsmin11808567359173431628
[2025-06-08 06:14:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11808567359173431628
Running compilation step : cd /tmp/ltsmin11808567359173431628;'/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 425 ms.
Running link step : cd /tmp/ltsmin11808567359173431628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11808567359173431628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7631850756966701121.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 183/183 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 126 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 125 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 125 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 124 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 124 transition count 173
Applied a total of 10 rules in 11 ms. Remains 124 /129 variables (removed 5) and now considering 173/183 (removed 10) transitions.
// Phase 1: matrix 173 rows 124 cols
[2025-06-08 06:14:38] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:14:38] [INFO ] Implicit Places using invariants in 59 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/129 places, 173/183 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 123/129 places, 173/183 transitions.
Built C files in :
/tmp/ltsmin12499332567965757014
[2025-06-08 06:14:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12499332567965757014
Running compilation step : cd /tmp/ltsmin12499332567965757014;'/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 275 ms.
Running link step : cd /tmp/ltsmin12499332567965757014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12499332567965757014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6296357352280056543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 06:14:53] [INFO ] Flatten gal took : 6 ms
[2025-06-08 06:14:53] [INFO ] Flatten gal took : 5 ms
[2025-06-08 06:14:53] [INFO ] Time to serialize gal into /tmp/LTL2055947681726204529.gal : 3 ms
[2025-06-08 06:14:53] [INFO ] Time to serialize properties into /tmp/LTL4551615358313739722.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/LTL2055947681726204529.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4511084149088362495.hoa' '-atoms' '/tmp/LTL4551615358313739722.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...317
Loading property file /tmp/LTL4551615358313739722.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4511084149088362495.hoa
Detected timeout of ITS tools.
[2025-06-08 06:15:08] [INFO ] Flatten gal took : 6 ms
[2025-06-08 06:15:08] [INFO ] Flatten gal took : 5 ms
[2025-06-08 06:15:08] [INFO ] Time to serialize gal into /tmp/LTL18046989328895240714.gal : 6 ms
[2025-06-08 06:15:08] [INFO ] Time to serialize properties into /tmp/LTL16629152238677100262.ltl : 5 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/LTL18046989328895240714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16629152238677100262.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 : !((G((X(X(X((!("((p109==0)||(p153==1))"))U("((p279==0)||(p273==1))")))))||((F("((p188==0)||(p279==1))"))U("((p103==0)||(p62==1))")))))
Formula 0 simplified : F(XXX("((p109==0)||(p153==1))" R !"((p279==0)||(p273==1))") & (G!"((p188==0)||(p279==1))" R !"((p103==0)||(p62==1))"))
Detected timeout of ITS tools.
[2025-06-08 06:15:23] [INFO ] Flatten gal took : 22 ms
[2025-06-08 06:15:23] [INFO ] Applying decomposition
[2025-06-08 06:15:23] [INFO ] Flatten gal took : 6 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/graph16915637307203020538.txt' '-o' '/tmp/graph16915637307203020538.bin' '-w' '/tmp/graph16915637307203020538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16915637307203020538.bin' '-l' '-1' '-v' '-w' '/tmp/graph16915637307203020538.weights' '-q' '0' '-e' '0.001'
[2025-06-08 06:15:24] [INFO ] Decomposing Gal with order
[2025-06-08 06:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 06:15:24] [INFO ] Removed a total of 276 redundant transitions.
[2025-06-08 06:15:24] [INFO ] Flatten gal took : 49 ms
[2025-06-08 06:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2025-06-08 06:15:24] [INFO ] Time to serialize gal into /tmp/LTL3695078201533238380.gal : 4 ms
[2025-06-08 06:15:24] [INFO ] Time to serialize properties into /tmp/LTL4438112966027746575.ltl : 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/LTL3695078201533238380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4438112966027746575.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 : !((G((X(X(X((!("((i6.u12.p109==0)||(i8.u15.p153==1))"))U("((i10.i2.u36.p279==0)||(i10.i2.u35.p273==1))")))))||((F("((i9.u20.p188==0)||...216
Formula 0 simplified : F(XXX("((i6.u12.p109==0)||(i8.u15.p153==1))" R !"((i10.i2.u36.p279==0)||(i10.i2.u35.p273==1))") & (G!"((i9.u20.p188==0)||(i10.i2.u36...202
Reverse transition relation is NOT exact ! Due to transitions t23, t1214, u18.t67, u18.t68, u18.t916, u9.t104, u9.t105, u9.t106, u9.t910, u9.t911, u11.t91,...645
62 unique states visited
62 strongly connected components in search stack
63 transitions explored
62 items max in DFS search stack
72 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.751615,41724,1,0,50849,1530,2800,70590,424,5487,119576
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV0-PT-1007-LTLCardinality-10 finished in 106555 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 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 1345/1345 transitions.
Graph (trivial) has 127 edges and 168 vertex of which 6 / 168 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 164 transition count 1325
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 148 transition count 1325
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 33 place count 148 transition count 1311
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 61 place count 134 transition count 1311
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 78 place count 117 transition count 532
Ensure Unique test removed 3 places
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 114 transition count 532
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 114 transition count 530
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 100 place count 114 transition count 525
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 109 transition count 525
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 103 transition count 149
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 102 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 99 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 99 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 98 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 98 transition count 135
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 215 place count 56 transition count 93
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 219 place count 52 transition count 81
Ensure Unique test removed 3 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 226 place count 49 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 49 transition count 80
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 230 place count 46 transition count 73
Iterating global reduction 4 with 3 rules applied. Total rules applied 233 place count 46 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 45 transition count 72
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 249 place count 38 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 266 place count 38 transition count 71
Applied a total of 266 rules in 85 ms. Remains 38 /168 variables (removed 130) and now considering 71/1345 (removed 1274) transitions.
[2025-06-08 06:15:25] [INFO ] Flow matrix only has 48 transitions (discarded 23 similar events)
// Phase 1: matrix 48 rows 38 cols
[2025-06-08 06:15:25] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:15:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-08 06:15:25] [INFO ] Flow matrix only has 48 transitions (discarded 23 similar events)
[2025-06-08 06:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 06:15:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 06:15:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 06:15:25] [INFO ] Redundant transitions in 0 ms returned []
Running 67 sub problems to find dead transitions.
[2025-06-08 06:15:25] [INFO ] Flow matrix only has 48 transitions (discarded 23 similar events)
[2025-06-08 06:15:25] [INFO ] Invariant cache hit.
[2025-06-08 06:15:25] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 47/85 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 1/86 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 70 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 47/85 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 67/136 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 137 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 38/38 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 3055ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/168 places, 71/1345 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3228 ms. Remains : 38/168 places, 71/1345 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1007-LTLCardinality-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1007-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1007-LTLCardinality-14 finished in 3284 ms.
All properties solved by simple procedures.
Total runtime 124824 ms.

BK_STOP 1749363328308

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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