About the Execution of 2023-gold for Referendum-PT-0100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 613.396 | 14035.00 | 23629.00 | 498.60 | FFFFFTFFTTTTTTFT | 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.r329-tall-171662362200383.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 Referendum-PT-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362200383
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 73K Apr 11 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 361K Apr 11 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 11 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 254K Apr 11 16:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 146K Apr 11 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 748K Apr 11 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 690K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0100-LTLFireability-00
FORMULA_NAME Referendum-PT-0100-LTLFireability-01
FORMULA_NAME Referendum-PT-0100-LTLFireability-02
FORMULA_NAME Referendum-PT-0100-LTLFireability-03
FORMULA_NAME Referendum-PT-0100-LTLFireability-04
FORMULA_NAME Referendum-PT-0100-LTLFireability-05
FORMULA_NAME Referendum-PT-0100-LTLFireability-06
FORMULA_NAME Referendum-PT-0100-LTLFireability-07
FORMULA_NAME Referendum-PT-0100-LTLFireability-08
FORMULA_NAME Referendum-PT-0100-LTLFireability-09
FORMULA_NAME Referendum-PT-0100-LTLFireability-10
FORMULA_NAME Referendum-PT-0100-LTLFireability-11
FORMULA_NAME Referendum-PT-0100-LTLFireability-12
FORMULA_NAME Referendum-PT-0100-LTLFireability-13
FORMULA_NAME Referendum-PT-0100-LTLFireability-14
FORMULA_NAME Referendum-PT-0100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716861937853
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=Referendum-PT-0100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:05:39] [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-28 02:05:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:05:39] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-28 02:05:39] [INFO ] Transformed 301 places.
[2024-05-28 02:05:39] [INFO ] Transformed 201 transitions.
[2024-05-28 02:05:39] [INFO ] Found NUPN structural information;
[2024-05-28 02:05:39] [INFO ] Parsed PT model containing 301 places and 201 transitions and 501 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Support contains 101 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 101 transition count 101
Applied a total of 300 rules in 10 ms. Remains 101 /301 variables (removed 200) and now considering 101/201 (removed 100) transitions.
// Phase 1: matrix 101 rows 101 cols
[2024-05-28 02:05:39] [INFO ] Computed 0 invariants in 9 ms
[2024-05-28 02:05:39] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-28 02:05:39] [INFO ] Invariant cache hit.
[2024-05-28 02:05:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-28 02:05:40] [INFO ] Invariant cache hit.
[2024-05-28 02:05:40] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/301 places, 101/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 101/301 places, 101/201 transitions.
Support contains 101 out of 101 places after structural reductions.
[2024-05-28 02:05:40] [INFO ] Flatten gal took : 33 ms
[2024-05-28 02:05:40] [INFO ] Flatten gal took : 18 ms
[2024-05-28 02:05:40] [INFO ] Input system was already deterministic with 101 transitions.
Finished random walk after 315 steps, including 3 resets, run visited all 18 properties in 19 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:40] [INFO ] Invariant cache hit.
[2024-05-28 02:05:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 02:05:40] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-28 02:05:41] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 101/101 places, 101/101 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 225 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 10 ms.
FORMULA Referendum-PT-0100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-00 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-28 02:05:41] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-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 (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-01 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(!p1))))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-28 02:05:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 02:05:41] [INFO ] Invariant cache hit.
[2024-05-28 02:05:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1), p1:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 203 steps with 1 reset in 6 ms.
FORMULA Referendum-PT-0100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-02 finished in 316 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)||(!p1 U X(!p1))))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(EQ s0 1), p1:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-03 finished in 406 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(X(F(G(F(G(((!X(p0) U p1)&&p0))))))))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-28 02:05:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 32 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s0 1), p0:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-04 finished in 193 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 U X((X(p2)||p1)))))'
Support contains 101 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-28 02:05:42] [INFO ] Invariant cache hit.
[2024-05-28 02:05:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 7}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p2:(OR (EQ s1 1) (EQ s66 1) (EQ s5 1) (EQ s70 1) (EQ s9 1) (EQ s74 1) (EQ s13 1) (EQ s78 1) (EQ s17 1) (EQ s82 1) (EQ s21 1) (EQ s86 1) (EQ s25 1) (EQ s90...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 579 ms.
Product exploration explored 100000 steps with 33333 reset in 486 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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) p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-05 finished in 1631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1)&&X(G(p0))))))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (EQ s1 0) (EQ s66 0) (EQ s5 0) (EQ s70 0) (EQ s9 0) (EQ s74 0) (EQ s13 0) (EQ s78 0) (EQ s17 0) (EQ s82 0) (EQ s21 0) (EQ s86 0) (EQ s25 0) (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-06 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 100 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 101/101 places, 101/101 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 0) (EQ s66 0) (EQ s5 0) (EQ s70 0) (EQ s9 0) (EQ s74 0) (EQ s13 0) (EQ s78 0) (EQ s17 0) (EQ s82 0) (EQ s21 0) (EQ s86 0) (EQ s25 0) (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-07 finished in 255 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 U p1)&&p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 3 transition count 3
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 3 transition count 3
Applied a total of 196 rules in 6 ms. Remains 3 /101 variables (removed 98) and now considering 3/101 (removed 98) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:05:44] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:05:44] [INFO ] Invariant cache hit.
[2024-05-28 02:05:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/101 places, 3/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 3/101 places, 3/101 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s2 1), p1:(EQ s0 1)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 24983 reset in 61 ms.
Product exploration explored 100000 steps with 25066 reset in 54 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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) p1), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, p1, p1, p1]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, p1, p1, p1]
Stuttering acceptance computed with spot in 145 ms :[true, p1, p1, p1]
[2024-05-28 02:05:46] [INFO ] Invariant cache hit.
[2024-05-28 02:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:05:46] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-28 02:05:46] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-28 02:05:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-05-28 02:05:46] [INFO ] Invariant cache hit.
[2024-05-28 02:05:46] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-28 02:05:46] [INFO ] Invariant cache hit.
[2024-05-28 02:05:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:05:46] [INFO ] Invariant cache hit.
[2024-05-28 02:05:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 p1 (NOT p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, p1, p1, p1]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, p1, p1, p1]
Stuttering acceptance computed with spot in 138 ms :[true, p1, p1, p1]
[2024-05-28 02:05:47] [INFO ] Invariant cache hit.
[2024-05-28 02:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:05:47] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-28 02:05:47] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-28 02:05:47] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 119 ms :[true, p1, p1, p1]
Product exploration explored 100000 steps with 25049 reset in 51 ms.
Product exploration explored 100000 steps with 25035 reset in 51 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 188 ms :[true, p1, p1, p1]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 2 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
[2024-05-28 02:05:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2024-05-28 02:05:47] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:05:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 2/3 places, 2/3 transitions.
Built C files in :
/tmp/ltsmin15894940520281067088
[2024-05-28 02:05:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15894940520281067088
Running compilation step : cd /tmp/ltsmin15894940520281067088;'/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 163 ms.
Running link step : cd /tmp/ltsmin15894940520281067088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15894940520281067088;'/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/stateBased15752318611885312008.hoa' '--buchi-type=spotba'
LTSmin run took 249 ms.
FORMULA Referendum-PT-0100-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0100-LTLFireability-08 finished in 3390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(p1) U p2)||p0)))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 5 transition count 5
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 5 transition count 5
Applied a total of 192 rules in 5 ms. Remains 5 /101 variables (removed 96) and now considering 5/101 (removed 96) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 02:05:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:48] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-28 02:05:48] [INFO ] Invariant cache hit.
[2024-05-28 02:05:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-28 02:05:48] [INFO ] Invariant cache hit.
[2024-05-28 02:05:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/101 places, 5/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 5/101 places, 5/101 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s3 1) (EQ s2 1)), p2:(EQ s3 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 33333 reset in 54 ms.
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p2)))]
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 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-09 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Graph (complete) has 100 edges and 101 vertex of which 1 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /101 variables (removed 100) and now considering 1/101 (removed 100) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-28 02:05:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:05:48] [INFO ] Invariant cache hit.
[2024-05-28 02:05:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:05:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:05:48] [INFO ] Invariant cache hit.
[2024-05-28 02:05:48] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/101 places, 1/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 1/101 places, 1/101 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 35 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-10 finished in 305 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(F(p0))||(F(p0)&&(!p1||X(!p2)))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 4 transition count 4
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 4 transition count 4
Applied a total of 194 rules in 2 ms. Remains 4 /101 variables (removed 97) and now considering 4/101 (removed 97) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 02:05:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 02:05:48] [INFO ] Invariant cache hit.
[2024-05-28 02:05:48] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-28 02:05:48] [INFO ] Invariant cache hit.
[2024-05-28 02:05:48] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/101 places, 4/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 4/101 places, 4/101 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 1), p1:(AND (EQ s3 1) (NEQ s2 1)), p2:(OR (EQ s3 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 34 ms.
Product exploration explored 100000 steps with 50000 reset in 45 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) (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 30 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-11 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 4 transition count 4
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 4 transition count 4
Applied a total of 194 rules in 2 ms. Remains 4 /101 variables (removed 97) and now considering 4/101 (removed 97) transitions.
[2024-05-28 02:05:49] [INFO ] Invariant cache hit.
[2024-05-28 02:05:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 02:05:49] [INFO ] Invariant cache hit.
[2024-05-28 02:05:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:05:49] [INFO ] Invariant cache hit.
[2024-05-28 02:05:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/101 places, 4/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 4/101 places, 4/101 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2 1), p1:(EQ s3 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 50000 reset in 38 ms.
Product exploration explored 100000 steps with 50000 reset in 39 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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-12 finished in 329 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(G(p1)))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Graph (complete) has 100 edges and 101 vertex of which 3 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.1 ms
Discarding 98 places :
Also discarding 98 output transitions
Drop transitions removed 98 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /101 variables (removed 98) and now considering 3/101 (removed 98) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:05:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:05:49] [INFO ] Invariant cache hit.
[2024-05-28 02:05:49] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-28 02:05:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:05:49] [INFO ] Invariant cache hit.
[2024-05-28 02:05:49] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/101 places, 3/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 3/101 places, 3/101 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s0 0)), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 27285 reset in 90 ms.
Product exploration explored 100000 steps with 27283 reset in 81 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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) p1), (X (NOT p0)), (X (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X 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 20 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-13 finished in 402 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||((F(p1) U p2) U (G((F(p1) U p2))||(!p2&&(F(p1) U p2)))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Graph (complete) has 100 edges and 101 vertex of which 3 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.0 ms
Discarding 98 places :
Also discarding 98 output transitions
Drop transitions removed 98 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /101 variables (removed 98) and now considering 3/101 (removed 98) transitions.
[2024-05-28 02:05:50] [INFO ] Invariant cache hit.
[2024-05-28 02:05:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:05:50] [INFO ] Invariant cache hit.
[2024-05-28 02:05:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-28 02:05:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:05:50] [INFO ] Invariant cache hit.
[2024-05-28 02:05:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/101 places, 3/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 3/101 places, 3/101 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s1 1)), p2:(EQ s1 1), p1:(EQ s2 1)], 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]]
Stuttering criterion allowed to conclude after 23 steps with 8 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLFireability-14 finished in 243 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))||G(!p1)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Graph (complete) has 100 edges and 101 vertex of which 1 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /101 variables (removed 100) and now considering 1/101 (removed 100) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-28 02:05:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:50] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-28 02:05:50] [INFO ] Invariant cache hit.
[2024-05-28 02:05:50] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-28 02:05:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:05:50] [INFO ] Invariant cache hit.
[2024-05-28 02:05:50] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/101 places, 1/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 1/101 places, 1/101 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Product exploration explored 100000 steps with 50000 reset in 39 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLFireability-15 finished in 325 ms.
All properties solved by simple procedures.
Total runtime 11277 ms.
BK_STOP 1716861951888
--------------------
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="Referendum-PT-0100"
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 Referendum-PT-0100, 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 r329-tall-171662362200383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0100.tgz
mv Referendum-PT-0100 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 ;