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.r285-smll-171654421900058.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 gold2023
Input is Parking-PT-832, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421900058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 251K May 18 16:43 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 Parking-PT-832-LTLFireability-00
FORMULA_NAME Parking-PT-832-LTLFireability-01
FORMULA_NAME Parking-PT-832-LTLFireability-02
FORMULA_NAME Parking-PT-832-LTLFireability-03
FORMULA_NAME Parking-PT-832-LTLFireability-04
FORMULA_NAME Parking-PT-832-LTLFireability-05
FORMULA_NAME Parking-PT-832-LTLFireability-06
FORMULA_NAME Parking-PT-832-LTLFireability-07
FORMULA_NAME Parking-PT-832-LTLFireability-08
FORMULA_NAME Parking-PT-832-LTLFireability-09
FORMULA_NAME Parking-PT-832-LTLFireability-10
FORMULA_NAME Parking-PT-832-LTLFireability-11
FORMULA_NAME Parking-PT-832-LTLFireability-12
FORMULA_NAME Parking-PT-832-LTLFireability-13
FORMULA_NAME Parking-PT-832-LTLFireability-14
FORMULA_NAME Parking-PT-832-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716843888146

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 21:04:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 21:04:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:04:52] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2024-05-27 21:04:52] [INFO ] Transformed 737 places.
[2024-05-27 21:04:52] [INFO ] Transformed 993 transitions.
[2024-05-27 21:04:52] [INFO ] Found NUPN structural information;
[2024-05-27 21:04:52] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 602
Applied a total of 14 rules in 290 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2024-05-27 21:04:52] [INFO ] Computed 184 invariants in 49 ms
[2024-05-27 21:04:54] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-27 21:04:54] [INFO ] Invariant cache hit.
[2024-05-27 21:04:54] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:04:56] [INFO ] Implicit Places using invariants and state equation in 2312 ms returned [144, 152, 160, 184, 213, 221, 229, 237, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 444, 452, 460, 468, 492, 494, 521, 529, 537, 545, 569, 571, 599, 607, 615, 623, 647, 649, 676, 684, 692, 700, 724]
Discarding 45 places :
Implicit Place search using SMT with State Equation took 3685 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 685/737 places, 602/609 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 657 transition count 574
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 657 transition count 574
Applied a total of 56 rules in 86 ms. Remains 657 /685 variables (removed 28) and now considering 574/602 (removed 28) transitions.
// Phase 1: matrix 574 rows 657 cols
[2024-05-27 21:04:56] [INFO ] Computed 139 invariants in 7 ms
[2024-05-27 21:04:57] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-27 21:04:57] [INFO ] Invariant cache hit.
[2024-05-27 21:04:57] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:04:58] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/737 places, 574/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6313 ms. Remains : 657/737 places, 574/609 transitions.
Support contains 34 out of 657 places after structural reductions.
[2024-05-27 21:04:59] [INFO ] Flatten gal took : 175 ms
[2024-05-27 21:04:59] [INFO ] Flatten gal took : 97 ms
[2024-05-27 21:04:59] [INFO ] Input system was already deterministic with 574 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 984 ms. (steps per millisecond=10 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-27 21:05:01] [INFO ] Invariant cache hit.
[2024-05-27 21:05:01] [INFO ] [Real]Absence check using 139 positive place invariants in 74 ms returned sat
[2024-05-27 21:05:01] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-27 21:05:02] [INFO ] [Nat]Absence check using 139 positive place invariants in 61 ms returned sat
[2024-05-27 21:05:03] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-27 21:05:03] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:05:04] [INFO ] After 797ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-27 21:05:05] [INFO ] After 1960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 672 ms.
[2024-05-27 21:05:06] [INFO ] After 4619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 8 properties in 329 ms.
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 622 transition count 539
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 622 transition count 539
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 592 transition count 509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 591 transition count 528
Free-agglomeration rule applied 151 times.
Iterating global reduction 2 with 151 rules applied. Total rules applied 283 place count 591 transition count 377
Reduce places removed 151 places and 0 transitions.
Graph (complete) has 881 edges and 440 vertex of which 182 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.4 ms
Discarding 258 places :
Also discarding 207 output transitions
Drop transitions removed 207 transitions
Iterating post reduction 2 with 152 rules applied. Total rules applied 435 place count 182 transition count 170
Drop transitions removed 30 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 469 place count 182 transition count 136
Applied a total of 469 rules in 364 ms. Remains 182 /657 variables (removed 475) and now considering 136/574 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 182/657 places, 136/574 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :2
Finished Best-First random walk after 505 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=168 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 63 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-27 21:05:07] [INFO ] Computed 139 invariants in 8 ms
[2024-05-27 21:05:08] [INFO ] Implicit Places using invariants in 680 ms returned [136, 179, 649]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 686 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/657 places, 570/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 50 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-27 21:05:08] [INFO ] Computed 136 invariants in 4 ms
[2024-05-27 21:05:09] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-27 21:05:09] [INFO ] Invariant cache hit.
[2024-05-27 21:05:09] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:05:10] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3244 ms. Remains : 649/657 places, 569/574 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 344 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s273 0) (EQ s313 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 525 steps with 2 reset in 34 ms.
FORMULA Parking-PT-832-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-00 finished in 3731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p1)&&p0)||(p1&&(X(p2) U (!p3&&X(p2))))))))'
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 49 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-27 21:05:11] [INFO ] Computed 139 invariants in 5 ms
[2024-05-27 21:05:12] [INFO ] Implicit Places using invariants in 647 ms returned [179, 649]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 649 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/657 places, 570/574 transitions.
Applied a total of 0 rules in 24 ms. Remains 651 /651 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 723 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 585 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3))]
Running random walk in product with property : Parking-PT-832-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1 p3), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}, { cond=(AND p0 p1 p3), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={0} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 p3 p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s329 1) (EQ s351 1) (OR (NEQ s136 1) (NEQ s178 1))), p1:(EQ s388 1), p3:(OR (NOT (AND (EQ s329 1) (EQ s351 1))) (AND (EQ s136 1) (EQ s178 1)))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 489 steps with 72 reset in 51 ms.
FORMULA Parking-PT-832-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-01 finished in 1404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U !p0)))'
Support contains 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 592 transition count 509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 590 transition count 547
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 590 transition count 547
Applied a total of 135 rules in 309 ms. Remains 590 /657 variables (removed 67) and now considering 547/574 (removed 27) transitions.
// Phase 1: matrix 547 rows 590 cols
[2024-05-27 21:05:13] [INFO ] Computed 139 invariants in 10 ms
[2024-05-27 21:05:13] [INFO ] Implicit Places using invariants in 774 ms returned [135, 173, 587]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 777 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/657 places, 547/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 586 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 586 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 584 transition count 560
Applied a total of 6 rules in 149 ms. Remains 584 /587 variables (removed 3) and now considering 560/547 (removed -13) transitions.
// Phase 1: matrix 560 rows 584 cols
[2024-05-27 21:05:14] [INFO ] Computed 136 invariants in 9 ms
[2024-05-27 21:05:14] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-27 21:05:14] [INFO ] Invariant cache hit.
[2024-05-27 21:05:15] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-27 21:05:17] [INFO ] Implicit Places using invariants and state equation in 2207 ms returned []
Implicit Place search using SMT with State Equation took 3044 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 584/657 places, 560/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4294 ms. Remains : 584/657 places, 560/574 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s177 1) (EQ s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-02 finished in 4449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 589 transition count 546
Applied a total of 136 rules in 188 ms. Remains 589 /657 variables (removed 68) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 589 cols
[2024-05-27 21:05:17] [INFO ] Computed 139 invariants in 6 ms
[2024-05-27 21:05:18] [INFO ] Implicit Places using invariants in 583 ms returned [135, 173, 586]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 586 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 546/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 585 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 584 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 583 transition count 559
Applied a total of 6 rules in 132 ms. Remains 583 /586 variables (removed 3) and now considering 559/546 (removed -13) transitions.
// Phase 1: matrix 559 rows 583 cols
[2024-05-27 21:05:18] [INFO ] Computed 136 invariants in 5 ms
[2024-05-27 21:05:18] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-27 21:05:18] [INFO ] Invariant cache hit.
[2024-05-27 21:05:19] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-27 21:05:20] [INFO ] Implicit Places using invariants and state equation in 2157 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/657 places, 559/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3617 ms. Remains : 583/657 places, 559/574 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 4 ms.
FORMULA Parking-PT-832-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-03 finished in 3704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 132 place count 591 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 589 transition count 546
Applied a total of 136 rules in 237 ms. Remains 589 /657 variables (removed 68) and now considering 546/574 (removed 28) transitions.
// Phase 1: matrix 546 rows 589 cols
[2024-05-27 21:05:21] [INFO ] Computed 139 invariants in 5 ms
[2024-05-27 21:05:21] [INFO ] Implicit Places using invariants in 511 ms returned [135, 173, 586]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 513 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/657 places, 546/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 585 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 584 transition count 544
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 583 transition count 559
Applied a total of 6 rules in 77 ms. Remains 583 /586 variables (removed 3) and now considering 559/546 (removed -13) transitions.
// Phase 1: matrix 559 rows 583 cols
[2024-05-27 21:05:21] [INFO ] Computed 136 invariants in 6 ms
[2024-05-27 21:05:22] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-05-27 21:05:22] [INFO ] Invariant cache hit.
[2024-05-27 21:05:23] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-27 21:05:24] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/657 places, 559/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3506 ms. Remains : 583/657 places, 559/574 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 181 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-06 finished in 3570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 657 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 641 transition count 558
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 641 transition count 542
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 625 transition count 542
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 621 transition count 538
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 621 transition count 538
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 128 place count 593 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 591 transition count 548
Applied a total of 132 rules in 85 ms. Remains 591 /657 variables (removed 66) and now considering 548/574 (removed 26) transitions.
// Phase 1: matrix 548 rows 591 cols
[2024-05-27 21:05:24] [INFO ] Computed 139 invariants in 3 ms
[2024-05-27 21:05:25] [INFO ] Implicit Places using invariants in 372 ms returned [135, 173, 588]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 385 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/657 places, 548/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 587 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 587 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 586 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 585 transition count 561
Applied a total of 6 rules in 74 ms. Remains 585 /588 variables (removed 3) and now considering 561/548 (removed -13) transitions.
// Phase 1: matrix 561 rows 585 cols
[2024-05-27 21:05:25] [INFO ] Computed 136 invariants in 7 ms
[2024-05-27 21:05:25] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-27 21:05:25] [INFO ] Invariant cache hit.
[2024-05-27 21:05:26] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-27 21:05:27] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/657 places, 561/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3045 ms. Remains : 585/657 places, 561/574 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s70 1) (EQ s389 1)), p2:(NEQ s248 1), p1:(NEQ s485 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 513 reset in 1452 ms.
Product exploration explored 100000 steps with 516 reset in 1053 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 268 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 21:05:31] [INFO ] Invariant cache hit.
[2024-05-27 21:05:31] [INFO ] [Real]Absence check using 136 positive place invariants in 58 ms returned sat
[2024-05-27 21:05:32] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 21:05:32] [INFO ] [Nat]Absence check using 136 positive place invariants in 63 ms returned sat
[2024-05-27 21:05:33] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 21:05:33] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-27 21:05:34] [INFO ] After 410ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 21:05:34] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 338 ms.
[2024-05-27 21:05:34] [INFO ] After 2362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 99 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 561/561 transitions.
Free-agglomeration rule applied 157 times.
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 585 transition count 404
Reduce places removed 157 places and 0 transitions.
Graph (complete) has 899 edges and 428 vertex of which 232 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions removed 156 transitions
Iterating post reduction 0 with 158 rules applied. Total rules applied 315 place count 232 transition count 248
Drop transitions removed 32 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 367 place count 232 transition count 196
Applied a total of 367 rules in 93 ms. Remains 232 /585 variables (removed 353) and now considering 196/561 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 232/585 places, 196/561 transitions.
Finished random walk after 6499 steps, including 1 resets, run visited all 3 properties in 93 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p1))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 753 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 561/561 transitions.
Applied a total of 0 rules in 52 ms. Remains 585 /585 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-27 21:05:36] [INFO ] Invariant cache hit.
[2024-05-27 21:05:36] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-27 21:05:36] [INFO ] Invariant cache hit.
[2024-05-27 21:05:37] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-27 21:05:38] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
[2024-05-27 21:05:38] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-27 21:05:38] [INFO ] Invariant cache hit.
[2024-05-27 21:05:39] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3363 ms. Remains : 585/585 places, 561/561 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 284 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 21:05:40] [INFO ] Invariant cache hit.
[2024-05-27 21:05:40] [INFO ] [Real]Absence check using 136 positive place invariants in 38 ms returned sat
[2024-05-27 21:05:41] [INFO ] After 739ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 21:05:41] [INFO ] [Nat]Absence check using 136 positive place invariants in 59 ms returned sat
[2024-05-27 21:05:42] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 21:05:42] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-27 21:05:42] [INFO ] After 406ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 21:05:43] [INFO ] After 845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 367 ms.
[2024-05-27 21:05:43] [INFO ] After 2400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 98 ms.
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 561/561 transitions.
Free-agglomeration rule applied 157 times.
Iterating global reduction 0 with 157 rules applied. Total rules applied 157 place count 585 transition count 404
Reduce places removed 157 places and 0 transitions.
Graph (complete) has 899 edges and 428 vertex of which 232 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.1 ms
Discarding 196 places :
Also discarding 156 output transitions
Drop transitions removed 156 transitions
Iterating post reduction 0 with 158 rules applied. Total rules applied 315 place count 232 transition count 248
Drop transitions removed 32 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 367 place count 232 transition count 196
Applied a total of 367 rules in 79 ms. Remains 232 /585 variables (removed 353) and now considering 196/561 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 232/585 places, 196/561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :2
Finished Best-First random walk after 1203 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=401 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p1))), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 15 factoid took 771 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 512 reset in 1162 ms.
Product exploration explored 100000 steps with 515 reset in 900 ms.
Built C files in :
/tmp/ltsmin8323500188626794021
[2024-05-27 21:05:47] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2024-05-27 21:05:47] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:05:47] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2024-05-27 21:05:47] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:05:47] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2024-05-27 21:05:47] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:05:47] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8323500188626794021
Running compilation step : cd /tmp/ltsmin8323500188626794021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2735 ms.
Running link step : cd /tmp/ltsmin8323500188626794021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin8323500188626794021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13624866125370932831.hoa' '--buchi-type=spotba'
LTSmin run took 10635 ms.
FORMULA Parking-PT-832-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-832-LTLFireability-07 finished in 36409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(p1))||(p2&&(p0||G(p3))))))'
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 28 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-27 21:06:00] [INFO ] Computed 139 invariants in 2 ms
[2024-05-27 21:06:01] [INFO ] Implicit Places using invariants in 646 ms returned [136, 179, 650]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 648 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 650 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 650 transition count 570
Applied a total of 2 rules in 44 ms. Remains 650 /651 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 650 cols
[2024-05-27 21:06:01] [INFO ] Computed 136 invariants in 2 ms
[2024-05-27 21:06:02] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-27 21:06:02] [INFO ] Invariant cache hit.
[2024-05-27 21:06:02] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:06:03] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 650/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2835 ms. Remains : 650/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Parking-PT-832-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 3}]], initial=2, aps=[p1:(EQ s513 0), p3:(AND (EQ s315 1) (EQ s332 1)), p0:(EQ s513 1), p2:(EQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA Parking-PT-832-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-08 finished in 3074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 42 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-27 21:06:04] [INFO ] Computed 139 invariants in 3 ms
[2024-05-27 21:06:04] [INFO ] Implicit Places using invariants in 788 ms returned [136, 650]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 789 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 43 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-27 21:06:04] [INFO ] Computed 137 invariants in 3 ms
[2024-05-27 21:06:05] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-27 21:06:05] [INFO ] Invariant cache hit.
[2024-05-27 21:06:06] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:06:07] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2374 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3249 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s136 1) (EQ s178 1)), p1:(OR (AND (EQ s136 1) (EQ s178 1)) (EQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 190 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-10 finished in 3435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1||X(F(p2)))))))'
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 42 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-27 21:06:07] [INFO ] Computed 139 invariants in 3 ms
[2024-05-27 21:06:08] [INFO ] Implicit Places using invariants in 732 ms returned [136, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 735 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 44 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-27 21:06:08] [INFO ] Computed 137 invariants in 3 ms
[2024-05-27 21:06:09] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-05-27 21:06:09] [INFO ] Invariant cache hit.
[2024-05-27 21:06:09] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:06:10] [INFO ] Implicit Places using invariants and state equation in 1740 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3315 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s185 1) (EQ s203 1)), p2:(OR (EQ s250 0) (EQ s295 0)), p0:(OR (EQ s598 0) (EQ s647 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2329 ms.
Product exploration explored 100000 steps with 33333 reset in 2228 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 25 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-832-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-832-LTLFireability-11 finished in 8138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 653 transition count 570
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 653 transition count 570
Applied a total of 8 rules in 29 ms. Remains 653 /657 variables (removed 4) and now considering 570/574 (removed 4) transitions.
// Phase 1: matrix 570 rows 653 cols
[2024-05-27 21:06:15] [INFO ] Computed 139 invariants in 3 ms
[2024-05-27 21:06:16] [INFO ] Implicit Places using invariants in 768 ms returned [136, 179, 649]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 771 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/657 places, 570/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 44 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-27 21:06:16] [INFO ] Computed 136 invariants in 3 ms
[2024-05-27 21:06:17] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-05-27 21:06:17] [INFO ] Invariant cache hit.
[2024-05-27 21:06:17] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:06:18] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 649/657 places, 569/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3282 ms. Remains : 649/657 places, 569/574 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s486 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-13 finished in 3428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 656 transition count 558
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 641 transition count 558
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 641 transition count 543
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 626 transition count 543
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 622 transition count 539
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 622 transition count 539
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 128 place count 592 transition count 509
Applied a total of 128 rules in 114 ms. Remains 592 /657 variables (removed 65) and now considering 509/574 (removed 65) transitions.
// Phase 1: matrix 509 rows 592 cols
[2024-05-27 21:06:19] [INFO ] Computed 139 invariants in 2 ms
[2024-05-27 21:06:19] [INFO ] Implicit Places using invariants in 802 ms returned [134, 174, 589]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 804 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 589/657 places, 509/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 588 transition count 508
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 588 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 586 transition count 506
Applied a total of 6 rules in 66 ms. Remains 586 /589 variables (removed 3) and now considering 506/509 (removed 3) transitions.
// Phase 1: matrix 506 rows 586 cols
[2024-05-27 21:06:20] [INFO ] Computed 136 invariants in 2 ms
[2024-05-27 21:06:20] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-27 21:06:20] [INFO ] Invariant cache hit.
[2024-05-27 21:06:21] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/657 places, 506/574 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2902 ms. Remains : 586/657 places, 506/574 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-832-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s144 1), p0:(OR (EQ s364 0) (EQ s383 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 515 reset in 1110 ms.
Product exploration explored 100000 steps with 511 reset in 821 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:06:24] [INFO ] Invariant cache hit.
[2024-05-27 21:06:24] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:06:24] [INFO ] [Nat]Absence check using 136 positive place invariants in 53 ms returned sat
[2024-05-27 21:06:25] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:06:25] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-27 21:06:25] [INFO ] After 726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 506/506 transitions.
Applied a total of 0 rules in 23 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 21:06:25] [INFO ] Invariant cache hit.
[2024-05-27 21:06:26] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-27 21:06:26] [INFO ] Invariant cache hit.
[2024-05-27 21:06:27] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
[2024-05-27 21:06:27] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-27 21:06:27] [INFO ] Invariant cache hit.
[2024-05-27 21:06:28] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2377 ms. Remains : 586/586 places, 506/506 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:06:28] [INFO ] Invariant cache hit.
[2024-05-27 21:06:28] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:06:29] [INFO ] [Nat]Absence check using 136 positive place invariants in 60 ms returned sat
[2024-05-27 21:06:29] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:06:29] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-27 21:06:29] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 511 reset in 1036 ms.
Product exploration explored 100000 steps with 511 reset in 827 ms.
Built C files in :
/tmp/ltsmin9074982674064769308
[2024-05-27 21:06:32] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-27 21:06:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:06:32] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-27 21:06:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:06:32] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-27 21:06:32] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:06:32] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9074982674064769308
Running compilation step : cd /tmp/ltsmin9074982674064769308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1817 ms.
Running link step : cd /tmp/ltsmin9074982674064769308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9074982674064769308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6267550854282128757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 506/506 transitions.
Applied a total of 0 rules in 20 ms. Remains 586 /586 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-27 21:06:47] [INFO ] Invariant cache hit.
[2024-05-27 21:06:47] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-27 21:06:47] [INFO ] Invariant cache hit.
[2024-05-27 21:06:48] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2024-05-27 21:06:48] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-27 21:06:48] [INFO ] Invariant cache hit.
[2024-05-27 21:06:49] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2433 ms. Remains : 586/586 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin2127231248551574207
[2024-05-27 21:06:49] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-27 21:06:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:06:49] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-27 21:06:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:06:49] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-27 21:06:49] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:06:49] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2127231248551574207
Running compilation step : cd /tmp/ltsmin2127231248551574207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1873 ms.
Running link step : cd /tmp/ltsmin2127231248551574207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2127231248551574207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11803110529824538089.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:07:04] [INFO ] Flatten gal took : 50 ms
[2024-05-27 21:07:04] [INFO ] Flatten gal took : 32 ms
[2024-05-27 21:07:04] [INFO ] Time to serialize gal into /tmp/LTL1663319952181633005.gal : 7 ms
[2024-05-27 21:07:04] [INFO ] Time to serialize properties into /tmp/LTL851144412714128926.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1663319952181633005.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2536493909948798644.hoa' '-atoms' '/tmp/LTL851144412714128926.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL851144412714128926.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2536493909948798644.hoa
Detected timeout of ITS tools.
[2024-05-27 21:07:20] [INFO ] Flatten gal took : 28 ms
[2024-05-27 21:07:20] [INFO ] Flatten gal took : 37 ms
[2024-05-27 21:07:20] [INFO ] Time to serialize gal into /tmp/LTL2144207046410974771.gal : 6 ms
[2024-05-27 21:07:20] [INFO ] Time to serialize properties into /tmp/LTL4909654397369677983.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2144207046410974771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4909654397369677983.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p439==0)||(p471==0))")||(G("(p156!=1)"))))))
Formula 0 simplified : G(F!"(p156!=1)" & FG!"((p439==0)||(p471==0))")
Detected timeout of ITS tools.
[2024-05-27 21:07:35] [INFO ] Flatten gal took : 45 ms
[2024-05-27 21:07:35] [INFO ] Applying decomposition
[2024-05-27 21:07:35] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7623667914327943890.txt' '-o' '/tmp/graph7623667914327943890.bin' '-w' '/tmp/graph7623667914327943890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7623667914327943890.bin' '-l' '-1' '-v' '-w' '/tmp/graph7623667914327943890.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:07:35] [INFO ] Decomposing Gal with order
[2024-05-27 21:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:07:35] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-27 21:07:35] [INFO ] Flatten gal took : 126 ms
[2024-05-27 21:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 37 ms.
[2024-05-27 21:07:35] [INFO ] Time to serialize gal into /tmp/LTL11725051535185075850.gal : 19 ms
[2024-05-27 21:07:35] [INFO ] Time to serialize properties into /tmp/LTL7617670551210190962.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11725051535185075850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7617670551210190962.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i9.u154.p439==0)||(i9.u169.p471==0))")||(G("(i2.u68.p156!=1)"))))))
Formula 0 simplified : G(F!"(i2.u68.p156!=1)" & FG!"((i9.u154.p439==0)||(i9.u169.p471==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14534905365530032794
[2024-05-27 21:07:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14534905365530032794
Running compilation step : cd /tmp/ltsmin14534905365530032794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1358 ms.
Running link step : cd /tmp/ltsmin14534905365530032794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14534905365530032794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-832-LTLFireability-14 finished in 106912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p1)&&p0)))))'
Support contains 3 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 574/574 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 654 transition count 571
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 654 transition count 571
Applied a total of 6 rules in 28 ms. Remains 654 /657 variables (removed 3) and now considering 571/574 (removed 3) transitions.
// Phase 1: matrix 571 rows 654 cols
[2024-05-27 21:08:05] [INFO ] Computed 139 invariants in 2 ms
[2024-05-27 21:08:06] [INFO ] Implicit Places using invariants in 828 ms returned [136, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 831 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 652/657 places, 571/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 651 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 651 transition count 570
Applied a total of 2 rules in 44 ms. Remains 651 /652 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 651 cols
[2024-05-27 21:08:06] [INFO ] Computed 137 invariants in 3 ms
[2024-05-27 21:08:07] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-27 21:08:07] [INFO ] Invariant cache hit.
[2024-05-27 21:08:07] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 21:08:08] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 651/657 places, 570/574 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2904 ms. Remains : 651/657 places, 570/574 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s418 1), p0:(AND (EQ s617 1) (EQ s647 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 211 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLFireability-15 finished in 3108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2024-05-27 21:08:09] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8684533322435119820
[2024-05-27 21:08:09] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2024-05-27 21:08:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:08:09] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2024-05-27 21:08:09] [INFO ] Applying decomposition
[2024-05-27 21:08:09] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:08:09] [INFO ] Flatten gal took : 39 ms
[2024-05-27 21:08:09] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2024-05-27 21:08:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:08:09] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8684533322435119820
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11999113788752500265.txt' '-o' '/tmp/graph11999113788752500265.bin' '-w' '/tmp/graph11999113788752500265.weights'
Running compilation step : cd /tmp/ltsmin8684533322435119820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11999113788752500265.bin' '-l' '-1' '-v' '-w' '/tmp/graph11999113788752500265.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:08:09] [INFO ] Decomposing Gal with order
[2024-05-27 21:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:08:09] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-27 21:08:09] [INFO ] Flatten gal took : 84 ms
[2024-05-27 21:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-27 21:08:09] [INFO ] Time to serialize gal into /tmp/LTLFireability6622032497885799198.gal : 25 ms
[2024-05-27 21:08:09] [INFO ] Time to serialize properties into /tmp/LTLFireability4302979932358419847.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6622032497885799198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4302979932358419847.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i10.u159.p439==0)||(i10.u173.p471==0))")||(G("(i3.i2.i2.u68.p156!=1)"))))))
Formula 0 simplified : G(F!"(i3.i2.i2.u68.p156!=1)" & FG!"((i10.u159.p439==0)||(i10.u173.p471==0))")
Compilation finished in 2535 ms.
Running link step : cd /tmp/ltsmin8684533322435119820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin8684533322435119820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i3.i2.i2.u79.t129, i5.u102.t111, i6.u127.t93, i7.i0.i4.u151.t75, i10.u174.t57, i12.t436, i12....336
Computing Next relation with stutter on 7.8311e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2603 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,26.2174,616176,1,0,1.49797e+06,4774,9535,2.08774e+06,679,16338,1566410
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 264482 ms.

BK_STOP 1716844157313

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-832"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Parking-PT-832, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654421900058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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