About the Execution of ITS-Tools for Referendum-PT-1000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 553.147 | 57375.00 | 71644.00 | 416.90 | FFTFTTTFFFFTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889197300524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Referendum-PT-1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197300524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 34M
-rw-r--r-- 1 mcc users 589K Feb 26 19:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Feb 26 19:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 574K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 556K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 26 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 26 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 72K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 176K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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-1000-LTLFireability-00
FORMULA_NAME Referendum-PT-1000-LTLFireability-01
FORMULA_NAME Referendum-PT-1000-LTLFireability-02
FORMULA_NAME Referendum-PT-1000-LTLFireability-03
FORMULA_NAME Referendum-PT-1000-LTLFireability-04
FORMULA_NAME Referendum-PT-1000-LTLFireability-05
FORMULA_NAME Referendum-PT-1000-LTLFireability-06
FORMULA_NAME Referendum-PT-1000-LTLFireability-07
FORMULA_NAME Referendum-PT-1000-LTLFireability-08
FORMULA_NAME Referendum-PT-1000-LTLFireability-09
FORMULA_NAME Referendum-PT-1000-LTLFireability-10
FORMULA_NAME Referendum-PT-1000-LTLFireability-11
FORMULA_NAME Referendum-PT-1000-LTLFireability-12
FORMULA_NAME Referendum-PT-1000-LTLFireability-13
FORMULA_NAME Referendum-PT-1000-LTLFireability-14
FORMULA_NAME Referendum-PT-1000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679016112181
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 01:21:53] [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]
[2023-03-17 01:21:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 01:21:53] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-17 01:21:53] [INFO ] Transformed 3001 places.
[2023-03-17 01:21:53] [INFO ] Transformed 2001 transitions.
[2023-03-17 01:21:53] [INFO ] Found NUPN structural information;
[2023-03-17 01:21:53] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 76 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-PT-1000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 3000 place count 1001 transition count 1001
Applied a total of 3000 rules in 128 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2023-03-17 01:21:54] [INFO ] Computed 0 place invariants in 26 ms
[2023-03-17 01:21:54] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-17 01:21:54] [INFO ] Invariant cache hit.
[2023-03-17 01:21:55] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-17 01:21:55] [INFO ] Invariant cache hit.
[2023-03-17 01:21:55] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1364 ms. Remains : 1001/3001 places, 1001/2001 transitions.
Support contains 1001 out of 1001 places after structural reductions.
[2023-03-17 01:21:56] [INFO ] Flatten gal took : 268 ms
[2023-03-17 01:21:56] [INFO ] Flatten gal took : 198 ms
[2023-03-17 01:21:57] [INFO ] Input system was already deterministic with 1001 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 01:21:57] [INFO ] Invariant cache hit.
[2023-03-17 01:21:58] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))&&(G(p2)||F(p1))))'
Support contains 1001 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 6 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 01:21:58] [INFO ] Invariant cache hit.
[2023-03-17 01:21:59] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-17 01:21:59] [INFO ] Invariant cache hit.
[2023-03-17 01:21:59] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-17 01:21:59] [INFO ] Invariant cache hit.
[2023-03-17 01:21:59] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s0 1), p1:(AND (EQ s276 0) (EQ s406 0) (EQ s796 0) (EQ s926 0) (EQ s536 0) (EQ s666 0) (EQ s65 0) (EQ s227 0) (EQ s487 0) (EQ s747 0) (EQ s357 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 6 ms.
FORMULA Referendum-PT-1000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-00 finished in 1354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 27 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 01:22:00] [INFO ] Invariant cache hit.
[2023-03-17 01:22:00] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-17 01:22:00] [INFO ] Invariant cache hit.
[2023-03-17 01:22:00] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-17 01:22:00] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-17 01:22:00] [INFO ] Invariant cache hit.
[2023-03-17 01:22:01] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1081 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1001 steps with 0 reset in 109 ms.
FORMULA Referendum-PT-1000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-01 finished in 1287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((F(!p0)||p1))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 01:22:01] [INFO ] Invariant cache hit.
[2023-03-17 01:22:01] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-17 01:22:01] [INFO ] Invariant cache hit.
[2023-03-17 01:22:02] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-17 01:22:02] [INFO ] Invariant cache hit.
[2023-03-17 01:22:02] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33305 reset in 7968 ms.
Product exploration explored 100000 steps with 33343 reset in 8148 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-02 finished in 18416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p1)&&p0))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 01:22:19] [INFO ] Invariant cache hit.
[2023-03-17 01:22:20] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-17 01:22:20] [INFO ] Invariant cache hit.
[2023-03-17 01:22:20] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-17 01:22:20] [INFO ] Invariant cache hit.
[2023-03-17 01:22:20] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-03 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: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (NEQ s276 1) (NEQ s406 1) (NEQ s796 1) (NEQ s926 1) (NEQ s536 1) (NEQ s666 1) (NEQ s65 1) (NEQ s227 1) (NEQ s487 1) (NEQ s747 1) (NEQ s357 1) (NEQ...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-03 finished in 1122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(X(F(p0))))))))'
Support contains 1000 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 01:22:21] [INFO ] Invariant cache hit.
[2023-03-17 01:22:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-17 01:22:21] [INFO ] Invariant cache hit.
[2023-03-17 01:22:21] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-17 01:22:21] [INFO ] Invariant cache hit.
[2023-03-17 01:22:21] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s276 0) (EQ s406 0) (EQ s796 0) (EQ s926 0) (EQ s536 0) (EQ s666 0) (EQ s65 0) (EQ s227 0) (EQ s487 0) (EQ s747 0) (EQ s357 0) (EQ s877 0) (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][false, false, false]]
Product exploration explored 100000 steps with 99 reset in 4478 ms.
Product exploration explored 100000 steps with 99 reset in 4763 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
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 : [p0, (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-04 finished in 10628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1) U p2)||p0)))'
Support contains 1001 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 6 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2023-03-17 01:22:31] [INFO ] Invariant cache hit.
[2023-03-17 01:22:31] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-17 01:22:31] [INFO ] Invariant cache hit.
[2023-03-17 01:22:32] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-17 01:22:32] [INFO ] Invariant cache hit.
[2023-03-17 01:22:32] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s276 1) (EQ s406 1) (EQ s796 1) (EQ s926 1) (EQ s536 1) (EQ s666 1) (EQ s65 1) (EQ s227 1) (EQ s487 1) (EQ s747 1) (EQ s357 1) (EQ s877 1) (EQ ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5387 ms.
Product exploration explored 100000 steps with 50000 reset in 5643 ms.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 9 factoid took 146 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-1000-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-05 finished in 13145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 2 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.5 ms
Discarding 999 places :
Also discarding 999 output transitions
Drop transitions removed 999 transitions
Applied a total of 1 rules in 11 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 01:22:44] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 01:22:44] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 01:22:44] [INFO ] Invariant cache hit.
[2023-03-17 01:22:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 01:22:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 01:22:44] [INFO ] Invariant cache hit.
[2023-03-17 01:22:44] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1001 places, 2/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/1001 places, 2/1001 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 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 4 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-10 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(G(p1))||F(p2)))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 996 places :
Symmetric choice reduction at 0 with 996 rule applications. Total rules 996 place count 5 transition count 5
Iterating global reduction 0 with 996 rules applied. Total rules applied 1992 place count 5 transition count 5
Applied a total of 1992 rules in 26 ms. Remains 5 /1001 variables (removed 996) and now considering 5/1001 (removed 996) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-17 01:22:44] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 01:22:44] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 01:22:44] [INFO ] Invariant cache hit.
[2023-03-17 01:22:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-17 01:22:45] [INFO ] Invariant cache hit.
[2023-03-17 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/1001 places, 5/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 5/1001 places, 5/1001 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s4 1), p1:(EQ s3 1), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 90 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 10 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-11 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p0))) U p1))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 20 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 01:22:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 01:22:45] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 01:22:45] [INFO ] Invariant cache hit.
[2023-03-17 01:22:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-17 01:22:45] [INFO ] Invariant cache hit.
[2023-03-17 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p0), true]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 60 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-12 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&G(F(p1))) U X((p2||X(G(p1))))))'
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 996 places :
Symmetric choice reduction at 0 with 996 rule applications. Total rules 996 place count 5 transition count 5
Iterating global reduction 0 with 996 rules applied. Total rules applied 1992 place count 5 transition count 5
Applied a total of 1992 rules in 22 ms. Remains 5 /1001 variables (removed 996) and now considering 5/1001 (removed 996) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-17 01:22:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 01:22:46] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 01:22:46] [INFO ] Invariant cache hit.
[2023-03-17 01:22:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-17 01:22:46] [INFO ] Invariant cache hit.
[2023-03-17 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/1001 places, 5/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 5/1001 places, 5/1001 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 8}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s4 1), p0:(EQ s2 1), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 58 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 p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p2))))
Knowledge based reduction with 14 factoid took 372 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-13 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 997 places :
Symmetric choice reduction at 0 with 997 rule applications. Total rules 997 place count 4 transition count 4
Iterating global reduction 0 with 997 rules applied. Total rules applied 1994 place count 4 transition count 4
Applied a total of 1994 rules in 19 ms. Remains 4 /1001 variables (removed 997) and now considering 4/1001 (removed 997) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 01:22:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 01:22:47] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 01:22:47] [INFO ] Invariant cache hit.
[2023-03-17 01:22:47] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2023-03-17 01:22:47] [INFO ] Invariant cache hit.
[2023-03-17 01:22:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/1001 places, 4/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 4/1001 places, 4/1001 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s2 0), p1:(OR (EQ s3 0) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 99 reset in 116 ms.
Product exploration explored 100000 steps with 99 reset in 81 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 p0 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-1000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-1000-LTLFireability-14 finished in 752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 19 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 01:22:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 01:22:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 01:22:48] [INFO ] Invariant cache hit.
[2023-03-17 01:22:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-17 01:22:48] [INFO ] Invariant cache hit.
[2023-03-17 01:22:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/1001 places, 3/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 3/1001 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s0 1), p1:(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]]
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-1000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLFireability-15 finished in 222 ms.
All properties solved by simple procedures.
Total runtime 54760 ms.
BK_STOP 1679016169556
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-1000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is Referendum-PT-1000, 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 r325-tall-167889197300524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 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 ;