About the Execution of 2023-gold for AutonomousCar-PT-01a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
320.144 | 10192.00 | 17608.00 | 513.10 | TFFFFTFFFFFFFFTF | normal |
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.r043-smll-171620180200138.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 AutonomousCar-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200138
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 11K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716305659786
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=AutonomousCar-PT-01a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:34:22] [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-21 15:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:34:22] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-21 15:34:22] [INFO ] Transformed 25 places.
[2024-05-21 15:34:22] [INFO ] Transformed 35 transitions.
[2024-05-21 15:34:22] [INFO ] Found NUPN structural information;
[2024-05-21 15:34:22] [INFO ] Parsed PT model containing 25 places and 35 transitions and 143 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA AutonomousCar-PT-01a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Applied a total of 2 rules in 25 ms. Remains 24 /25 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 24 cols
[2024-05-21 15:34:22] [INFO ] Computed 5 invariants in 16 ms
[2024-05-21 15:34:23] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 15:34:23] [INFO ] Invariant cache hit.
[2024-05-21 15:34:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:34:23] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 428 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 25/26 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 459 ms. Remains : 23/25 places, 25/26 transitions.
Support contains 16 out of 23 places after structural reductions.
[2024-05-21 15:34:23] [INFO ] Flatten gal took : 48 ms
[2024-05-21 15:34:23] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:34:23] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 1449 steps, including 126 resets, run visited all 14 properties in 76 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 1 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-01a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 20 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 18 transition count 19
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 19
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 2 with 4 rules applied. Total rules applied 14 place count 16 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 17
Applied a total of 16 rules in 18 ms. Remains 15 /23 variables (removed 8) and now considering 17/25 (removed 8) transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-21 15:34:24] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:34:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 15:34:24] [INFO ] Invariant cache hit.
[2024-05-21 15:34:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 15:34:24] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 111 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 17/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 14/23 places, 17/25 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 233 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s3 1) (EQ s10 1) (EQ s13 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 5 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-01 finished in 449 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((F(p0) U p1))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 23 cols
[2024-05-21 15:34:24] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:34:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 15:34:24] [INFO ] Invariant cache hit.
[2024-05-21 15:34:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:34:24] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 22/23 places, 25/25 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s4 1) (EQ s17 1) (EQ s20 1)), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s7 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-03 finished in 378 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' '!((p0 U (!p0&&G(!p1)&&F(G((p0 U p2))))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 21 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 20 transition count 22
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 3 with 2 rules applied. Total rules applied 8 place count 19 transition count 21
Applied a total of 8 rules in 9 ms. Remains 19 /23 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 19 cols
[2024-05-21 15:34:25] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 15:34:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 15:34:25] [INFO ] Invariant cache hit.
[2024-05-21 15:34:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 15:34:25] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/23 places, 21/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 18/23 places, 21/25 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) p1 p0), true, p1, (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6 1), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s7 1) (EQ s14 1)), p2:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 359 ms.
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-04 finished in 796 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' '!(((p0&&(p1||F(p2))) U (G(p2) U X(p3))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 23
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 22 cols
[2024-05-21 15:34:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:34:25] [INFO ] Implicit Places using invariants in 58 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 23/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 21/23 places, 23/25 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s17 1) (EQ s19 1)), p0:(EQ s0 1), p1:(EQ s12 1), p3:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/21 stabilizing places and 2/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 32 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01a-LTLFireability-05 finished in 985 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(X(F((p0||G(p1)))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 23 cols
[2024-05-21 15:34:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:34:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 15:34:26] [INFO ] Invariant cache hit.
[2024-05-21 15:34:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:34:26] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 22/23 places, 25/25 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s20 1), p0:(AND (EQ s1 1) (EQ s2 1) (EQ s7 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-06 finished in 298 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(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 20 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 18 transition count 19
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 14 place count 16 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 15 transition count 17
Applied a total of 16 rules in 19 ms. Remains 15 /23 variables (removed 8) and now considering 17/25 (removed 8) transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-21 15:34:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:34:27] [INFO ] Implicit Places using invariants in 59 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/23 places, 17/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 14/23 places, 17/25 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-08 finished in 179 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(p0)) U G((p0||F(p1)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 20 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 21
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 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 20
Applied a total of 12 rules in 9 ms. Remains 17 /23 variables (removed 6) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-05-21 15:34:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:34:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 15:34:27] [INFO ] Invariant cache hit.
[2024-05-21 15:34:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 15:34:27] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/23 places, 20/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 16/23 places, 20/25 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s6 1) (EQ s12 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s8 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-10 finished in 245 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(G(p0))&&G(p1)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 23
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 22 cols
[2024-05-21 15:34:27] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:34:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 15:34:27] [INFO ] Invariant cache hit.
[2024-05-21 15:34:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 15:34:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 23/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 21/23 places, 23/25 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s15 1), p0:(AND (EQ s1 1) (EQ s4 1) (EQ s16 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-11 finished in 355 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((p0||X(p1))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 23 cols
[2024-05-21 15:34:27] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 15:34:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 15:34:27] [INFO ] Invariant cache hit.
[2024-05-21 15:34:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 15:34:28] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 22/23 places, 25/25 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s10 1) (EQ s17 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s9 1) (EQ s17 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]]
Product exploration explored 100000 steps with 33333 reset in 166 ms.
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01a-LTLFireability-14 finished in 702 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(p0))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 25/25 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 22
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 18 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 18 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 16 transition count 18
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 16 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 15 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 14 transition count 17
Applied a total of 15 rules in 15 ms. Remains 14 /23 variables (removed 9) and now considering 17/25 (removed 8) transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-05-21 15:34:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:34:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 15:34:28] [INFO ] Invariant cache hit.
[2024-05-21 15:34:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:34:28] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/23 places, 17/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 13/23 places, 17/25 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 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 11 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01a-LTLFireability-15 finished in 175 ms.
All properties solved by simple procedures.
Total runtime 6318 ms.
BK_STOP 1716305669978
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="AutonomousCar-PT-01a"
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 AutonomousCar-PT-01a, 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 r043-smll-171620180200138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01a.tgz
mv AutonomousCar-PT-01a 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 '
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 ;