About the Execution of ITS-Tools for Peterson-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?FFFFFFFTFFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812900580.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 Peterson-COL-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812900580
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Peterson-COL-6-LTLFireability-00
FORMULA_NAME Peterson-COL-6-LTLFireability-01
FORMULA_NAME Peterson-COL-6-LTLFireability-02
FORMULA_NAME Peterson-COL-6-LTLFireability-03
FORMULA_NAME Peterson-COL-6-LTLFireability-04
FORMULA_NAME Peterson-COL-6-LTLFireability-05
FORMULA_NAME Peterson-COL-6-LTLFireability-06
FORMULA_NAME Peterson-COL-6-LTLFireability-07
FORMULA_NAME Peterson-COL-6-LTLFireability-08
FORMULA_NAME Peterson-COL-6-LTLFireability-09
FORMULA_NAME Peterson-COL-6-LTLFireability-10
FORMULA_NAME Peterson-COL-6-LTLFireability-11
FORMULA_NAME Peterson-COL-6-LTLFireability-12
FORMULA_NAME Peterson-COL-6-LTLFireability-13
FORMULA_NAME Peterson-COL-6-LTLFireability-14
FORMULA_NAME Peterson-COL-6-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748931352936
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-03 06:15:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 06:15:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:15:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 06:15:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 06:15:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2025-06-03 06:15:54] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 06:15:54] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2025-06-03 06:15:54] [INFO ] Skeletonized 14 HLPN properties in 1 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-COL-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 753 steps (0 resets) in 21 ms. (34 steps per ms) remains 0/9 properties
[2025-06-03 06:15:55] [INFO ] Flatten gal took : 12 ms
[2025-06-03 06:15:55] [INFO ] Flatten gal took : 2 ms
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-03 06:15:55] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 47 ms.
[2025-06-03 06:15:55] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 42 places in 17 ms
Reduce places removed 42 places and 84 transitions.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 29 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:15:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:15:55] [INFO ] Computed 27 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:55] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-06-03 06:15:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:15:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 06:15:56] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 06:15:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:15:56] [INFO ] Invariant cache hit.
[2025-06-03 06:15:56] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30803ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30822ms
Finished structural reductions in LTL mode , in 1 iterations and 32027 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1330 out of 1330 places after structural reductions.
[2025-06-03 06:16:27] [INFO ] Flatten gal took : 162 ms
[2025-06-03 06:16:28] [INFO ] Flatten gal took : 126 ms
[2025-06-03 06:16:28] [INFO ] Input system was already deterministic with 2030 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 40000 steps (8 resets) in 1845 ms. (21 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1015 ms. (39 steps per ms) remains 2/2 properties
[2025-06-03 06:16:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:16:29] [INFO ] Invariant cache hit.
[2025-06-03 06:16:29] [INFO ] State equation strengthened by 330 read => feed constraints.
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/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1190/1323 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1323 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/1330 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1820/3150 variables, 1330/1357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3150 variables, 330/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 1687 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2383 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1190/1323 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:33] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:33] [INFO ] Deduced a trap composed of 41 places in 503 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:34] [INFO ] Deduced a trap composed of 57 places in 487 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:34] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:35] [INFO ] Deduced a trap composed of 118 places in 479 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:35] [INFO ] Deduced a trap composed of 117 places in 491 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:36] [INFO ] Deduced a trap composed of 118 places in 464 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:36] [INFO ] Deduced a trap composed of 125 places in 479 ms of which 127 ms to minimize.
SMT process timed out in 7474ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 133 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1152 place count 754 transition count 1196
Deduced a syphon composed of 258 places in 7 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1668 place count 496 transition count 1196
Applied a total of 1668 rules in 211 ms. Remains 496 /1330 variables (removed 834) and now considering 1196/2030 (removed 834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 496/1330 places, 1196/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 764 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 982 ms. (40 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 528 steps, run visited all 2 properties in 20 ms. (steps per millisecond=26 )
Probabilistic random walk after 528 steps, saw 464 distinct states, run finished after 24 ms. (steps per millisecond=22 ) properties seen :2
FORMULA Peterson-COL-6-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Peterson-COL-6-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p1)))||p0)))'
Support contains 91 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 79 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:16:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:16:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:39] [INFO ] Implicit Places using invariants in 832 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 838 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 27 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 944 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-COL-6-LTLFireability-00
Product exploration explored 100000 steps with 16612 reset in 596 ms.
Product exploration explored 100000 steps with 16674 reset in 494 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 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 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 986 steps (0 resets) in 9 ms. (98 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 99 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 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 91 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:16:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 06:16:41] [INFO ] Computed 20 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:42] [INFO ] Implicit Places using invariants in 756 ms returned []
[2025-06-03 06:16:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:16:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 06:16:48] [INFO ] Implicit Places using invariants and state equation in 6584 ms returned []
Implicit Place search using SMT with State Equation took 7359 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 06:16:48] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:16:48] [INFO ] Invariant cache hit.
[2025-06-03 06:16:48] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:22] [INFO ] Deduced a trap composed of 15 places in 596 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:23] [INFO ] Deduced a trap composed of 19 places in 542 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:23] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:24] [INFO ] Deduced a trap composed of 27 places in 495 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:24] [INFO ] Deduced a trap composed of 31 places in 491 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:25] [INFO ] Deduced a trap composed of 35 places in 489 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:25] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:26] [INFO ] Deduced a trap composed of 50 places in 575 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:26] [INFO ] Deduced a trap composed of 53 places in 558 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:27] [INFO ] Deduced a trap composed of 54 places in 526 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:27] [INFO ] Deduced a trap composed of 58 places in 520 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:28] [INFO ] Deduced a trap composed of 65 places in 470 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:29] [INFO ] Deduced a trap composed of 16 places in 498 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:29] [INFO ] Deduced a trap composed of 45 places in 490 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:30] [INFO ] Deduced a trap composed of 16 places in 494 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:30] [INFO ] Deduced a trap composed of 20 places in 504 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:31] [INFO ] Deduced a trap composed of 61 places in 475 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:31] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:32] [INFO ] Deduced a trap composed of 41 places in 485 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:32] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 39 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:35] [INFO ] Deduced a trap composed of 49 places in 530 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:35] [INFO ] Deduced a trap composed of 50 places in 600 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:36] [INFO ] Deduced a trap composed of 50 places in 565 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:37] [INFO ] Deduced a trap composed of 80 places in 512 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:37] [INFO ] Deduced a trap composed of 110 places in 485 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:37] [INFO ] Deduced a trap composed of 114 places in 426 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:38] [INFO ] Deduced a trap composed of 118 places in 356 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:38] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:39] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:39] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:40] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:40] [INFO ] Deduced a trap composed of 49 places in 496 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:41] [INFO ] Deduced a trap composed of 41 places in 523 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:41] [INFO ] Deduced a trap composed of 88 places in 385 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:42] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:42] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:43] [INFO ] Deduced a trap composed of 27 places in 463 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:43] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:44] [INFO ] Deduced a trap composed of 35 places in 467 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:44] [INFO ] Deduced a trap composed of 50 places in 504 ms of which 76 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1323 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:46] [INFO ] Deduced a trap composed of 53 places in 572 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:47] [INFO ] Deduced a trap composed of 79 places in 536 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:48] [INFO ] Deduced a trap composed of 79 places in 543 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:48] [INFO ] Deduced a trap composed of 87 places in 542 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:49] [INFO ] Deduced a trap composed of 80 places in 541 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:49] [INFO ] Deduced a trap composed of 80 places in 545 ms of which 119 ms to minimize.
SMT process timed out in 60929ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 60935ms
Finished structural reductions in LTL mode , in 1 iterations and 68345 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 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 198 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 915 steps (0 resets) in 11 ms. (76 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 137 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 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16785 reset in 411 ms.
Product exploration explored 100000 steps with 16595 reset in 428 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 91 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1323 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 329 place count 1323 transition count 2030
Deduced a syphon composed of 588 places in 1 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 588 place count 1323 transition count 2030
Discarding 330 places :
Symmetric choice reduction at 1 with 330 rule applications. Total rules 918 place count 993 transition count 1700
Deduced a syphon composed of 258 places in 1 ms
Iterating global reduction 1 with 330 rules applied. Total rules applied 1248 place count 993 transition count 1700
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 580 places in 1 ms
Iterating global reduction 1 with 322 rules applied. Total rules applied 1570 place count 993 transition count 1700
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1862 place count 701 transition count 1408
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 2154 place count 701 transition count 1408
Deduced a syphon composed of 288 places in 0 ms
Applied a total of 2154 rules in 301 ms. Remains 701 /1323 variables (removed 622) and now considering 1408/2030 (removed 622) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:17:52] [INFO ] Redundant transitions in 86 ms returned []
Running 1401 sub problems to find dead transitions.
[2025-06-03 06:17:52] [INFO ] Flow matrix only has 1198 transitions (discarded 210 similar events)
// Phase 1: matrix 1198 rows 701 cols
[2025-06-03 06:17:52] [INFO ] Computed 20 invariants in 9 ms
[2025-06-03 06:17:52] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:07] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:07] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:07] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:08] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:08] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:08] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:09] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:10] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:10] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:11] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:11] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:12] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:12] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:12] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:12] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:13] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:13] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:13] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:13] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:14] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 19 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:14] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:15] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:15] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:15] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:15] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:16] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:16] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:16] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:16] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:17] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:17] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:17] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:18] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:18] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:18] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:19] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:19] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:19] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:21] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:21] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:22] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/1899 variables, and 61 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/701 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:24] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:24] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:24] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:25] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:25] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:26] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:26] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:28] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:29] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:29] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:29] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:29] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:30] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:30] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:31] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:31] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:31] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:31] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:31] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:32] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:32] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:33] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:33] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:33] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:33] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:34] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:34] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:34] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:34] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:35] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:35] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:35] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:35] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:35] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:35] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:36] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:36] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:36] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:36] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:37] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/701 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:38] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:38] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:38] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:38] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:39] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:39] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:39] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:39] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:40] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:40] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:40] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:43] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:44] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:44] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:44] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:45] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:45] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:46] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:46] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:46] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:47] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:47] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:47] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:48] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/1899 variables, and 128 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/701 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 108/108 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in SI_LTL mode, iteration 1 : 701/1323 places, 1408/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60759 ms. Remains : 701/1323 places, 1408/2030 transitions.
Built C files in :
/tmp/ltsmin8901282494964139484
[2025-06-03 06:18:52] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8901282494964139484
Running compilation step : cd /tmp/ltsmin8901282494964139484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8901282494964139484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8901282494964139484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 91 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:18:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 06:18:55] [INFO ] Computed 20 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:56] [INFO ] Implicit Places using invariants in 790 ms returned []
[2025-06-03 06:18:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 06:19:03] [INFO ] Implicit Places using invariants and state equation in 6727 ms returned []
Implicit Place search using SMT with State Equation took 7521 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 06:19:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:19:03] [INFO ] Invariant cache hit.
[2025-06-03 06:19:03] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:36] [INFO ] Deduced a trap composed of 15 places in 561 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:37] [INFO ] Deduced a trap composed of 19 places in 557 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:38] [INFO ] Deduced a trap composed of 23 places in 519 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:38] [INFO ] Deduced a trap composed of 27 places in 497 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:39] [INFO ] Deduced a trap composed of 31 places in 463 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:39] [INFO ] Deduced a trap composed of 35 places in 454 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:40] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:40] [INFO ] Deduced a trap composed of 50 places in 541 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:41] [INFO ] Deduced a trap composed of 53 places in 534 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:41] [INFO ] Deduced a trap composed of 54 places in 503 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:42] [INFO ] Deduced a trap composed of 58 places in 499 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:42] [INFO ] Deduced a trap composed of 65 places in 472 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:43] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:43] [INFO ] Deduced a trap composed of 45 places in 475 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:44] [INFO ] Deduced a trap composed of 16 places in 493 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:44] [INFO ] Deduced a trap composed of 20 places in 465 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:45] [INFO ] Deduced a trap composed of 61 places in 445 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:45] [INFO ] Deduced a trap composed of 16 places in 496 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:46] [INFO ] Deduced a trap composed of 41 places in 472 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:47] [INFO ] Deduced a trap composed of 16 places in 518 ms of which 41 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:49] [INFO ] Deduced a trap composed of 49 places in 577 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:50] [INFO ] Deduced a trap composed of 50 places in 557 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:50] [INFO ] Deduced a trap composed of 50 places in 557 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:51] [INFO ] Deduced a trap composed of 80 places in 530 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:51] [INFO ] Deduced a trap composed of 110 places in 489 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:52] [INFO ] Deduced a trap composed of 114 places in 439 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:52] [INFO ] Deduced a trap composed of 118 places in 381 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:53] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:53] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:53] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:54] [INFO ] Deduced a trap composed of 35 places in 436 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:54] [INFO ] Deduced a trap composed of 49 places in 472 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:55] [INFO ] Deduced a trap composed of 41 places in 530 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:55] [INFO ] Deduced a trap composed of 88 places in 393 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:56] [INFO ] Deduced a trap composed of 16 places in 490 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:57] [INFO ] Deduced a trap composed of 23 places in 447 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:57] [INFO ] Deduced a trap composed of 27 places in 456 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:58] [INFO ] Deduced a trap composed of 31 places in 442 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:58] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:19:59] [INFO ] Deduced a trap composed of 50 places in 477 ms of which 75 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1323 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:20:01] [INFO ] Deduced a trap composed of 53 places in 540 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:20:01] [INFO ] Deduced a trap composed of 79 places in 533 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:20:02] [INFO ] Deduced a trap composed of 79 places in 517 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:20:02] [INFO ] Deduced a trap composed of 87 places in 528 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:20:03] [INFO ] Deduced a trap composed of 80 places in 545 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:20:03] [INFO ] Deduced a trap composed of 80 places in 525 ms of which 114 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/3143 variables, and 66 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/2023 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60540ms problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Finished structural reductions in LTL mode , in 1 iterations and 68108 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin1954414945763861285
[2025-06-03 06:20:04] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1954414945763861285
Running compilation step : cd /tmp/ltsmin1954414945763861285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1954414945763861285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1954414945763861285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 06:20:07] [INFO ] Flatten gal took : 56 ms
[2025-06-03 06:20:07] [INFO ] Flatten gal took : 55 ms
[2025-06-03 06:20:07] [INFO ] Time to serialize gal into /tmp/LTL13039690240353925341.gal : 16 ms
[2025-06-03 06:20:07] [INFO ] Time to serialize properties into /tmp/LTL11245533244723062636.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/LTL13039690240353925341.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7195018704723153464.hoa' '-atoms' '/tmp/LTL11245533244723062636.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11245533244723062636.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7195018704723153464.hoa
Detected timeout of ITS tools.
[2025-06-03 06:20:22] [INFO ] Flatten gal took : 80 ms
[2025-06-03 06:20:22] [INFO ] Flatten gal took : 54 ms
[2025-06-03 06:20:22] [INFO ] Time to serialize gal into /tmp/LTL18293937488700382642.gal : 12 ms
[2025-06-03 06:20:22] [INFO ] Time to serialize properties into /tmp/LTL17886062943095407140.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/LTL18293937488700382642.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17886062943095407140.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("((((EndTurn_29<1)&&(EndTurn_11<1))&&((EndTurn_41<1)&&(EndTurn_23<1)))&&(((EndTurn_5<1)&&(EndTurn_35<1))&&(EndTurn_17...1677
Formula 0 simplified : F(!"((((((Turn_23>=1)&&(TestTurn_15>=1))||((Turn_34>=1)&&(TestTurn_40>=1)))||(((Turn_15>=1)&&(TestTurn_8>=1))||((Turn_36>=1)&&(TestT...1657
Detected timeout of ITS tools.
[2025-06-03 06:20:37] [INFO ] Flatten gal took : 45 ms
[2025-06-03 06:20:37] [INFO ] Applying decomposition
[2025-06-03 06:20:37] [INFO ] Flatten gal took : 47 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/graph11829836217613812777.txt' '-o' '/tmp/graph11829836217613812777.bin' '-w' '/tmp/graph11829836217613812777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11829836217613812777.bin' '-l' '-1' '-v' '-w' '/tmp/graph11829836217613812777.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:20:37] [INFO ] Decomposing Gal with order
[2025-06-03 06:20:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:20:38] [INFO ] Removed a total of 1792 redundant transitions.
[2025-06-03 06:20:38] [INFO ] Flatten gal took : 130 ms
[2025-06-03 06:20:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2025-06-03 06:20:38] [INFO ] Time to serialize gal into /tmp/LTL9319085965736190805.gal : 19 ms
[2025-06-03 06:20:38] [INFO ] Time to serialize properties into /tmp/LTL9605329616269447801.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/LTL9319085965736190805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9605329616269447801.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.i0.i1.u218.EndTurn_29<1)&&(i6.i0.i1.u209.EndTurn_11<1))&&((i6.i0.i1.u224.EndTurn_41<1)&&(i6.i0.i1.u215.EndTur...2780
Formula 0 simplified : F(!"((((((i6.i0.i1.u224.Turn_41>=1)&&(i6.i0.i1.u224.TestTurn_41>=1))||((i1.u24.Turn_6>=1)&&(i1.u24.TestTurn_36>=1)))||(((i6.i0.i1.u2...2760
Detected timeout of ITS tools.
Treatment of property Peterson-COL-6-LTLFireability-00 finished in 255082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||X(G(p2))))'
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:20:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:20:53] [INFO ] Computed 27 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:54] [INFO ] Implicit Places using invariants in 556 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 559 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 602 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-02 finished in 891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1))||G(F(p2))) U (p2 U p0)))'
Support contains 420 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 600 place count 1030 transition count 1723
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 614 place count 1023 transition count 1723
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 686 place count 987 transition count 1687
Applied a total of 686 rules in 152 ms. Remains 987 /1330 variables (removed 343) and now considering 1687/2030 (removed 343) transitions.
[2025-06-03 06:20:54] [INFO ] Flow matrix only has 1477 transitions (discarded 210 similar events)
// Phase 1: matrix 1477 rows 987 cols
[2025-06-03 06:20:54] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:55] [INFO ] Implicit Places using invariants in 556 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 559 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1330 places, 1687/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 980 /980 variables (removed 0) and now considering 1687/1687 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 747 ms. Remains : 980/1330 places, 1687/2030 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-03
Product exploration explored 100000 steps with 7140 reset in 1882 ms.
Stack based approach found an accepted trace after 3008 steps with 282 reset with depth 44 and stack size 44 in 68 ms.
FORMULA Peterson-COL-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-03 finished in 3004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1) U X(!p2))))'
Support contains 126 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 28 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:20:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:20:57] [INFO ] Computed 27 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:58] [INFO ] Implicit Places using invariants in 829 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 838 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 33 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 902 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 305 ms :[p2, p2, p2, (AND p1 (NOT p0) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-06
Product exploration explored 100000 steps with 4223 reset in 817 ms.
Stack based approach found an accepted trace after 7342 steps with 312 reset with depth 29 and stack size 29 in 63 ms.
FORMULA Peterson-COL-6-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-06 finished in 2128 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(((p1 U p2)||p0))))'
Support contains 343 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1330 transition count 1694
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 994 transition count 1694
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 672 place count 994 transition count 1400
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1260 place count 700 transition count 1400
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 2 with 84 rules applied. Total rules applied 1344 place count 658 transition count 1358
Applied a total of 1344 rules in 70 ms. Remains 658 /1330 variables (removed 672) and now considering 1358/2030 (removed 672) transitions.
[2025-06-03 06:20:59] [INFO ] Flow matrix only has 1148 transitions (discarded 210 similar events)
// Phase 1: matrix 1148 rows 658 cols
[2025-06-03 06:20:59] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:59] [INFO ] Implicit Places using invariants in 178 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 186 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 651/1330 places, 1358/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 651 /651 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 651/1330 places, 1358/2030 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 2255 ms.
Stack based approach found an accepted trace after 1157 steps with 0 reset with depth 1158 and stack size 1134 in 32 ms.
FORMULA Peterson-COL-6-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-07 finished in 2669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1))) U X(X(!p2))))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:21:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:21:02] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:03] [INFO ] Implicit Places using invariants in 1255 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1258 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1300 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 498 ms :[p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p1) p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 1165 ms.
Product exploration explored 100000 steps with 33333 reset in 1124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (OR (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-6-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-6-LTLFireability-08 finished in 4151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(F(!p1))))))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 75 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:21:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:07] [INFO ] Implicit Places using invariants in 824 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 829 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 938 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 211 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-09
Product exploration explored 100000 steps with 110 reset in 2256 ms.
Stack based approach found an accepted trace after 402 steps with 0 reset with depth 403 and stack size 403 in 9 ms.
FORMULA Peterson-COL-6-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-09 finished in 3439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G((p1 U p0))))))'
Support contains 126 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 1330 transition count 1562
Reduce places removed 468 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 510 rules applied. Total rules applied 978 place count 862 transition count 1520
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1020 place count 820 transition count 1520
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 1020 place count 820 transition count 1226
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1608 place count 526 transition count 1226
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 62 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
[2025-06-03 06:21:09] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2025-06-03 06:21:09] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:10] [INFO ] Implicit Places using invariants in 312 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 313 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/1330 places, 1190/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 483 /483 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 483/1330 places, 1190/2030 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-10
Product exploration explored 100000 steps with 1633 reset in 2135 ms.
Stack based approach found an accepted trace after 113 steps with 3 reset with depth 27 and stack size 27 in 3 ms.
FORMULA Peterson-COL-6-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-10 finished in 2720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 259 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1330 transition count 1694
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 994 transition count 1694
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 672 place count 994 transition count 1400
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1260 place count 700 transition count 1400
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1344 place count 658 transition count 1358
Applied a total of 1344 rules in 58 ms. Remains 658 /1330 variables (removed 672) and now considering 1358/2030 (removed 672) transitions.
[2025-06-03 06:21:12] [INFO ] Flow matrix only has 1148 transitions (discarded 210 similar events)
// Phase 1: matrix 1148 rows 658 cols
[2025-06-03 06:21:12] [INFO ] Computed 27 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:12] [INFO ] Implicit Places using invariants in 345 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 347 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 651/1330 places, 1358/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 651 /651 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 651/1330 places, 1358/2030 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Running random walk in product with property : Peterson-COL-6-LTLFireability-11
Product exploration explored 100000 steps with 195 reset in 1226 ms.
Stack based approach found an accepted trace after 16022 steps with 35 reset with depth 556 and stack size 544 in 196 ms.
FORMULA Peterson-COL-6-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-11 finished in 1947 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(F(!p0))||G(!p1))) U (p0&&X((G(F(!p0))||G(!p1)))))))'
Support contains 343 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:21:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:21:14] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:14] [INFO ] Implicit Places using invariants in 372 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 375 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 451 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p0), p0, p0]
Running random walk in product with property : Peterson-COL-6-LTLFireability-12
Product exploration explored 100000 steps with 92 reset in 1308 ms.
Product exploration explored 100000 steps with 91 reset in 1322 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p0), p0, p0]
RANDOM walk for 36680 steps (8 resets) in 737 ms. (49 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p0), p0, p0]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p0), p0, p0]
[2025-06-03 06:21:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 06:21:19] [INFO ] Computed 20 invariants in 12 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-6-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-6-LTLFireability-12 finished in 9692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(!p1)))'
Support contains 91 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 743 transition count 1443
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 288 Pre rules applied. Total rules applied 1174 place count 743 transition count 1155
Deduced a syphon composed of 288 places in 0 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1750 place count 455 transition count 1155
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1820 place count 420 transition count 1120
Applied a total of 1820 rules in 53 ms. Remains 420 /1330 variables (removed 910) and now considering 1120/2030 (removed 910) transitions.
[2025-06-03 06:21:24] [INFO ] Flow matrix only has 910 transitions (discarded 210 similar events)
// Phase 1: matrix 910 rows 420 cols
[2025-06-03 06:21:24] [INFO ] Computed 27 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:24] [INFO ] Implicit Places using invariants in 251 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 253 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/1330 places, 1120/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 413 /413 variables (removed 0) and now considering 1120/1120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 319 ms. Remains : 413/1330 places, 1120/2030 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-13
Product exploration explored 100000 steps with 11974 reset in 1694 ms.
Stack based approach found an accepted trace after 1419 steps with 174 reset with depth 7 and stack size 7 in 25 ms.
FORMULA Peterson-COL-6-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-13 finished in 2147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&(!p1||(X(!p0)&&F(!p1))))))))'
Support contains 56 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 47 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:21:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:21:26] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:27] [INFO ] Implicit Places using invariants in 1212 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1218 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1304 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 442 ms :[p0, p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), true, (AND p1 p0), p1]
Running random walk in product with property : Peterson-COL-6-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 391 ms.
Product exploration explored 100000 steps with 25000 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1379 ms. (28 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 230 steps, run visited all 1 properties in 5 ms. (steps per millisecond=46 )
Probabilistic random walk after 230 steps, saw 204 distinct states, run finished after 5 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 182 ms :[p0, p0, p0, p0, true]
Support contains 42 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:21:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 06:21:30] [INFO ] Computed 20 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:31] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2025-06-03 06:21:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 06:21:37] [INFO ] Implicit Places using invariants and state equation in 5808 ms returned []
Implicit Place search using SMT with State Equation took 6984 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 06:21:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:21:37] [INFO ] Invariant cache hit.
[2025-06-03 06:21:37] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:10] [INFO ] Deduced a trap composed of 15 places in 569 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:11] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:11] [INFO ] Deduced a trap composed of 23 places in 476 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:12] [INFO ] Deduced a trap composed of 27 places in 462 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:12] [INFO ] Deduced a trap composed of 31 places in 485 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:13] [INFO ] Deduced a trap composed of 35 places in 479 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:13] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:14] [INFO ] Deduced a trap composed of 50 places in 531 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:14] [INFO ] Deduced a trap composed of 53 places in 528 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:15] [INFO ] Deduced a trap composed of 54 places in 505 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:15] [INFO ] Deduced a trap composed of 58 places in 519 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:16] [INFO ] Deduced a trap composed of 65 places in 481 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:17] [INFO ] Deduced a trap composed of 16 places in 515 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:17] [INFO ] Deduced a trap composed of 45 places in 499 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:18] [INFO ] Deduced a trap composed of 16 places in 523 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:18] [INFO ] Deduced a trap composed of 20 places in 468 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:19] [INFO ] Deduced a trap composed of 61 places in 470 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:19] [INFO ] Deduced a trap composed of 16 places in 529 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:20] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:20] [INFO ] Deduced a trap composed of 16 places in 506 ms of which 40 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:23] [INFO ] Deduced a trap composed of 49 places in 536 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:23] [INFO ] Deduced a trap composed of 50 places in 578 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:24] [INFO ] Deduced a trap composed of 50 places in 573 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:24] [INFO ] Deduced a trap composed of 80 places in 565 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:25] [INFO ] Deduced a trap composed of 110 places in 486 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:25] [INFO ] Deduced a trap composed of 114 places in 442 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:26] [INFO ] Deduced a trap composed of 118 places in 366 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:26] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:27] [INFO ] Deduced a trap composed of 27 places in 380 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:27] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:28] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:28] [INFO ] Deduced a trap composed of 49 places in 501 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:29] [INFO ] Deduced a trap composed of 41 places in 519 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:29] [INFO ] Deduced a trap composed of 88 places in 361 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:30] [INFO ] Deduced a trap composed of 16 places in 474 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:30] [INFO ] Deduced a trap composed of 23 places in 454 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:31] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:31] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:32] [INFO ] Deduced a trap composed of 35 places in 469 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:32] [INFO ] Deduced a trap composed of 50 places in 501 ms of which 75 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1323 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:34] [INFO ] Deduced a trap composed of 53 places in 563 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:35] [INFO ] Deduced a trap composed of 79 places in 536 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:35] [INFO ] Deduced a trap composed of 79 places in 541 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:36] [INFO ] Deduced a trap composed of 87 places in 537 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:37] [INFO ] Deduced a trap composed of 80 places in 529 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:37] [INFO ] Deduced a trap composed of 80 places in 548 ms of which 116 ms to minimize.
SMT process timed out in 60586ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 60594ms
Finished structural reductions in LTL mode , in 1 iterations and 67629 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 230 steps, run visited all 1 properties in 6 ms. (steps per millisecond=38 )
Probabilistic random walk after 230 steps, saw 204 distinct states, run finished after 6 ms. (steps per millisecond=38 ) properties seen :1
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 416 ms.
Product exploration explored 100000 steps with 25000 reset in 423 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 184 ms :[p0, p0, p0, p0, true]
Support contains 42 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 324 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 324 rules applied. Total rules applied 324 place count 1323 transition count 2030
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 265 Pre rules applied. Total rules applied 324 place count 1323 transition count 2030
Deduced a syphon composed of 589 places in 1 ms
Iterating global reduction 1 with 265 rules applied. Total rules applied 589 place count 1323 transition count 2030
Discarding 324 places :
Symmetric choice reduction at 1 with 324 rule applications. Total rules 913 place count 999 transition count 1706
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 324 rules applied. Total rules applied 1237 place count 999 transition count 1706
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 552 places in 1 ms
Iterating global reduction 1 with 287 rules applied. Total rules applied 1524 place count 999 transition count 1706
Discarding 252 places :
Symmetric choice reduction at 1 with 252 rule applications. Total rules 1776 place count 747 transition count 1454
Deduced a syphon composed of 300 places in 1 ms
Iterating global reduction 1 with 252 rules applied. Total rules applied 2028 place count 747 transition count 1454
Deduced a syphon composed of 300 places in 1 ms
Applied a total of 2028 rules in 205 ms. Remains 747 /1323 variables (removed 576) and now considering 1454/2030 (removed 576) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:22:40] [INFO ] Redundant transitions in 23 ms returned []
Running 1447 sub problems to find dead transitions.
[2025-06-03 06:22:40] [INFO ] Flow matrix only has 1244 transitions (discarded 210 similar events)
// Phase 1: matrix 1244 rows 747 cols
[2025-06-03 06:22:40] [INFO ] Computed 20 invariants in 2 ms
[2025-06-03 06:22:40] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/747 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:56] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:56] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:56] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:56] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:57] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:57] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:57] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:57] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:58] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:58] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:58] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:59] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:59] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:59] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:22:59] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:00] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:00] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:00] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:01] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:01] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/747 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:02] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:02] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:02] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:02] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:03] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:03] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:03] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:03] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:04] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:04] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:04] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:05] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:05] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:05] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:05] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:06] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:06] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:06] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:07] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:07] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:08] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:08] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:08] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:08] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:08] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:09] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:09] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:09] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:10] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:10] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 24 ms to minimize.
SMT process timed out in 30538ms, After SMT, problems are : Problem set: 0 solved, 1447 unsolved
Search for dead transitions found 0 dead transitions in 30541ms
Starting structural reductions in SI_LTL mode, iteration 1 : 747/1323 places, 1454/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30799 ms. Remains : 747/1323 places, 1454/2030 transitions.
Built C files in :
/tmp/ltsmin5971050489709117025
[2025-06-03 06:23:10] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5971050489709117025
Running compilation step : cd /tmp/ltsmin5971050489709117025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5971050489709117025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5971050489709117025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 42 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:23:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2025-06-03 06:23:13] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:14] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2025-06-03 06:23:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:23:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:15] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-03 06:23:23] [INFO ] Implicit Places using invariants and state equation in 8576 ms returned []
Implicit Place search using SMT with State Equation took 9838 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2025-06-03 06:23:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-03 06:23:23] [INFO ] Invariant cache hit.
[2025-06-03 06:23:23] [INFO ] State equation strengthened by 330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3143 variables, and 20 constraints, problems are : Problem set: 0 solved, 2023 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1323 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 2023/2023 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:56] [INFO ] Deduced a trap composed of 15 places in 518 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:57] [INFO ] Deduced a trap composed of 19 places in 521 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:57] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:58] [INFO ] Deduced a trap composed of 27 places in 484 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:58] [INFO ] Deduced a trap composed of 31 places in 467 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:23:59] [INFO ] Deduced a trap composed of 35 places in 465 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:00] [INFO ] Deduced a trap composed of 19 places in 517 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:00] [INFO ] Deduced a trap composed of 50 places in 576 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:01] [INFO ] Deduced a trap composed of 53 places in 559 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:01] [INFO ] Deduced a trap composed of 54 places in 530 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:02] [INFO ] Deduced a trap composed of 58 places in 530 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:02] [INFO ] Deduced a trap composed of 65 places in 471 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:03] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:03] [INFO ] Deduced a trap composed of 45 places in 525 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:04] [INFO ] Deduced a trap composed of 16 places in 500 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:05] [INFO ] Deduced a trap composed of 20 places in 476 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:05] [INFO ] Deduced a trap composed of 61 places in 481 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:06] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:06] [INFO ] Deduced a trap composed of 41 places in 488 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:07] [INFO ] Deduced a trap composed of 16 places in 488 ms of which 39 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1323 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:09] [INFO ] Deduced a trap composed of 49 places in 550 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:10] [INFO ] Deduced a trap composed of 50 places in 542 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:10] [INFO ] Deduced a trap composed of 50 places in 553 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:11] [INFO ] Deduced a trap composed of 80 places in 529 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:11] [INFO ] Deduced a trap composed of 110 places in 527 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:12] [INFO ] Deduced a trap composed of 114 places in 488 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:12] [INFO ] Deduced a trap composed of 118 places in 392 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:13] [INFO ] Deduced a trap composed of 23 places in 383 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:13] [INFO ] Deduced a trap composed of 27 places in 397 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:13] [INFO ] Deduced a trap composed of 31 places in 388 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:14] [INFO ] Deduced a trap composed of 35 places in 453 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:15] [INFO ] Deduced a trap composed of 49 places in 505 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:15] [INFO ] Deduced a trap composed of 41 places in 500 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:16] [INFO ] Deduced a trap composed of 88 places in 422 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:16] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:17] [INFO ] Deduced a trap composed of 23 places in 451 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:17] [INFO ] Deduced a trap composed of 27 places in 443 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:18] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:18] [INFO ] Deduced a trap composed of 35 places in 469 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:19] [INFO ] Deduced a trap composed of 50 places in 529 ms of which 74 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1323 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:21] [INFO ] Deduced a trap composed of 53 places in 538 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:21] [INFO ] Deduced a trap composed of 79 places in 570 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:22] [INFO ] Deduced a trap composed of 79 places in 534 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:22] [INFO ] Deduced a trap composed of 87 places in 539 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:23] [INFO ] Deduced a trap composed of 80 places in 525 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:24:23] [INFO ] Deduced a trap composed of 80 places in 509 ms of which 114 ms to minimize.
SMT process timed out in 60455ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Finished structural reductions in LTL mode , in 1 iterations and 70338 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin2034942771904246319
[2025-06-03 06:24:24] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2034942771904246319
Running compilation step : cd /tmp/ltsmin2034942771904246319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2034942771904246319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2034942771904246319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 06:24:27] [INFO ] Flatten gal took : 46 ms
[2025-06-03 06:24:27] [INFO ] Flatten gal took : 42 ms
[2025-06-03 06:24:27] [INFO ] Time to serialize gal into /tmp/LTL9879201599985840773.gal : 6 ms
[2025-06-03 06:24:27] [INFO ] Time to serialize properties into /tmp/LTL11342687330033205351.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9879201599985840773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16112286637477857616.hoa' '-atoms' '/tmp/LTL11342687330033205351.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11342687330033205351.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16112286637477857616.hoa
Detected timeout of ITS tools.
[2025-06-03 06:24:42] [INFO ] Flatten gal took : 39 ms
[2025-06-03 06:24:42] [INFO ] Flatten gal took : 67 ms
[2025-06-03 06:24:42] [INFO ] Time to serialize gal into /tmp/LTL1855265627611878000.gal : 6 ms
[2025-06-03 06:24:42] [INFO ] Time to serialize properties into /tmp/LTL528792184639768536.ltl : 17 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/LTL1855265627611878000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL528792184639768536.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...274
Read 1 LTL properties
Checking formula 0 : !((X((X(X(!("(((((((IsEndLoop_286>=1)||(IsEndLoop_90>=1))||((IsEndLoop_27>=1)||(IsEndLoop_160>=1)))||(((IsEndLoop_97>=1)||(IsEndLoop_2...4221
Formula 0 simplified : X(XX"(((((((IsEndLoop_286>=1)||(IsEndLoop_90>=1))||((IsEndLoop_27>=1)||(IsEndLoop_160>=1)))||(((IsEndLoop_97>=1)||(IsEndLoop_223>=1)...4176
Detected timeout of ITS tools.
[2025-06-03 06:24:57] [INFO ] Flatten gal took : 36 ms
[2025-06-03 06:24:57] [INFO ] Applying decomposition
[2025-06-03 06:24:57] [INFO ] Flatten gal took : 36 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/graph6847193271260241014.txt' '-o' '/tmp/graph6847193271260241014.bin' '-w' '/tmp/graph6847193271260241014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6847193271260241014.bin' '-l' '-1' '-v' '-w' '/tmp/graph6847193271260241014.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:24:57] [INFO ] Decomposing Gal with order
[2025-06-03 06:24:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:24:57] [INFO ] Removed a total of 1792 redundant transitions.
[2025-06-03 06:24:57] [INFO ] Flatten gal took : 84 ms
[2025-06-03 06:24:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-03 06:24:58] [INFO ] Time to serialize gal into /tmp/LTL2786577068477565132.gal : 12 ms
[2025-06-03 06:24:58] [INFO ] Time to serialize properties into /tmp/LTL17174612645526135543.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/LTL2786577068477565132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17174612645526135543.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...255
Read 1 LTL properties
Checking formula 0 : !((X((X(X(!("(((((((i14.i2.i1.u406.IsEndLoop_286>=1)||(i0.u12.IsEndLoop_90>=1))||((i32.i0.i1.u8.IsEndLoop_27>=1)||(i14.i0.i0.u213.IsEn...6585
Formula 0 simplified : X(XX"(((((((i14.i2.i1.u406.IsEndLoop_286>=1)||(i0.u12.IsEndLoop_90>=1))||((i32.i0.i1.u8.IsEndLoop_27>=1)||(i14.i0.i0.u213.IsEndLoop_...6540
Detected timeout of ITS tools.
Treatment of property Peterson-COL-6-LTLFireability-14 finished in 226894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 539 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2025-06-03 06:25:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-03 06:25:13] [INFO ] Computed 27 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:25:14] [INFO ] Implicit Places using invariants in 1351 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1362 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1395 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-15
Product exploration explored 100000 steps with 7718 reset in 2238 ms.
Stack based approach found an accepted trace after 32006 steps with 2461 reset with depth 25 and stack size 25 in 734 ms.
FORMULA Peterson-COL-6-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-15 finished in 4540 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(p1)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&(!p1||(X(!p0)&&F(!p1))))))))'
[2025-06-03 06:25:17] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin278337211498327013
[2025-06-03 06:25:17] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2025-06-03 06:25:17] [INFO ] Applying decomposition
[2025-06-03 06:25:17] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin278337211498327013
Running compilation step : cd /tmp/ltsmin278337211498327013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-06-03 06:25:18] [INFO ] Flatten gal took : 36 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/graph4445969766259359036.txt' '-o' '/tmp/graph4445969766259359036.bin' '-w' '/tmp/graph4445969766259359036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4445969766259359036.bin' '-l' '-1' '-v' '-w' '/tmp/graph4445969766259359036.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:25:18] [INFO ] Decomposing Gal with order
[2025-06-03 06:25:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:25:18] [INFO ] Removed a total of 1787 redundant transitions.
[2025-06-03 06:25:18] [INFO ] Flatten gal took : 106 ms
[2025-06-03 06:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-03 06:25:18] [INFO ] Time to serialize gal into /tmp/LTLFireability6681193830522595379.gal : 12 ms
[2025-06-03 06:25:18] [INFO ] Time to serialize properties into /tmp/LTLFireability16561708583147214644.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/LTLFireability6681193830522595379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16561708583147214644.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...277
Read 2 LTL properties
Checking formula 0 : !((G(("(((((((i22.i0.i0.u118.Turn_7>=1)&&(i22.i0.i0.u118.TestTurn_1>=1))||((i1.i0.i0.u129.Turn_19>=1)&&(i1.i0.i0.u129.TestTurn_32>=1))...2547
Formula 0 simplified : F(!"(((((((i22.i0.i0.u118.Turn_7>=1)&&(i22.i0.i0.u118.TestTurn_1>=1))||((i1.i0.i0.u129.Turn_19>=1)&&(i1.i0.i0.u129.TestTurn_32>=1)))...2533
Compilation finished in 3841 ms.
Running link step : cd /tmp/ltsmin278337211498327013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 133 ms.
Running LTSmin : cd /tmp/ltsmin278337211498327013;'/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' '--ltl' '[]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin278337211498327013;'/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' '--ltl' '[]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin278337211498327013;'/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' '--ltl' 'X((X(X(!(LTLAPp2==true))) U (X(X([](!(LTLAPp2==true))))||(X(X(!(LTLAPp2==true)))&&(!(LTLAPp3==true)||(X(!(LTLAPp2==true))&&<>(!(LTLAPp3==true))))))))' '--buchi-type=spotba'
LTSmin run took 858 ms.
FORMULA Peterson-COL-6-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin278337211498327013;'/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' '--ltl' '[]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 06:48:29] [INFO ] Applying decomposition
[2025-06-03 06:48:29] [INFO ] Flatten gal took : 510 ms
[2025-06-03 06:48:30] [INFO ] Decomposing Gal with order
[2025-06-03 06:48:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:48:31] [INFO ] Removed a total of 1876 redundant transitions.
[2025-06-03 06:48:31] [INFO ] Flatten gal took : 1206 ms
[2025-06-03 06:48:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 80 ms.
[2025-06-03 06:48:32] [INFO ] Time to serialize gal into /tmp/LTLFireability15381077953468435348.gal : 58 ms
[2025-06-03 06:48:32] [INFO ] Time to serialize properties into /tmp/LTLFireability3737011695743623994.ltl : 14 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/LTLFireability15381077953468435348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3737011695743623994.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...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((TourProcess7.Turn_7>=1)&&(ProcessTour1.TestTurn_1>=1))||((TourProcess19.Turn_19>=1)&&(ProcessTour32.TestTurn_32>=1)))||(...2918
Formula 0 simplified : F(!"(((((((TourProcess7.Turn_7>=1)&&(ProcessTour1.TestTurn_1>=1))||((TourProcess19.Turn_19>=1)&&(ProcessTour32.TestTurn_32>=1)))||((...2904
Detected timeout of ITS tools.
[2025-06-03 07:11:42] [INFO ] Flatten gal took : 264 ms
[2025-06-03 07:11:45] [INFO ] Input system was already deterministic with 2030 transitions.
[2025-06-03 07:11:45] [INFO ] Transformed 1330 places.
[2025-06-03 07:11:45] [INFO ] Transformed 2030 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 07:11:47] [INFO ] Time to serialize gal into /tmp/LTLFireability17970527222773045504.gal : 21 ms
[2025-06-03 07:11:47] [INFO ] Time to serialize properties into /tmp/LTLFireability4379499237732694934.ltl : 3 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/LTLFireability17970527222773045504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4379499237732694934.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(((((((Turn_7>=1)&&(TestTurn_1>=1))||((Turn_19>=1)&&(TestTurn_32>=1)))||(((Turn_4>=1)&&(TestTurn_24>=1))||((Turn_22>=1)&&(TestT...1665
Formula 0 simplified : F(!"(((((((Turn_7>=1)&&(TestTurn_1>=1))||((Turn_19>=1)&&(TestTurn_32>=1)))||(((Turn_4>=1)&&(TestTurn_24>=1))||((Turn_22>=1)&&(TestTu...1651
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Peterson-COL-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812900580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;