About the Execution of 2023-gold for DES-PT-00a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1865.995 | 35249.00 | 85745.00 | 514.50 | FFFFTTFFFFTFTFTF | 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.r109-tall-171624208400378.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 DES-PT-00a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 08:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 31K 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 DES-PT-00a-LTLFireability-00
FORMULA_NAME DES-PT-00a-LTLFireability-01
FORMULA_NAME DES-PT-00a-LTLFireability-02
FORMULA_NAME DES-PT-00a-LTLFireability-03
FORMULA_NAME DES-PT-00a-LTLFireability-04
FORMULA_NAME DES-PT-00a-LTLFireability-05
FORMULA_NAME DES-PT-00a-LTLFireability-06
FORMULA_NAME DES-PT-00a-LTLFireability-07
FORMULA_NAME DES-PT-00a-LTLFireability-08
FORMULA_NAME DES-PT-00a-LTLFireability-09
FORMULA_NAME DES-PT-00a-LTLFireability-10
FORMULA_NAME DES-PT-00a-LTLFireability-11
FORMULA_NAME DES-PT-00a-LTLFireability-12
FORMULA_NAME DES-PT-00a-LTLFireability-13
FORMULA_NAME DES-PT-00a-LTLFireability-14
FORMULA_NAME DES-PT-00a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716331473833
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=DES-PT-00a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 22:44:35] [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 22:44:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:44:35] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-21 22:44:35] [INFO ] Transformed 115 places.
[2024-05-21 22:44:35] [INFO ] Transformed 76 transitions.
[2024-05-21 22:44:35] [INFO ] Found NUPN structural information;
[2024-05-21 22:44:35] [INFO ] Parsed PT model containing 115 places and 76 transitions and 373 arcs in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-00a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Applied a total of 0 rules in 13 ms. Remains 115 /115 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 115 cols
[2024-05-21 22:44:35] [INFO ] Computed 57 invariants in 14 ms
[2024-05-21 22:44:35] [INFO ] Implicit Places using invariants in 476 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/115 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 518 ms. Remains : 114/115 places, 62/62 transitions.
Support contains 49 out of 114 places after structural reductions.
[2024-05-21 22:44:36] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:44:36] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:44:36] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 43 out of 114 places (down from 49) after GAL structural reductions.
Finished random walk after 227 steps, including 3 resets, run visited all 25 properties in 28 ms. (steps per millisecond=8 )
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' '!(F(G(p0)))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
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 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
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 0 with 4 rules applied. Total rules applied 8 place count 110 transition count 58
Applied a total of 8 rules in 28 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 22:44:36] [INFO ] Computed 56 invariants in 9 ms
[2024-05-21 22:44:36] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 22:44:36] [INFO ] Invariant cache hit.
[2024-05-21 22:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:44:36] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 248 ms. Remains : 109/114 places, 58/62 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 136 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00a-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:(OR (NEQ s2 1) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2670 reset in 287 ms.
Stack based approach found an accepted trace after 81631 steps with 2173 reset with depth 69 and stack size 69 in 201 ms.
FORMULA DES-PT-00a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DES-PT-00a-LTLFireability-01 finished in 916 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 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
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 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
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 8 place count 110 transition count 58
Applied a total of 8 rules in 16 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
[2024-05-21 22:44:37] [INFO ] Invariant cache hit.
[2024-05-21 22:44:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:44:37] [INFO ] Invariant cache hit.
[2024-05-21 22:44:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:44:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-02 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:(AND (EQ s8 1) (EQ s90 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 19 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-02 finished in 279 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(((p1 U p2)&&p0))))'
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
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 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
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 8 place count 110 transition count 58
Applied a total of 8 rules in 13 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
[2024-05-21 22:44:37] [INFO ] Invariant cache hit.
[2024-05-21 22:44:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:44:37] [INFO ] Invariant cache hit.
[2024-05-21 22:44:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:44:37] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DES-PT-00a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s106 1) (EQ s108 1)), p0:(AND (EQ s20 1) (EQ s25 1) (EQ s27 1)), p1:(OR (AND (EQ s20 1) (EQ s25 1) (EQ s27 1)) (AND (EQ s10 1) (EQ s101 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 37 steps with 0 reset in 1 ms.
FORMULA DES-PT-00a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-03 finished in 280 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((G(p0)||(p1&&X(p2))))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 6 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 22:44:38] [INFO ] Computed 56 invariants in 3 ms
[2024-05-21 22:44:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:44:38] [INFO ] Invariant cache hit.
[2024-05-21 22:44:38] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-21 22:44:38] [INFO ] Invariant cache hit.
[2024-05-21 22:44:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-00a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p2:(OR (EQ s32 0) (EQ s34 0)), p0:(OR (NEQ s69 1) (NEQ s85 1)), p1:(OR (EQ s69 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 275 ms.
Product exploration explored 100000 steps with 25000 reset in 219 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 p2 p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 22:44:39] [INFO ] Invariant cache hit.
[2024-05-21 22:44:39] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:44:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-21 22:44:39] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 3 ms returned sat
[2024-05-21 22:44:39] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 22:44:39] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-21 22:44:39] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 209 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=69 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-21 22:44:40] [INFO ] Invariant cache hit.
[2024-05-21 22:44:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 22:44:40] [INFO ] Invariant cache hit.
[2024-05-21 22:44:40] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-21 22:44:40] [INFO ] Invariant cache hit.
[2024-05-21 22:44:40] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 113/113 places, 61/61 transitions.
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 p0 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 22:44:40] [INFO ] Invariant cache hit.
[2024-05-21 22:44:40] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:44:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-21 22:44:40] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 6 ms returned sat
[2024-05-21 22:44:40] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 22:44:40] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-21 22:44:40] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 217 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=108 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p2), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 154 ms.
Product exploration explored 100000 steps with 25000 reset in 172 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 61
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 20 ms. Remains 113 /113 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-21 22:44:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 22:44:42] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 22:44:42] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 61/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 113/113 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin5464794650669709908
[2024-05-21 22:44:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5464794650669709908
Running compilation step : cd /tmp/ltsmin5464794650669709908;'/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 309 ms.
Running link step : cd /tmp/ltsmin5464794650669709908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5464794650669709908;'/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' '--hoa' '/tmp/stateBased4709359467785937688.hoa' '--buchi-type=spotba'
LTSmin run took 177 ms.
FORMULA DES-PT-00a-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-04 finished in 4877 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)))'
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 22:44:42] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 22:44:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:44:42] [INFO ] Invariant cache hit.
[2024-05-21 22:44:43] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-21 22:44:43] [INFO ] Invariant cache hit.
[2024-05-21 22:44:43] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/113 stabilizing places and 1/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-05 finished in 658 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&&F(p1)))||G(!p2))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
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 8 place count 110 transition count 58
Applied a total of 8 rules in 15 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 22:44:43] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 22:44:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 22:44:43] [INFO ] Invariant cache hit.
[2024-05-21 22:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:44:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 150 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s82 0)), p2:(AND (EQ s8 1) (EQ s90 1)), p1:(OR (EQ s8 0) (EQ s90 0))], 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 9935 reset in 206 ms.
Product exploration explored 100000 steps with 10025 reset in 213 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 p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 174 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 85 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 261 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 109 cols
[2024-05-21 22:44:44] [INFO ] Computed 55 invariants in 3 ms
[2024-05-21 22:44:44] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 22:44:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-21 22:44:44] [INFO ] [Nat]Absence check using 33 positive and 22 generalized place invariants in 3 ms returned sat
[2024-05-21 22:44:44] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p2)), (F (AND p2 (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 16 factoid took 434 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-21 22:44:45] [INFO ] Invariant cache hit.
[2024-05-21 22:44:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 22:44:45] [INFO ] Invariant cache hit.
[2024-05-21 22:44:45] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 22:44:45] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-21 22:44:45] [INFO ] Invariant cache hit.
[2024-05-21 22:44:45] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 109/109 places, 58/58 transitions.
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 p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Finished random walk after 1488 steps, including 42 resets, run visited all 6 properties in 6 ms. (steps per millisecond=248 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 13 factoid took 327 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Product exploration explored 100000 steps with 10063 reset in 196 ms.
Product exploration explored 100000 steps with 9845 reset in 206 ms.
Built C files in :
/tmp/ltsmin6316148383425576861
[2024-05-21 22:44:46] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-21 22:44:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:44:46] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-21 22:44:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:44:46] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-21 22:44:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:44:46] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6316148383425576861
Running compilation step : cd /tmp/ltsmin6316148383425576861;'/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 154 ms.
Running link step : cd /tmp/ltsmin6316148383425576861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6316148383425576861;'/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/stateBased1061300288784057746.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA DES-PT-00a-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-06 finished in 3420 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(p1)&&X((F(G(p3))&&p2))&&p0)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 7 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 22:44:46] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 22:44:47] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:44:47] [INFO ] Invariant cache hit.
[2024-05-21 22:44:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 22:44:47] [INFO ] Invariant cache hit.
[2024-05-21 22:44:47] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DES-PT-00a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s27 1)), p1:(OR (EQ s45 0) (EQ s62 0)), p2:(AND (EQ s47 1) (EQ s64 1)), p3:(AND (EQ s6 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-00a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-07 finished in 435 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(p0))||F(p1)))'
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2024-05-21 22:44:47] [INFO ] Invariant cache hit.
[2024-05-21 22:44:47] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:44:47] [INFO ] Invariant cache hit.
[2024-05-21 22:44:47] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-21 22:44:47] [INFO ] Invariant cache hit.
[2024-05-21 22:44:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(OR (AND (EQ s97 1) (EQ s99 1)) (AND (EQ s101 1) (EQ s103 1)) (AND (EQ s35 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s50 1) (EQ s52...], 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 122 steps with 4 reset in 2 ms.
FORMULA DES-PT-00a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-08 finished in 500 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&&X(p1)))||(F(p2)&&F(p0))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 114 cols
[2024-05-21 22:44:47] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 22:44:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:44:48] [INFO ] Invariant cache hit.
[2024-05-21 22:44:48] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 22:44:48] [INFO ] Invariant cache hit.
[2024-05-21 22:44:48] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 114/114 places, 62/62 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s93 1)), p0:(EQ s6 1), p1:(AND (EQ s37 1) (EQ s106 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18184 reset in 190 ms.
Product exploration explored 100000 steps with 18160 reset in 190 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), false, false, false]
Finished random walk after 11 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND p0 p2))]
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), false, false, false]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), false, false, false]
[2024-05-21 22:44:49] [INFO ] Invariant cache hit.
[2024-05-21 22:44:49] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 22:44:49] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 27 ms returned sat
[2024-05-21 22:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:44:49] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-21 22:44:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:44:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 22:44:49] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 13 ms returned sat
[2024-05-21 22:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:44:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:44:50] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:44:50] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2024-05-21 22:44:50] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 5 ms.
[2024-05-21 22:44:50] [INFO ] Added : 57 causal constraints over 12 iterations in 119 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 22:44:50] [INFO ] Invariant cache hit.
[2024-05-21 22:44:50] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 22:44:50] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 13 ms returned sat
[2024-05-21 22:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:44:50] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-21 22:44:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:44:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 22:44:50] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 8 ms returned sat
[2024-05-21 22:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:44:50] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 22:44:50] [INFO ] Computed and/alt/rep : 59/174/59 causal constraints (skipped 2 transitions) in 4 ms.
[2024-05-21 22:44:50] [INFO ] Added : 58 causal constraints over 12 iterations in 118 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 114 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 61
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 0 with 4 rules applied. Total rules applied 6 place count 111 transition count 59
Applied a total of 6 rules in 7 ms. Remains 111 /114 variables (removed 3) and now considering 59/62 (removed 3) transitions.
// Phase 1: matrix 59 rows 111 cols
[2024-05-21 22:44:50] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 22:44:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 22:44:50] [INFO ] Invariant cache hit.
[2024-05-21 22:44:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:44:50] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 183 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/114 places, 59/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 110/114 places, 59/62 transitions.
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 p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-10 finished in 2861 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(p0)||X(F(p1))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 22:44:50] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 22:44:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:44:50] [INFO ] Invariant cache hit.
[2024-05-21 22:44:50] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-21 22:44:50] [INFO ] Invariant cache hit.
[2024-05-21 22:44:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, 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: 2}]], initial=1, aps=[p1:(EQ s16 1), p0:(AND (EQ s41 1) (EQ s58 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][false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 8 reset in 1 ms.
FORMULA DES-PT-00a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-11 finished in 330 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))&&F(p1)))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 61
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 2 place count 113 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 60
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 8 place count 110 transition count 58
Applied a total of 8 rules in 13 ms. Remains 110 /114 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 22:44:51] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 22:44:51] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 22:44:51] [INFO ] Invariant cache hit.
[2024-05-21 22:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:44:51] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/114 places, 58/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 109/114 places, 58/62 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-00a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s25 0) (EQ s27 0)), p1:(OR (EQ s106 0) (EQ s108 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3341 reset in 155 ms.
Product exploration explored 100000 steps with 3330 reset in 171 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 p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 44 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 58/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 109 cols
[2024-05-21 22:44:52] [INFO ] Computed 55 invariants in 5 ms
[2024-05-21 22:44:52] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:44:52] [INFO ] Invariant cache hit.
[2024-05-21 22:44:52] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-21 22:44:52] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-21 22:44:52] [INFO ] Invariant cache hit.
[2024-05-21 22:44:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 109/109 places, 58/58 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 85 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3346 reset in 156 ms.
Product exploration explored 100000 steps with 3347 reset in 173 ms.
Built C files in :
/tmp/ltsmin15211479818085721015
[2024-05-21 22:44:53] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-21 22:44:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:44:53] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-21 22:44:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:44:53] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-21 22:44:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:44:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15211479818085721015
Running compilation step : cd /tmp/ltsmin15211479818085721015;'/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 171 ms.
Running link step : cd /tmp/ltsmin15211479818085721015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15211479818085721015;'/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/stateBased1717765608694980332.hoa' '--buchi-type=spotba'
LTSmin run took 12740 ms.
FORMULA DES-PT-00a-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00a-LTLFireability-12 finished in 15173 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(G(p1))||(p2&&F(p3)))&&p0)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 113 cols
[2024-05-21 22:45:06] [INFO ] Computed 56 invariants in 5 ms
[2024-05-21 22:45:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:45:06] [INFO ] Invariant cache hit.
[2024-05-21 22:45:06] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 22:45:06] [INFO ] Invariant cache hit.
[2024-05-21 22:45:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DES-PT-00a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s26 1) (EQ s28 1)), p2:(EQ s5 0), p3:(OR (EQ s33 0) (EQ s105 0) (EQ s21 0) (EQ s26 0) (EQ s28 0)), p1:(OR (EQ s21 0) (EQ s26 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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 0 ms.
FORMULA DES-PT-00a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00a-LTLFireability-13 finished in 374 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(p0)||X(F(p1))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 61
Applied a total of 2 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2024-05-21 22:45:06] [INFO ] Invariant cache hit.
[2024-05-21 22:45:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 22:45:06] [INFO ] Invariant cache hit.
[2024-05-21 22:45:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 22:45:06] [INFO ] Invariant cache hit.
[2024-05-21 22:45:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 113/114 places, 61/62 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, 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: 2}]], initial=1, aps=[p1:(AND (EQ s9 1) (EQ s93 1)), p0:(AND (EQ s6 1) (EQ s27 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][false, false, false]]
Product exploration explored 100000 steps with 18161 reset in 143 ms.
Product exploration explored 100000 steps with 18187 reset in 154 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) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
[2024-05-21 22:45:07] [INFO ] Invariant cache hit.
[2024-05-21 22:45:07] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-21 22:45:07] [INFO ] [Real]Absence check using 34 positive and 22 generalized place invariants in 7 ms returned sat
[2024-05-21 22:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:45:07] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:45:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 22:45:07] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 5 ms returned sat
[2024-05-21 22:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:45:07] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 22:45:07] [INFO ] Computed and/alt/rep : 58/168/58 causal constraints (skipped 2 transitions) in 4 ms.
[2024-05-21 22:45:07] [INFO ] Added : 54 causal constraints over 11 iterations in 103 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 60
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 2 place count 112 transition count 60
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 110 transition count 58
Applied a total of 6 rules in 13 ms. Remains 110 /113 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 110 cols
[2024-05-21 22:45:07] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 22:45:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 22:45:07] [INFO ] Invariant cache hit.
[2024-05-21 22:45:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:45:08] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 155 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/113 places, 58/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 109/113 places, 58/61 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00a-LTLFireability-14 finished in 1420 ms.
All properties solved by simple procedures.
Total runtime 32865 ms.
BK_STOP 1716331509082
--------------------
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="DES-PT-00a"
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 DES-PT-00a, 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 r109-tall-171624208400378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00a.tgz
mv DES-PT-00a 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 ;