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.r468-smll-171620167400315.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 AutonomousCar-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 276K 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 AutonomousCar-PT-07a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717214686349

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:04:49] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-06-01 04:04:49] [INFO ] Transformed 73 places.
[2024-06-01 04:04:49] [INFO ] Transformed 593 transitions.
[2024-06-01 04:04:49] [INFO ] Found NUPN structural information;
[2024-06-01 04:04:49] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 348
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 348
Applied a total of 8 rules in 66 ms. Remains 69 /73 variables (removed 4) and now considering 348/380 (removed 32) transitions.
[2024-06-01 04:04:50] [INFO ] Flow matrix only has 347 transitions (discarded 1 similar events)
// Phase 1: matrix 347 rows 69 cols
[2024-06-01 04:04:50] [INFO ] Computed 12 invariants in 43 ms
[2024-06-01 04:04:50] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 04:04:50] [INFO ] Flow matrix only has 347 transitions (discarded 1 similar events)
[2024-06-01 04:04:50] [INFO ] Invariant cache hit.
[2024-06-01 04:04:50] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-01 04:04:51] [INFO ] Implicit Places using invariants and state equation in 567 ms returned [64, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1175 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 348/380 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1288 ms. Remains : 67/73 places, 348/380 transitions.
Support contains 27 out of 67 places after structural reductions.
[2024-06-01 04:04:51] [INFO ] Flatten gal took : 226 ms
[2024-06-01 04:04:51] [INFO ] Flatten gal took : 137 ms
[2024-06-01 04:04:52] [INFO ] Input system was already deterministic with 348 transitions.
Support contains 25 out of 67 places (down from 27) after GAL structural reductions.
RANDOM walk for 40000 steps (2226 resets) in 3558 ms. (11 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (215 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
[2024-06-01 04:04:53] [INFO ] Flow matrix only has 347 transitions (discarded 1 similar events)
// Phase 1: matrix 347 rows 67 cols
[2024-06-01 04:04:53] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 04:04:53] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/64 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 343/407 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 170/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/412 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/414 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 67/67 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/64 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 343/407 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 170/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/412 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/413 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/414 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/414 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 249 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 67/67 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 348/348 transitions.
Graph (complete) has 634 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 65 transition count 335
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 57 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 56 transition count 334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 56 transition count 333
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 55 transition count 333
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 27 place count 52 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 52 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 49 transition count 306
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 49 transition count 300
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 90 place count 43 transition count 258
Applied a total of 90 rules in 211 ms. Remains 43 /67 variables (removed 24) and now considering 258/348 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 43/67 places, 258/348 transitions.
RANDOM walk for 40000 steps (60 resets) in 606 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (20 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11130 steps, run visited all 1 properties in 111 ms. (steps per millisecond=100 )
Probabilistic random walk after 11130 steps, saw 2851 distinct states, run finished after 119 ms. (steps per millisecond=93 ) properties seen :1
FORMULA AutonomousCar-PT-07a-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-07a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-07a-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 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' '!(G(F((p0||(F(G(p0))&&G(p1))))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 340
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 59 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 58 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 338
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 57 transition count 338
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 314
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 53 transition count 314
Applied a total of 28 rules in 121 ms. Remains 53 /67 variables (removed 14) and now considering 314/348 (removed 34) transitions.
[2024-06-01 04:04:55] [INFO ] Flow matrix only has 313 transitions (discarded 1 similar events)
// Phase 1: matrix 313 rows 53 cols
[2024-06-01 04:04:55] [INFO ] Computed 10 invariants in 9 ms
[2024-06-01 04:04:56] [INFO ] Implicit Places using invariants in 421 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/67 places, 314/348 transitions.
Applied a total of 0 rules in 30 ms. Remains 52 /52 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 52/67 places, 314/348 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-01
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-07a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLCardinality-01 finished in 1038 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)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 340
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 58 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 57 transition count 339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 57 transition count 338
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 56 transition count 338
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 23 place count 52 transition count 313
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 52 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 51 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 50 transition count 312
Applied a total of 31 rules in 78 ms. Remains 50 /67 variables (removed 17) and now considering 312/348 (removed 36) transitions.
// Phase 1: matrix 312 rows 50 cols
[2024-06-01 04:04:56] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 04:04:56] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 04:04:56] [INFO ] Invariant cache hit.
[2024-06-01 04:04:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:04:57] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-06-01 04:04:57] [INFO ] Redundant transitions in 57 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 04:04:57] [INFO ] Invariant cache hit.
[2024-06-01 04:04:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 311/361 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 04:05:05] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 14 ms to minimize.
[2024-06-01 04:05:08] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 62 constraints, problems are : Problem set: 0 solved, 311 unsolved in 18685 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 311/361 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 311/372 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 373 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
After SMT, in 51508ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 51525ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/67 places, 312/348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52205 ms. Remains : 50/67 places, 312/348 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-02
Product exploration explored 100000 steps with 44 reset in 365 ms.
Product exploration explored 100000 steps with 227 reset in 258 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 47 steps (1 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 312/312 transitions.
Applied a total of 0 rules in 28 ms. Remains 50 /50 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-01 04:05:50] [INFO ] Invariant cache hit.
[2024-06-01 04:05:50] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 04:05:50] [INFO ] Invariant cache hit.
[2024-06-01 04:05:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:05:50] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-06-01 04:05:50] [INFO ] Redundant transitions in 25 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 04:05:50] [INFO ] Invariant cache hit.
[2024-06-01 04:05:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 311/361 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 04:05:58] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 2 ms to minimize.
[2024-06-01 04:06:00] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 62 constraints, problems are : Problem set: 0 solved, 311 unsolved in 18445 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 311/361 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 311/372 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 373 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
After SMT, in 50847ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 50852ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51400 ms. Remains : 50/50 places, 312/312 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 134 reset in 114 ms.
Product exploration explored 100000 steps with 98 reset in 250 ms.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 312/312 transitions.
Applied a total of 0 rules in 28 ms. Remains 50 /50 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-01 04:06:42] [INFO ] Invariant cache hit.
[2024-06-01 04:06:42] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 04:06:42] [INFO ] Invariant cache hit.
[2024-06-01 04:06:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:06:42] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-06-01 04:06:42] [INFO ] Redundant transitions in 23 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 04:06:43] [INFO ] Invariant cache hit.
[2024-06-01 04:06:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (OVERLAPS) 311/361 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 04:06:50] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 2 ms to minimize.
[2024-06-01 04:06:52] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 62 constraints, problems are : Problem set: 0 solved, 311 unsolved in 18472 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 311/361 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 311/372 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 373 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 2/2 constraints]
After SMT, in 50465ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 50473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51133 ms. Remains : 50/50 places, 312/312 transitions.
Treatment of property AutonomousCar-PT-07a-LTLCardinality-02 finished in 156963 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(G(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 323
Applied a total of 8 rules in 5 ms. Remains 63 /67 variables (removed 4) and now considering 323/348 (removed 25) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-06-01 04:07:33] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:07:33] [INFO ] Implicit Places using invariants in 228 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 323/348 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 62/67 places, 323/348 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLCardinality-06 finished in 361 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(G((p0&&X(p1)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 331
Applied a total of 6 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 331/348 (removed 17) transitions.
// Phase 1: matrix 331 rows 64 cols
[2024-06-01 04:07:33] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:07:34] [INFO ] Implicit Places using invariants in 230 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 234 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 331/348 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 63/67 places, 331/348 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 39 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLCardinality-08 finished in 476 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 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 323
Applied a total of 8 rules in 6 ms. Remains 63 /67 variables (removed 4) and now considering 323/348 (removed 25) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-06-01 04:07:34] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:07:34] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 04:07:34] [INFO ] Invariant cache hit.
[2024-06-01 04:07:34] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-06-01 04:07:34] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-01 04:07:35] [INFO ] Invariant cache hit.
[2024-06-01 04:07:35] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 04:07:43] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 2 ms to minimize.
[2024-06-01 04:07:43] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 3 ms to minimize.
[2024-06-01 04:07:44] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 61813ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 61819ms
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 323/348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62356 ms. Remains : 63/67 places, 323/348 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-11
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLCardinality-11 finished in 62488 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) U (!p1||F(!p2))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 342
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 61 transition count 340
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 59 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 59 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 58 transition count 339
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 54 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 54 transition count 314
Applied a total of 26 rules in 31 ms. Remains 54 /67 variables (removed 13) and now considering 314/348 (removed 34) transitions.
// Phase 1: matrix 314 rows 54 cols
[2024-06-01 04:08:36] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 04:08:37] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 04:08:37] [INFO ] Invariant cache hit.
[2024-06-01 04:08:37] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-06-01 04:08:37] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-01 04:08:37] [INFO ] Redundant transitions in 2 ms returned []
Running 313 sub problems to find dead transitions.
[2024-06-01 04:08:37] [INFO ] Invariant cache hit.
[2024-06-01 04:08:37] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/367 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 149/212 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 1/368 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-01 04:08:52] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/368 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 0/368 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 214 constraints, problems are : Problem set: 0 solved, 313 unsolved in 21629 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/367 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 149/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 313/526 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-01 04:09:16] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 313 unsolved
SMT process timed out in 53241ms, After SMT, problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 53247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/67 places, 314/348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53683 ms. Remains : 54/67 places, 314/348 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND p1 p2), (AND p2 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 1516 ms.
Product exploration explored 100000 steps with 50000 reset in 1466 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLCardinality-13 finished in 56801 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((G(p0)||G(!p1))) U p2)))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 348/348 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 339
Applied a total of 4 rules in 3 ms. Remains 65 /67 variables (removed 2) and now considering 339/348 (removed 9) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-06-01 04:09:33] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:09:33] [INFO ] Implicit Places using invariants in 234 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 241 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 339/348 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 64/67 places, 339/348 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 1203 ms.
Product exploration explored 100000 steps with 50000 reset in 1230 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLCardinality-14 finished in 2845 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)))'
[2024-06-01 04:09:36] [INFO ] Flatten gal took : 58 ms
[2024-06-01 04:09:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 04:09:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 348 transitions and 3516 arcs took 8 ms.
Total runtime 287891 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-07a-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717214977628

--------------------
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
mcc2024
ltl formula name AutonomousCar-PT-07a-LTLCardinality-02
ltl formula formula --ltl=/tmp/869/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 67 places, 348 transitions and 3516 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/869/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/869/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/869/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/869/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 68, there are 360 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~171 levels ~10000 states ~43192 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16708
pnml2lts-mc( 0/ 4): unique states count: 17152
pnml2lts-mc( 0/ 4): unique transitions count: 68973
pnml2lts-mc( 0/ 4): - self-loop count: 260
pnml2lts-mc( 0/ 4): - claim dead count: 48013
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17162
pnml2lts-mc( 0/ 4): - cum. max stack depth: 539
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17162 states 69153 transitions, fanout: 4.029
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.220 sec minimum, 0.228 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74617, Transitions per second: 300665
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 9.3 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 351 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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="AutonomousCar-PT-07a"
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 AutonomousCar-PT-07a, 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 r468-smll-171620167400315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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