Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505300155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717196059356

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:54:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:54:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:54:21] [INFO ] Load time of PNML (sax parser for PT used): 961 ms
[2024-05-31 22:54:21] [INFO ] Transformed 13764 places.
[2024-05-31 22:54:21] [INFO ] Transformed 38880 transitions.
[2024-05-31 22:54:21] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4158 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-31 22:54:36] [INFO ] Computed 82 invariants in 10027 ms
[2024-05-31 22:54:58] [INFO ] Implicit Places using invariants in 31886 ms returned []
Implicit Place search using SMT only with invariants took 31914 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 22:54:58] [INFO ] Invariant cache hit.
[2024-05-31 22:54:58] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 178055ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 178401ms
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214594 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 33 out of 13763 places after structural reductions.
[2024-05-31 22:57:58] [INFO ] Flatten gal took : 1216 ms
[2024-05-31 22:57:58] [INFO ] Flatten gal took : 761 ms
[2024-05-31 22:58:00] [INFO ] Input system was already deterministic with 38880 transitions.
Support contains 30 out of 13763 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (19 resets) in 3970 ms. (10 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 14/14 properties
[2024-05-31 22:58:02] [INFO ] Invariant cache hit.
[2024-05-31 22:58:02] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 13580/13603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13603 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 156/13759 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13759/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 13580/13603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 22:58:09] [INFO ] Deduced a trap composed of 5 places in 593 ms of which 29 ms to minimize.
[2024-05-31 22:58:10] [INFO ] Deduced a trap composed of 5 places in 516 ms of which 4 ms to minimize.
[2024-05-31 22:58:10] [INFO ] Deduced a trap composed of 5 places in 489 ms of which 3 ms to minimize.
[2024-05-31 22:58:11] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 2 ms to minimize.
[2024-05-31 22:58:12] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 3 ms to minimize.
[2024-05-31 22:58:12] [INFO ] Deduced a trap composed of 5 places in 478 ms of which 3 ms to minimize.
SMT process timed out in 10781ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6310 Post agglomeration using F-continuation condition.Transition count delta: 6310
Deduced a syphon composed of 6310 places in 12 ms
Reduce places removed 6310 places and 0 transitions.
Iterating global reduction 2 with 12620 rules applied. Total rules applied 13738 place count 6894 transition count 32011
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13740 place count 6894 transition count 32009
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13742 place count 6892 transition count 32009
Partial Free-agglomeration rule applied 6469 times.
Drop transitions (Partial Free agglomeration) removed 6469 transitions
Iterating global reduction 3 with 6469 rules applied. Total rules applied 20211 place count 6892 transition count 32009
Applied a total of 20211 rules in 14426 ms. Remains 6892 /13763 variables (removed 6871) and now considering 32009/38880 (removed 6871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14431 ms. Remains : 6892/13763 places, 32009/38880 transitions.
RANDOM walk for 40000 steps (81 resets) in 2507 ms. (15 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
[2024-05-31 22:58:28] [INFO ] Flow matrix only has 31997 transitions (discarded 12 similar events)
// Phase 1: matrix 31997 rows 6892 cols
[2024-05-31 22:58:30] [INFO ] Computed 82 invariants in 2197 ms
[2024-05-31 22:58:31] [INFO ] State equation strengthened by 31716 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6712/6730 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6730 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 158/6888 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6888 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/6890 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6890 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 31997/38887 variables, 6890/6972 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38887 variables, 31716/38688 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38887 variables, 0/38688 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 47638ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 6892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 32009/32009 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6891 transition count 32008
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 6891 transition count 32008
Applied a total of 5 rules in 7582 ms. Remains 6891 /6892 variables (removed 1) and now considering 32008/32009 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7582 ms. Remains : 6891/6892 places, 32008/32009 transitions.
RANDOM walk for 40000 steps (81 resets) in 2040 ms. (19 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
[2024-05-31 22:59:24] [INFO ] Flow matrix only has 31999 transitions (discarded 9 similar events)
// Phase 1: matrix 31999 rows 6891 cols
[2024-05-31 22:59:26] [INFO ] Computed 82 invariants in 2099 ms
[2024-05-31 22:59:27] [INFO ] State equation strengthened by 31724 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6715/6729 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6729 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 158/6887 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6887 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/6889 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6889 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 31999/38888 variables, 6889/6971 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38888 variables, 31724/38695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38888 variables, 0/38695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 77637ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 6891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6891/6891 places, 32008/32008 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6889 transition count 32006
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 6889 transition count 32006
Applied a total of 6 rules in 7993 ms. Remains 6889 /6891 variables (removed 2) and now considering 32006/32008 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7993 ms. Remains : 6889/6891 places, 32006/32008 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3718 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-31 23:01:03] [INFO ] Computed 82 invariants in 9400 ms
[2024-05-31 23:01:25] [INFO ] Implicit Places using invariants in 31305 ms returned []
Implicit Place search using SMT only with invariants took 31306 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 23:01:26] [INFO ] Invariant cache hit.
[2024-05-31 23:01:26] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 179463ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 179875ms
Finished structural reductions in LTL mode , in 1 iterations and 214981 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-00 finished in 215295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4104 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-31 23:04:29] [INFO ] Invariant cache hit.
[2024-05-31 23:04:51] [INFO ] Implicit Places using invariants in 21595 ms returned []
Implicit Place search using SMT only with invariants took 21596 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 23:04:51] [INFO ] Invariant cache hit.
[2024-05-31 23:04:51] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 180231ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 180536ms
Finished structural reductions in LTL mode , in 1 iterations and 206285 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 3984 ms.
Product exploration explored 100000 steps with 33333 reset in 3629 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-01 finished in 214243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 14 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 9036 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2024-05-31 23:08:09] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-31 23:08:13] [INFO ] Computed 82 invariants in 4074 ms
[2024-05-31 23:08:24] [INFO ] Implicit Places using invariants in 15235 ms returned []
Implicit Place search using SMT only with invariants took 15236 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2024-05-31 23:08:24] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-31 23:08:24] [INFO ] Invariant cache hit.
[2024-05-31 23:08:24] [INFO ] State equation strengthened by 19118 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 128695ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 128950ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153261 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-02
Product exploration explored 100000 steps with 248 reset in 2769 ms.
Product exploration explored 100000 steps with 248 reset in 2807 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (96 resets) in 1332 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 58911 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 58911 steps, saw 46789 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 23:10:42] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-31 23:10:42] [INFO ] Invariant cache hit.
[2024-05-31 23:10:42] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6720/6721 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:10:43] [INFO ] Deduced a trap composed of 2 places in 251 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6721 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6721 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6879 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6879 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6881 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:00] [INFO ] Deduced a trap composed of 96 places in 15570 ms of which 51 ms to minimize.
SMT process timed out in 17706ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6480 times.
Drop transitions (Partial Free agglomeration) removed 6480 transitions
Iterating global reduction 1 with 6480 rules applied. Total rules applied 6482 place count 6882 transition count 31999
Applied a total of 6482 rules in 7345 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7346 ms. Remains : 6882/6883 places, 31999/32000 transitions.
RANDOM walk for 40000 steps (81 resets) in 1479 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 75458 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 75458 steps, saw 64242 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-31 23:11:11] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
// Phase 1: matrix 31998 rows 6882 cols
[2024-05-31 23:11:13] [INFO ] Computed 82 invariants in 2040 ms
[2024-05-31 23:11:13] [INFO ] State equation strengthened by 31758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:14] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 2 ms to minimize.
[2024-05-31 23:11:14] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-31 23:11:14] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 2 ms to minimize.
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:11:16] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-31 23:11:16] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-31 23:11:16] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 2 ms to minimize.
[2024-05-31 23:11:16] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:11:17] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-31 23:11:17] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-31 23:11:17] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 2 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 2 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 2 ms to minimize.
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 2 ms to minimize.
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-31 23:11:20] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 2 ms to minimize.
[2024-05-31 23:11:20] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:11:20] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:11:20] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:11:21] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:11:21] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:11:21] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:11:22] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:11:22] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-31 23:11:22] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 2 ms to minimize.
[2024-05-31 23:11:22] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 2 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:11:26] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:11:26] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:11:26] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-31 23:11:26] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 0 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:11:29] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:11:29] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-31 23:11:29] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6720 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:29] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-31 23:11:30] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 1 ms to minimize.
[2024-05-31 23:11:30] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 0 ms to minimize.
[2024-05-31 23:11:30] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2024-05-31 23:11:30] [INFO ] Deduced a trap composed of 2 places in 157 ms of which 1 ms to minimize.
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 0 ms to minimize.
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 0 ms to minimize.
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 2 places in 158 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 1 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 2 places in 157 ms of which 1 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 2 places in 156 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/6720 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6880 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38878/38880 variables, and 7041 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33136 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6880/6882 constraints, ReadFeed: 0/31758 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 92 places in 15716 ms of which 42 ms to minimize.
[2024-05-31 23:12:19] [INFO ] Deduced a trap composed of 100 places in 15500 ms of which 46 ms to minimize.
[2024-05-31 23:12:34] [INFO ] Deduced a trap composed of 193 places in 15069 ms of which 50 ms to minimize.
SMT process timed out in 83669ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2582 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2582 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2570 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-31 23:12:39] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-31 23:12:39] [INFO ] Invariant cache hit.
[2024-05-31 23:12:56] [INFO ] Implicit Places using invariants in 16606 ms returned []
Implicit Place search using SMT only with invariants took 16606 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2024-05-31 23:12:56] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-31 23:12:56] [INFO ] Invariant cache hit.
[2024-05-31 23:12:57] [INFO ] State equation strengthened by 31758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 145866ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 146216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165432 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 2229 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2024-05-31 23:15:25] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-31 23:15:29] [INFO ] Computed 82 invariants in 4213 ms
[2024-05-31 23:15:40] [INFO ] Implicit Places using invariants in 15320 ms returned []
Implicit Place search using SMT only with invariants took 15321 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2024-05-31 23:15:40] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-31 23:15:40] [INFO ] Invariant cache hit.
[2024-05-31 23:15:41] [INFO ] State equation strengthened by 19118 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 137062ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 137322ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 154912 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (99 resets) in 1065 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 57748 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 57748 steps, saw 46624 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 23:18:01] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-31 23:18:01] [INFO ] Invariant cache hit.
[2024-05-31 23:18:01] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6720/6721 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:18:02] [INFO ] Deduced a trap composed of 2 places in 248 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6721 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6721 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6879 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6879 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6881 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:18:19] [INFO ] Deduced a trap composed of 96 places in 15329 ms of which 44 ms to minimize.
SMT process timed out in 17457ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6480 times.
Drop transitions (Partial Free agglomeration) removed 6480 transitions
Iterating global reduction 1 with 6480 rules applied. Total rules applied 6482 place count 6882 transition count 31999
Applied a total of 6482 rules in 7398 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7399 ms. Remains : 6882/6883 places, 31999/32000 transitions.
RANDOM walk for 40000 steps (83 resets) in 1689 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 75423 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 75423 steps, saw 64238 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-31 23:18:29] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
// Phase 1: matrix 31998 rows 6882 cols
[2024-05-31 23:18:32] [INFO ] Computed 82 invariants in 2049 ms
[2024-05-31 23:18:32] [INFO ] State equation strengthened by 31758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:18:33] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 1 ms to minimize.
[2024-05-31 23:18:33] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-31 23:18:33] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-31 23:18:34] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-31 23:18:34] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-31 23:18:34] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 2 ms to minimize.
[2024-05-31 23:18:34] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-31 23:18:35] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 1 ms to minimize.
[2024-05-31 23:18:35] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-31 23:18:35] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-31 23:18:35] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 1 ms to minimize.
[2024-05-31 23:18:36] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 1 ms to minimize.
[2024-05-31 23:18:36] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 2 ms to minimize.
[2024-05-31 23:18:36] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-31 23:18:36] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 1 ms to minimize.
[2024-05-31 23:18:38] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 1 ms to minimize.
[2024-05-31 23:18:38] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:18:38] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:18:38] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:18:39] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:18:39] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:18:39] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:18:39] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
[2024-05-31 23:18:40] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:18:40] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:18:40] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:18:40] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-31 23:18:41] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:18:41] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:18:41] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:18:41] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-31 23:18:42] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:18:42] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-31 23:18:42] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:18:42] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:18:43] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 1 ms to minimize.
[2024-05-31 23:18:43] [INFO ] Deduced a trap composed of 2 places in 175 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:18:43] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 1 ms to minimize.
[2024-05-31 23:18:44] [INFO ] Deduced a trap composed of 2 places in 308 ms of which 1 ms to minimize.
[2024-05-31 23:18:44] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:18:44] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:18:44] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:18:45] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 1 ms to minimize.
[2024-05-31 23:18:45] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:18:45] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:18:45] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 0 ms to minimize.
[2024-05-31 23:18:46] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-31 23:18:46] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 2 ms to minimize.
[2024-05-31 23:18:46] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:18:46] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 0 ms to minimize.
[2024-05-31 23:18:47] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 1 ms to minimize.
[2024-05-31 23:18:47] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
[2024-05-31 23:18:47] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-31 23:18:47] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 0 ms to minimize.
[2024-05-31 23:18:48] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 1 ms to minimize.
[2024-05-31 23:18:48] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2024-05-31 23:18:48] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6720 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:18:48] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-31 23:18:49] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 0 ms to minimize.
[2024-05-31 23:18:49] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 1 ms to minimize.
[2024-05-31 23:18:49] [INFO ] Deduced a trap composed of 2 places in 169 ms of which 1 ms to minimize.
[2024-05-31 23:18:49] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-31 23:18:50] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-31 23:18:50] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2024-05-31 23:18:50] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 0 ms to minimize.
[2024-05-31 23:18:50] [INFO ] Deduced a trap composed of 2 places in 161 ms of which 0 ms to minimize.
[2024-05-31 23:18:51] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-31 23:18:51] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 1 ms to minimize.
[2024-05-31 23:18:51] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-31 23:18:51] [INFO ] Deduced a trap composed of 2 places in 158 ms of which 1 ms to minimize.
[2024-05-31 23:18:51] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 1 ms to minimize.
[2024-05-31 23:18:52] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-31 23:18:52] [INFO ] Deduced a trap composed of 2 places in 156 ms of which 1 ms to minimize.
[2024-05-31 23:18:52] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 1 ms to minimize.
[2024-05-31 23:18:52] [INFO ] Deduced a trap composed of 2 places in 159 ms of which 1 ms to minimize.
[2024-05-31 23:18:53] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/6720 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6880 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38878/38880 variables, and 7041 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34207 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6880/6882 constraints, ReadFeed: 0/31758 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6719/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:19:23] [INFO ] Deduced a trap composed of 92 places in 15264 ms of which 39 ms to minimize.
[2024-05-31 23:19:39] [INFO ] Deduced a trap composed of 100 places in 15654 ms of which 43 ms to minimize.
[2024-05-31 23:19:55] [INFO ] Deduced a trap composed of 193 places in 16120 ms of which 45 ms to minimize.
SMT process timed out in 85411ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2571 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2571 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2548 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-31 23:20:00] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-31 23:20:00] [INFO ] Invariant cache hit.
[2024-05-31 23:20:17] [INFO ] Implicit Places using invariants in 16520 ms returned []
Implicit Place search using SMT only with invariants took 16521 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2024-05-31 23:20:17] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-31 23:20:17] [INFO ] Invariant cache hit.
[2024-05-31 23:20:17] [INFO ] State equation strengthened by 31758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 145250ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 145515ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164622 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 247 reset in 2636 ms.
Product exploration explored 100000 steps with 249 reset in 2532 ms.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 2213 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2024-05-31 23:22:50] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-31 23:22:54] [INFO ] Computed 82 invariants in 4139 ms
[2024-05-31 23:23:05] [INFO ] Implicit Places using invariants in 15046 ms returned []
Implicit Place search using SMT only with invariants took 15046 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2024-05-31 23:23:05] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-31 23:23:05] [INFO ] Invariant cache hit.
[2024-05-31 23:23:05] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 129589ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 129844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 147140 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-02 finished in 1036506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p0))))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3933 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-31 23:25:29] [INFO ] Computed 82 invariants in 8774 ms
[2024-05-31 23:25:50] [INFO ] Implicit Places using invariants in 30084 ms returned []
Implicit Place search using SMT only with invariants took 30087 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 23:25:50] [INFO ] Invariant cache hit.
[2024-05-31 23:25:51] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30429 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 209676ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 209992ms
Finished structural reductions in LTL mode , in 1 iterations and 244058 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-03
Stuttering criterion allowed to conclude after 2364 steps with 0 reset in 48 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-03 finished in 244275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3767 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-31 23:29:24] [INFO ] Invariant cache hit.
[2024-05-31 23:29:46] [INFO ] Implicit Places using invariants in 21680 ms returned []
Implicit Place search using SMT only with invariants took 21681 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 23:29:46] [INFO ] Invariant cache hit.
[2024-05-31 23:29:46] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 183330ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 183642ms
Finished structural reductions in LTL mode , in 1 iterations and 209132 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-04
Stuttering criterion allowed to conclude after 2094 steps with 0 reset in 50 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-04 finished in 209354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 14 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 9114 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2024-05-31 23:32:59] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
// Phase 1: matrix 25840 rows 6884 cols
[2024-05-31 23:33:03] [INFO ] Computed 82 invariants in 4281 ms
[2024-05-31 23:33:14] [INFO ] Implicit Places using invariants in 15464 ms returned []
Implicit Place search using SMT only with invariants took 15465 ms to find 0 implicit places.
Running 31921 sub problems to find dead transitions.
[2024-05-31 23:33:15] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2024-05-31 23:33:15] [INFO ] Invariant cache hit.
[2024-05-31 23:33:15] [INFO ] State equation strengthened by 19117 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6883 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31921 unsolved
SMT process timed out in 137703ms, After SMT, problems are : Problem set: 0 solved, 31921 unsolved
Search for dead transitions found 0 dead transitions in 137964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162621 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-05
Stuttering criterion allowed to conclude after 380 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-05 finished in 162793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(p1)&&G(p2))))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 12 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8849 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-31 23:35:41] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-31 23:35:45] [INFO ] Computed 82 invariants in 3962 ms
[2024-05-31 23:35:56] [INFO ] Implicit Places using invariants in 15086 ms returned []
Implicit Place search using SMT only with invariants took 15087 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-31 23:35:57] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-31 23:35:57] [INFO ] Invariant cache hit.
[2024-05-31 23:35:57] [INFO ] State equation strengthened by 19118 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 133045ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 133308ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157297 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-06
Product exploration explored 100000 steps with 253 reset in 2601 ms.
Product exploration explored 100000 steps with 247 reset in 2770 ms.
Computed a total of 245 stabilizing places and 402 stable transitions
Computed a total of 245 stabilizing places and 402 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 189 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (98 resets) in 1646 ms. (24 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
[2024-05-31 23:38:16] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-31 23:38:16] [INFO ] Invariant cache hit.
[2024-05-31 23:38:17] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6721/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:38:18] [INFO ] Deduced a trap composed of 2 places in 245 ms of which 1 ms to minimize.
[2024-05-31 23:38:18] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 1 ms to minimize.
[2024-05-31 23:38:18] [INFO ] Deduced a trap composed of 2 places in 248 ms of which 1 ms to minimize.
[2024-05-31 23:38:19] [INFO ] Deduced a trap composed of 2 places in 256 ms of which 1 ms to minimize.
[2024-05-31 23:38:19] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 1 ms to minimize.
[2024-05-31 23:38:19] [INFO ] Deduced a trap composed of 2 places in 254 ms of which 1 ms to minimize.
[2024-05-31 23:38:20] [INFO ] Deduced a trap composed of 2 places in 249 ms of which 1 ms to minimize.
[2024-05-31 23:38:20] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 1 ms to minimize.
[2024-05-31 23:38:20] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 1 ms to minimize.
[2024-05-31 23:38:21] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 1 ms to minimize.
[2024-05-31 23:38:21] [INFO ] Deduced a trap composed of 2 places in 248 ms of which 2 ms to minimize.
[2024-05-31 23:38:21] [INFO ] Deduced a trap composed of 2 places in 256 ms of which 1 ms to minimize.
[2024-05-31 23:38:22] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 1 ms to minimize.
SMT process timed out in 5224ms, 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 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6885 transition count 32000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6883 transition count 32000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6479 times.
Drop transitions (Partial Free agglomeration) removed 6479 transitions
Iterating global reduction 3 with 6479 rules applied. Total rules applied 6485 place count 6882 transition count 31999
Applied a total of 6485 rules in 7190 ms. Remains 6882 /6885 variables (removed 3) and now considering 31999/32002 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7191 ms. Remains : 6882/6885 places, 31999/32002 transitions.
RANDOM walk for 40000 steps (81 resets) in 1462 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 73592 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73592 steps, saw 63970 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-31 23:38:32] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
// Phase 1: matrix 31997 rows 6882 cols
[2024-05-31 23:38:34] [INFO ] Computed 82 invariants in 2045 ms
[2024-05-31 23:38:35] [INFO ] State equation strengthened by 31756 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6718/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:38:36] [INFO ] Deduced a trap composed of 2 places in 184 ms of which 1 ms to minimize.
[2024-05-31 23:38:36] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:38:53] [INFO ] Deduced a trap composed of 87 places in 15691 ms of which 45 ms to minimize.
[2024-05-31 23:39:09] [INFO ] Deduced a trap composed of 89 places in 15440 ms of which 39 ms to minimize.
[2024-05-31 23:39:23] [INFO ] Deduced a trap composed of 100 places in 14333 ms of which 42 ms to minimize.
SMT process timed out in 50887ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2602 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2602 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2668 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-31 23:39:28] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-31 23:39:28] [INFO ] Invariant cache hit.
[2024-05-31 23:39:45] [INFO ] Implicit Places using invariants in 16430 ms returned []
Implicit Place search using SMT only with invariants took 16431 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2024-05-31 23:39:45] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-31 23:39:45] [INFO ] Invariant cache hit.
[2024-05-31 23:39:45] [INFO ] State equation strengthened by 31756 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 143968ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 144236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163376 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 300 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2208 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-31 23:42:12] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-31 23:42:16] [INFO ] Computed 82 invariants in 3940 ms
[2024-05-31 23:42:27] [INFO ] Implicit Places using invariants in 15322 ms returned []
Implicit Place search using SMT only with invariants took 15323 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-31 23:42:28] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-31 23:42:28] [INFO ] Invariant cache hit.
[2024-05-31 23:42:28] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 138550ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 138813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 156409 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Computed a total of 245 stabilizing places and 402 stable transitions
Computed a total of 245 stabilizing places and 402 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 202 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (98 resets) in 1790 ms. (22 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2024-05-31 23:44:47] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-31 23:44:47] [INFO ] Invariant cache hit.
[2024-05-31 23:44:47] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6721/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:44:48] [INFO ] Deduced a trap composed of 2 places in 254 ms of which 1 ms to minimize.
[2024-05-31 23:44:49] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 2 ms to minimize.
[2024-05-31 23:44:49] [INFO ] Deduced a trap composed of 2 places in 251 ms of which 1 ms to minimize.
[2024-05-31 23:44:49] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 1 ms to minimize.
[2024-05-31 23:44:50] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 1 ms to minimize.
[2024-05-31 23:44:50] [INFO ] Deduced a trap composed of 2 places in 260 ms of which 1 ms to minimize.
[2024-05-31 23:44:50] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 1 ms to minimize.
[2024-05-31 23:44:51] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 1 ms to minimize.
[2024-05-31 23:44:51] [INFO ] Deduced a trap composed of 2 places in 258 ms of which 1 ms to minimize.
[2024-05-31 23:44:51] [INFO ] Deduced a trap composed of 2 places in 258 ms of which 1 ms to minimize.
[2024-05-31 23:44:52] [INFO ] Deduced a trap composed of 2 places in 251 ms of which 1 ms to minimize.
[2024-05-31 23:44:52] [INFO ] Deduced a trap composed of 2 places in 261 ms of which 2 ms to minimize.
[2024-05-31 23:44:52] [INFO ] Deduced a trap composed of 2 places in 256 ms of which 1 ms to minimize.
SMT process timed out in 5221ms, 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 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6885 transition count 32000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6883 transition count 32000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6479 times.
Drop transitions (Partial Free agglomeration) removed 6479 transitions
Iterating global reduction 3 with 6479 rules applied. Total rules applied 6485 place count 6882 transition count 31999
Applied a total of 6485 rules in 7269 ms. Remains 6882 /6885 variables (removed 3) and now considering 31999/32002 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7270 ms. Remains : 6882/6885 places, 31999/32002 transitions.
RANDOM walk for 40000 steps (80 resets) in 1892 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 73412 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73412 steps, saw 63943 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-31 23:45:03] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
// Phase 1: matrix 31997 rows 6882 cols
[2024-05-31 23:45:05] [INFO ] Computed 82 invariants in 2080 ms
[2024-05-31 23:45:06] [INFO ] State equation strengthened by 31756 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6718/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:45:07] [INFO ] Deduced a trap composed of 2 places in 191 ms of which 2 ms to minimize.
[2024-05-31 23:45:07] [INFO ] Deduced a trap composed of 2 places in 187 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:45:25] [INFO ] Deduced a trap composed of 87 places in 16015 ms of which 46 ms to minimize.
[2024-05-31 23:45:39] [INFO ] Deduced a trap composed of 89 places in 14297 ms of which 42 ms to minimize.
[2024-05-31 23:45:54] [INFO ] Deduced a trap composed of 100 places in 14820 ms of which 44 ms to minimize.
SMT process timed out in 50585ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2625 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2625 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2595 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-31 23:45:59] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-31 23:45:59] [INFO ] Invariant cache hit.
[2024-05-31 23:46:16] [INFO ] Implicit Places using invariants in 16621 ms returned []
Implicit Place search using SMT only with invariants took 16626 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2024-05-31 23:46:16] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-31 23:46:16] [INFO ] Invariant cache hit.
[2024-05-31 23:46:16] [INFO ] State equation strengthened by 31756 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 144313ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 144582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163844 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 373 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 251 reset in 2614 ms.
Product exploration explored 100000 steps with 253 reset in 2665 ms.
Support contains 4 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2242 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-31 23:48:49] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-31 23:48:53] [INFO ] Computed 82 invariants in 4059 ms
[2024-05-31 23:49:04] [INFO ] Implicit Places using invariants in 15262 ms returned []
Implicit Place search using SMT only with invariants took 15262 ms to find 0 implicit places.
Running 31922 sub problems to find dead transitions.
[2024-05-31 23:49:04] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-31 23:49:04] [INFO ] Invariant cache hit.
[2024-05-31 23:49:04] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6884 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31922 unsolved
SMT process timed out in 132068ms, After SMT, problems are : Problem set: 0 solved, 31922 unsolved
Search for dead transitions found 0 dead transitions in 132319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 149860 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-06 finished in 944735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1 U p2))))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3791 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-31 23:51:30] [INFO ] Computed 82 invariants in 8874 ms
[2024-05-31 23:51:51] [INFO ] Implicit Places using invariants in 30385 ms returned []
Implicit Place search using SMT only with invariants took 30385 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 23:51:52] [INFO ] Invariant cache hit.
[2024-05-31 23:51:52] [INFO ] State equation strengthened by 12720 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505300155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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