About the Execution of LTSMin+red for Eratosthenes-PT-050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
427.716 | 9272.00 | 16509.00 | 205.60 | FTFFFFTFFFTFTFFT | 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.r492-smll-171636266500244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Eratosthenes-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266500244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 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 50K 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 Eratosthenes-PT-050-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717239415241
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:56:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:56:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:56:57] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-01 10:56:57] [INFO ] Transformed 49 places.
[2024-06-01 10:56:57] [INFO ] Transformed 108 transitions.
[2024-06-01 10:56:57] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 99 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA Eratosthenes-PT-050-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 48 place count 33 transition count 33
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 29 transition count 29
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 29 transition count 29
Applied a total of 56 rules in 28 ms. Remains 29 /34 variables (removed 5) and now considering 29/80 (removed 51) transitions.
// Phase 1: matrix 29 rows 29 cols
[2024-06-01 10:56:57] [INFO ] Computed 0 invariants in 4 ms
[2024-06-01 10:56:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 10:56:57] [INFO ] Invariant cache hit.
[2024-06-01 10:56:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
Starting structural reductions in LTL mode, iteration 1 : 29/34 places, 29/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 29/34 places, 29/80 transitions.
Support contains 28 out of 29 places after structural reductions.
[2024-06-01 10:56:58] [INFO ] Flatten gal took : 20 ms
[2024-06-01 10:56:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 10:56:58] [INFO ] Input system was already deterministic with 29 transitions.
RANDOM walk for 186 steps (2 resets) in 53 ms. (3 steps per ms) remains 0/28 properties
Computed a total of 29 stabilizing places and 29 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 29
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U X(p1)) U X(X(p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5 transition count 5
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5 transition count 5
Applied a total of 48 rules in 2 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 10:56:58] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:56:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 10:56:58] [INFO ] Invariant cache hit.
[2024-06-01 10:56:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 748 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-00
Stuttering criterion allowed to conclude after 59 steps with 8 reset in 4 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-00 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0 U (p1||G(p0)))) U X(p2)))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 5 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 10 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 10:56:59] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:56:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 10:56:59] [INFO ] Invariant cache hit.
[2024-06-01 10:56:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 10:56:59] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), false]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-02
Stuttering criterion allowed to conclude after 54 steps with 15 reset in 1 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-02 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9 transition count 9
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9 transition count 9
Applied a total of 40 rules in 2 ms. Remains 9 /29 variables (removed 20) and now considering 9/29 (removed 20) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-06-01 10:57:00] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:57:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 10:57:00] [INFO ] Invariant cache hit.
[2024-06-01 10:57:00] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 9/29 places, 9/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 9/29 places, 9/29 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-03 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(!p1)||(!p1&&F(p2))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 5 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 10:57:00] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 10:57:00] [INFO ] Invariant cache hit.
[2024-06-01 10:57:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 10:57:00] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-04 finished in 228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1))))))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 6 transition count 6
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 6 transition count 6
Applied a total of 46 rules in 1 ms. Remains 6 /29 variables (removed 23) and now considering 6/29 (removed 23) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 10:57:00] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 10:57:00] [INFO ] Invariant cache hit.
[2024-06-01 10:57:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 6/29 places, 6/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 6/29 places, 6/29 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-06
Product exploration explored 100000 steps with 16446 reset in 331 ms.
Product exploration explored 100000 steps with 16438 reset in 232 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-06 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 6 transition count 6
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 6 transition count 6
Applied a total of 46 rules in 1 ms. Remains 6 /29 variables (removed 23) and now considering 6/29 (removed 23) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 10:57:01] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 10:57:01] [INFO ] Invariant cache hit.
[2024-06-01 10:57:01] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 6/29 places, 6/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 6/29 places, 6/29 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), p1, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-07 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0) U (p1 U p2))))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5 transition count 5
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5 transition count 5
Applied a total of 48 rules in 1 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 10:57:01] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:57:01] [INFO ] Invariant cache hit.
[2024-06-01 10:57:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 5/29 places, 5/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 5/29 places, 5/29 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-08
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-08 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G(F(p1)) U !p0)&&X(G(p2)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 3 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 10:57:02] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 10:57:02] [INFO ] Invariant cache hit.
[2024-06-01 10:57:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 10:57:02] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/29 places, 3/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 3/29 places, 3/29 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 2 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-09 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3 transition count 3
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3 transition count 3
Applied a total of 52 rules in 11 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 10:57:02] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:57:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 10:57:02] [INFO ] Invariant cache hit.
[2024-06-01 10:57:02] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 3/29 places, 3/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 3/29 places, 3/29 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-11
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-11 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(!p0)&&X((p1 U p2)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 10:57:02] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 10:57:02] [INFO ] Invariant cache hit.
[2024-06-01 10:57:02] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 4/29 places, 4/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 4/29 places, 4/29 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-12
Product exploration explored 100000 steps with 38044 reset in 255 ms.
Product exploration explored 100000 steps with 38119 reset in 147 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-12 finished in 690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||G(p1)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 10:57:03] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:03] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 10:57:03] [INFO ] Invariant cache hit.
[2024-06-01 10:57:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 4/29 places, 4/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 4/29 places, 4/29 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-13 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 1 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 28 output transitions
Drop transitions (Output transitions of discarded places.) removed 28 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /29 variables (removed 28) and now considering 1/29 (removed 28) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-06-01 10:57:03] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:57:03] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 10:57:03] [INFO ] Invariant cache hit.
[2024-06-01 10:57:03] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 10:57:03] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1/29 places, 1/29 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 1/29 places, 1/29 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-LTLFireability-14 finished in 134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 10:57:03] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:57:03] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 10:57:03] [INFO ] Invariant cache hit.
[2024-06-01 10:57:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 4/29 places, 4/29 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 4/29 places, 4/29 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-050-LTLFireability-15
Product exploration explored 100000 steps with 35244 reset in 72 ms.
Product exploration explored 100000 steps with 35257 reset in 82 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-050-LTLFireability-15 finished in 393 ms.
All properties solved by simple procedures.
Total runtime 7093 ms.
ITS solved all properties within timeout
BK_STOP 1717239424513
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Eratosthenes-PT-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Eratosthenes-PT-050, 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 r492-smll-171636266500244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-050.tgz
mv Eratosthenes-PT-050 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 ;