About the Execution of 2023-gold for Referendum-PT-0500
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11803.376 | 2977949.00 | 11462708.00 | 1222.40 | TTFTTTFFFFFFTFFF | 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-171662362200392.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-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362200392
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 641K Apr 11 20:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K Apr 11 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 17:43 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 246K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 813K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 286K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 339K Apr 12 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 614K Apr 11 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 11 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 124K 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 571K 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-0500-LTLCardinality-00
FORMULA_NAME Referendum-PT-0500-LTLCardinality-01
FORMULA_NAME Referendum-PT-0500-LTLCardinality-02
FORMULA_NAME Referendum-PT-0500-LTLCardinality-03
FORMULA_NAME Referendum-PT-0500-LTLCardinality-04
FORMULA_NAME Referendum-PT-0500-LTLCardinality-05
FORMULA_NAME Referendum-PT-0500-LTLCardinality-06
FORMULA_NAME Referendum-PT-0500-LTLCardinality-07
FORMULA_NAME Referendum-PT-0500-LTLCardinality-08
FORMULA_NAME Referendum-PT-0500-LTLCardinality-09
FORMULA_NAME Referendum-PT-0500-LTLCardinality-10
FORMULA_NAME Referendum-PT-0500-LTLCardinality-11
FORMULA_NAME Referendum-PT-0500-LTLCardinality-12
FORMULA_NAME Referendum-PT-0500-LTLCardinality-13
FORMULA_NAME Referendum-PT-0500-LTLCardinality-14
FORMULA_NAME Referendum-PT-0500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716862161970
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:09:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:09:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:09:23] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-28 02:09:23] [INFO ] Transformed 1501 places.
[2024-05-28 02:09:23] [INFO ] Transformed 1001 transitions.
[2024-05-28 02:09:23] [INFO ] Found NUPN structural information;
[2024-05-28 02:09:23] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 43 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2024-05-28 02:09:24] [INFO ] Computed 500 invariants in 16 ms
[2024-05-28 02:09:24] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-28 02:09:24] [INFO ] Invariant cache hit.
[2024-05-28 02:09:25] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2024-05-28 02:09:25] [INFO ] Invariant cache hit.
[2024-05-28 02:09:26] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2190 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Support contains 1501 out of 1501 places after structural reductions.
[2024-05-28 02:09:26] [INFO ] Flatten gal took : 156 ms
[2024-05-28 02:09:26] [INFO ] Flatten gal took : 71 ms
[2024-05-28 02:09:26] [INFO ] Input system was already deterministic with 1001 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:09:28] [INFO ] Invariant cache hit.
[2024-05-28 02:09:29] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:09:29] [INFO ] [Nat]Absence check using 500 positive place invariants in 103 ms returned sat
[2024-05-28 02:09:29] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 1501 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1501 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 1001 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.6 ms
Discarding 500 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 46 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-28 02:09:30] [INFO ] Computed 0 invariants in 4 ms
[2024-05-28 02:09:30] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-28 02:09:30] [INFO ] Invariant cache hit.
[2024-05-28 02:09:30] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-28 02:09:30] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-28 02:09:30] [INFO ] Invariant cache hit.
[2024-05-28 02:09:31] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 1001/1501 places, 1001/1001 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 164 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 2 (ADD s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 ...], 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 5778 ms.
Product exploration explored 100000 steps with 50000 reset in 5744 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 : [(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 15 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-0500-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-00 finished in 13217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 501 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.7 ms
Discarding 1000 places :
Also discarding 0 output transitions
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 501 transition count 501
Applied a total of 501 rules in 26 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2024-05-28 02:09:43] [INFO ] Computed 0 invariants in 2 ms
[2024-05-28 02:09:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 02:09:43] [INFO ] Invariant cache hit.
[2024-05-28 02:09:43] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-28 02:09:43] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 02:09:43] [INFO ] Invariant cache hit.
[2024-05-28 02:09:43] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 501/1501 places, 501/1001 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-04 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:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 374 reset in 3821 ms.
Product exploration explored 100000 steps with 398 reset in 3968 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-04 finished in 8625 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 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 501 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 501 transition count 501
Applied a total of 501 rules in 22 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
[2024-05-28 02:09:51] [INFO ] Invariant cache hit.
[2024-05-28 02:09:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 02:09:51] [INFO ] Invariant cache hit.
[2024-05-28 02:09:52] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-28 02:09:52] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 02:09:52] [INFO ] Invariant cache hit.
[2024-05-28 02:09:52] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 554 ms. Remains : 501/1501 places, 501/1001 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 199 reset in 5597 ms.
Product exploration explored 100000 steps with 199 reset in 5722 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLCardinality-05 finished in 12089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 1001 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.5 ms
Discarding 500 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1001 transition count 1001
Applied a total of 2 rules in 132 ms. Remains 1001 /1501 variables (removed 500) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-05-28 02:10:04] [INFO ] Computed 0 invariants in 11 ms
[2024-05-28 02:10:04] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 02:10:04] [INFO ] Invariant cache hit.
[2024-05-28 02:10:04] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-05-28 02:10:04] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:10:04] [INFO ] Invariant cache hit.
[2024-05-28 02:10:05] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1501 places, 1001/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1149 ms. Remains : 1001/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-06 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:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1180 reset in 5576 ms.
Product exploration explored 100000 steps with 1072 reset in 5771 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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-28 02:10:17] [INFO ] Invariant cache hit.
[2024-05-28 02:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:19] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-05-28 02:10:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:10:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:22] [INFO ] [Nat]Absence check using state equation in 1256 ms returned sat
[2024-05-28 02:10:22] [INFO ] Computed and/alt/rep : 999/1997/999 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-28 02:10:28] [INFO ] Added : 499 causal constraints over 100 iterations in 5385 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 501 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 36 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-28 02:10:28] [INFO ] Invariant cache hit.
[2024-05-28 02:10:28] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 02:10:28] [INFO ] Invariant cache hit.
[2024-05-28 02:10:28] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-28 02:10:28] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 02:10:28] [INFO ] Invariant cache hit.
[2024-05-28 02:10:29] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1145 ms. Remains : 1001/1001 places, 1001/1001 transitions.
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2024-05-28 02:10:30] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:32] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-28 02:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 02:10:35] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2024-05-28 02:10:35] [INFO ] Computed and/alt/rep : 999/1997/999 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-28 02:10:40] [INFO ] Added : 499 causal constraints over 100 iterations in 5012 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1195 reset in 5611 ms.
Product exploration explored 100000 steps with 1255 reset in 5816 ms.
Built C files in :
/tmp/ltsmin10429590815398572823
[2024-05-28 02:10:51] [INFO ] Computing symmetric may disable matrix : 1001 transitions.
[2024-05-28 02:10:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:10:51] [INFO ] Computing symmetric may enable matrix : 1001 transitions.
[2024-05-28 02:10:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:10:51] [INFO ] Computing Do-Not-Accords matrix : 1001 transitions.
[2024-05-28 02:10:51] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:10:51] [INFO ] Built C files in 239ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10429590815398572823
Running compilation step : cd /tmp/ltsmin10429590815398572823;'/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 2890 ms.
Running link step : cd /tmp/ltsmin10429590815398572823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin10429590815398572823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16916576524783673087.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 501 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 30 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2024-05-28 02:11:06] [INFO ] Invariant cache hit.
[2024-05-28 02:11:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 02:11:06] [INFO ] Invariant cache hit.
[2024-05-28 02:11:07] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-28 02:11:07] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:11:07] [INFO ] Invariant cache hit.
[2024-05-28 02:11:07] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1118 ms. Remains : 1001/1001 places, 1001/1001 transitions.
Built C files in :
/tmp/ltsmin490240439119531938
[2024-05-28 02:11:07] [INFO ] Computing symmetric may disable matrix : 1001 transitions.
[2024-05-28 02:11:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:11:07] [INFO ] Computing symmetric may enable matrix : 1001 transitions.
[2024-05-28 02:11:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:11:08] [INFO ] Computing Do-Not-Accords matrix : 1001 transitions.
[2024-05-28 02:11:08] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:11:08] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin490240439119531938
Running compilation step : cd /tmp/ltsmin490240439119531938;'/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 2603 ms.
Running link step : cd /tmp/ltsmin490240439119531938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin490240439119531938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6571089001949086987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:11:23] [INFO ] Flatten gal took : 61 ms
[2024-05-28 02:11:23] [INFO ] Flatten gal took : 61 ms
[2024-05-28 02:11:23] [INFO ] Time to serialize gal into /tmp/LTL8026876972550553819.gal : 8 ms
[2024-05-28 02:11:23] [INFO ] Time to serialize properties into /tmp/LTL9554743059145584411.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8026876972550553819.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3463223006225517327.hoa' '-atoms' '/tmp/LTL9554743059145584411.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9554743059145584411.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3463223006225517327.hoa
Detected timeout of ITS tools.
[2024-05-28 02:11:38] [INFO ] Flatten gal took : 61 ms
[2024-05-28 02:11:38] [INFO ] Flatten gal took : 94 ms
[2024-05-28 02:11:38] [INFO ] Time to serialize gal into /tmp/LTL1647619474218907645.gal : 17 ms
[2024-05-28 02:11:38] [INFO ] Time to serialize properties into /tmp/LTL16026668922093817804.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1647619474218907645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16026668922093817804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+vot...7431
Formula 0 simplified : FG!"((((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+voted...7425
Detected timeout of ITS tools.
[2024-05-28 02:11:53] [INFO ] Flatten gal took : 60 ms
[2024-05-28 02:11:53] [INFO ] Applying decomposition
[2024-05-28 02:11:53] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3831947555821134919.txt' '-o' '/tmp/graph3831947555821134919.bin' '-w' '/tmp/graph3831947555821134919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3831947555821134919.bin' '-l' '-1' '-v' '-w' '/tmp/graph3831947555821134919.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:11:54] [INFO ] Decomposing Gal with order
[2024-05-28 02:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:11:54] [INFO ] Removed a total of 241 redundant transitions.
[2024-05-28 02:11:54] [INFO ] Flatten gal took : 352 ms
[2024-05-28 02:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 77 ms.
[2024-05-28 02:11:54] [INFO ] Time to serialize gal into /tmp/LTL7108793361330935615.gal : 23 ms
[2024-05-28 02:11:54] [INFO ] Time to serialize properties into /tmp/LTL15193069069539253312.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7108793361330935615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15193069069539253312.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0.voted_no_7+gu0...9435
Formula 0 simplified : FG!"((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0.voted_no_7+gu0.v...9429
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6514509200121138886
[2024-05-28 02:12:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6514509200121138886
Running compilation step : cd /tmp/ltsmin6514509200121138886;'/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 1601 ms.
Running link step : cd /tmp/ltsmin6514509200121138886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6514509200121138886;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Referendum-PT-0500-LTLCardinality-06 finished in 140982 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)||G(p1))))'
Support contains 1001 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Applied a total of 0 rules in 30 ms. Remains 1501 /1501 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
// Phase 1: matrix 1001 rows 1501 cols
[2024-05-28 02:12:24] [INFO ] Computed 500 invariants in 5 ms
[2024-05-28 02:12:25] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-28 02:12:25] [INFO ] Invariant cache hit.
[2024-05-28 02:12:26] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-05-28 02:12:26] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:12:26] [INFO ] Invariant cache hit.
[2024-05-28 02:12:26] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1810 ms. Remains : 1501/1501 places, 1001/1001 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38...], nbAcceptance=2, 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 501 steps with 0 reset in 118 ms.
FORMULA Referendum-PT-0500-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-07 finished in 2003 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 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 999 places and 0 transitions.
Ensure Unique test removed 499 transitions
Reduce isomorphic transitions removed 499 transitions.
Iterating post reduction 0 with 1498 rules applied. Total rules applied 1498 place count 502 transition count 502
Discarding 497 places :
Symmetric choice reduction at 1 with 497 rule applications. Total rules 1995 place count 5 transition count 5
Iterating global reduction 1 with 497 rules applied. Total rules applied 2492 place count 5 transition count 5
Applied a total of 2492 rules in 30 ms. Remains 5 /1501 variables (removed 1496) and now considering 5/1001 (removed 996) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 02:12:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/1501 places, 5/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 5/1501 places, 5/1001 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-09 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 (NEQ s4 0) (NEQ s1 1))], 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 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-09 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(p1))))'
Support contains 3 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 998 places and 0 transitions.
Ensure Unique test removed 498 transitions
Reduce isomorphic transitions removed 498 transitions.
Iterating post reduction 0 with 1496 rules applied. Total rules applied 1496 place count 503 transition count 503
Discarding 497 places :
Symmetric choice reduction at 1 with 497 rule applications. Total rules 1993 place count 6 transition count 6
Iterating global reduction 1 with 497 rules applied. Total rules applied 2490 place count 6 transition count 6
Applied a total of 2490 rules in 12 ms. Remains 6 /1501 variables (removed 1495) and now considering 6/1001 (removed 995) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-28 02:12:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/1501 places, 6/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 6/1501 places, 6/1001 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(OR (EQ s1 0) (EQ s0 1)), p0:(OR (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 4 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-10 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Graph (complete) has 1500 edges and 1501 vertex of which 3 are kept as prefixes of interest. Removing 1498 places using SCC suffix rule.1 ms
Discarding 1498 places :
Also discarding 998 output transitions
Drop transitions removed 998 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 5 ms. Remains 3 /1501 variables (removed 1498) and now considering 3/1001 (removed 998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:12:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-28 02:12:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:12:27] [INFO ] Invariant cache hit.
[2024-05-28 02:12:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1501 places, 3/1001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 3/1501 places, 3/1001 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLCardinality-13 finished in 158 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)))'
[2024-05-28 02:12:27] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2573297291213559819
[2024-05-28 02:12:27] [INFO ] Computing symmetric may disable matrix : 1001 transitions.
[2024-05-28 02:12:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:27] [INFO ] Computing symmetric may enable matrix : 1001 transitions.
[2024-05-28 02:12:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:27] [INFO ] Applying decomposition
[2024-05-28 02:12:27] [INFO ] Flatten gal took : 43 ms
[2024-05-28 02:12:28] [INFO ] Computing Do-Not-Accords matrix : 1001 transitions.
[2024-05-28 02:12:28] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:12:28] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2573297291213559819
Running compilation step : cd /tmp/ltsmin2573297291213559819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2292569107394075057.txt' '-o' '/tmp/graph2292569107394075057.bin' '-w' '/tmp/graph2292569107394075057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2292569107394075057.bin' '-l' '-1' '-v' '-w' '/tmp/graph2292569107394075057.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:12:28] [INFO ] Decomposing Gal with order
[2024-05-28 02:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:12:28] [INFO ] Flatten gal took : 228 ms
[2024-05-28 02:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2024-05-28 02:12:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality16794492111635469042.gal : 8 ms
[2024-05-28 02:12:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality5479436258631409162.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16794492111635469042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5479436258631409162.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0.voted_no_7+gu0...9435
Formula 0 simplified : FG!"((((((((((gu0.voted_no_1+gu0.voted_no_2)+(gu0.voted_no_3+gu0.voted_no_4))+((gu0.voted_no_5+gu0.voted_no_6)+(gu0.voted_no_7+gu0.v...9429
Compilation finished in 3381 ms.
Running link step : cd /tmp/ltsmin2573297291213559819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2573297291213559819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.27339e+150 deadlock states
Detected timeout of ITS tools.
[2024-05-28 02:33:30] [INFO ] Applying decomposition
[2024-05-28 02:33:30] [INFO ] Flatten gal took : 129 ms
[2024-05-28 02:33:30] [INFO ] Decomposing Gal with order
[2024-05-28 02:33:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:33:31] [INFO ] Flatten gal took : 100 ms
[2024-05-28 02:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2024-05-28 02:33:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality9675633084462644633.gal : 6 ms
[2024-05-28 02:33:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality1820408320286435759.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9675633084462644633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1820408320286435759.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((gu500.voted_no_1+gu499.voted_no_2)+(gu498.voted_no_3+gu497.voted_no_4))+((gu496.voted_no_5+gu495.voted_no_6)+(gu494....10329
Formula 0 simplified : FG!"((((((((((gu500.voted_no_1+gu499.voted_no_2)+(gu498.voted_no_3+gu497.voted_no_4))+((gu496.voted_no_5+gu495.voted_no_6)+(gu494.vo...10323
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.27339e+150 deadlock states
Detected timeout of ITS tools.
[2024-05-28 02:54:33] [INFO ] Flatten gal took : 105 ms
[2024-05-28 02:54:33] [INFO ] Input system was already deterministic with 1001 transitions.
[2024-05-28 02:54:33] [INFO ] Transformed 1501 places.
[2024-05-28 02:54:33] [INFO ] Transformed 1001 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 02:54:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality12098853231462994015.gal : 11 ms
[2024-05-28 02:54:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality11831971039853263989.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12098853231462994015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11831971039853263989.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+vot...7431
Formula 0 simplified : FG!"((((((((((voted_no_1+voted_no_2)+(voted_no_3+voted_no_4))+((voted_no_5+voted_no_6)+(voted_no_7+voted_no_8)))+(((voted_no_9+voted...7425
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.27339e+150 deadlock states
LTSmin run took 2786985 ms.
FORMULA Referendum-PT-0500-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2975129 ms.
BK_STOP 1716865139919
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-0500"
export BK_EXAMINATION="LTLCardinality"
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-0500, examination is LTLCardinality"
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-171662362200392"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0500.tgz
mv Referendum-PT-0500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;