Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156500453.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HirschbergSinclair-PT-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156500453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.1K May 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 1.4M May 12 08:13 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 HirschbergSinclair-PT-40-00
FORMULA_NAME HirschbergSinclair-PT-40-01
FORMULA_NAME HirschbergSinclair-PT-40-02
FORMULA_NAME HirschbergSinclair-PT-40-03
FORMULA_NAME HirschbergSinclair-PT-40-04
FORMULA_NAME HirschbergSinclair-PT-40-05
FORMULA_NAME HirschbergSinclair-PT-40-06
FORMULA_NAME HirschbergSinclair-PT-40-07
FORMULA_NAME HirschbergSinclair-PT-40-08
FORMULA_NAME HirschbergSinclair-PT-40-09
FORMULA_NAME HirschbergSinclair-PT-40-10
FORMULA_NAME HirschbergSinclair-PT-40-11
FORMULA_NAME HirschbergSinclair-PT-40-12
FORMULA_NAME HirschbergSinclair-PT-40-13
FORMULA_NAME HirschbergSinclair-PT-40-14
FORMULA_NAME HirschbergSinclair-PT-40-15

=== Now, execution of the tool begins

BK_START 1621294530150

Running Version 0
[2021-05-17 23:35:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 23:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 23:35:31] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2021-05-17 23:35:31] [INFO ] Transformed 1068 places.
[2021-05-17 23:35:31] [INFO ] Transformed 982 transitions.
[2021-05-17 23:35:31] [INFO ] Parsed PT model containing 1068 places and 982 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 23:35:31] [INFO ] Initial state test concluded for 1 properties.
Support contains 51 out of 1068 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1028 transition count 982
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 77 place count 991 transition count 945
Iterating global reduction 1 with 37 rules applied. Total rules applied 114 place count 991 transition count 945
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 149 place count 956 transition count 910
Iterating global reduction 1 with 35 rules applied. Total rules applied 184 place count 956 transition count 910
Applied a total of 184 rules in 343 ms. Remains 956 /1068 variables (removed 112) and now considering 910/982 (removed 72) transitions.
// Phase 1: matrix 910 rows 956 cols
[2021-05-17 23:35:32] [INFO ] Computed 46 place invariants in 32 ms
[2021-05-17 23:35:33] [INFO ] Implicit Places using invariants in 613 ms returned []
// Phase 1: matrix 910 rows 956 cols
[2021-05-17 23:35:33] [INFO ] Computed 46 place invariants in 13 ms
[2021-05-17 23:35:35] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2716 ms to find 0 implicit places.
// Phase 1: matrix 910 rows 956 cols
[2021-05-17 23:35:35] [INFO ] Computed 46 place invariants in 8 ms
[2021-05-17 23:35:35] [INFO ] Dead Transitions using invariants and state equation in 582 ms returned []
Finished structural reductions, in 1 iterations. Remains : 956/1068 places, 910/982 transitions.
[2021-05-17 23:35:36] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 23:35:36] [INFO ] Flatten gal took : 114 ms
FORMULA HirschbergSinclair-PT-40-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 23:35:36] [INFO ] Flatten gal took : 62 ms
[2021-05-17 23:35:36] [INFO ] Input system was already deterministic with 910 transitions.
Incomplete random walk after 100000 steps, including 102 resets, run finished after 492 ms. (steps per millisecond=203 ) properties (out of 26) seen :24
Running SMT prover for 2 properties.
// Phase 1: matrix 910 rows 956 cols
[2021-05-17 23:35:36] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-17 23:35:37] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 136 ms returned sat
[2021-05-17 23:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 23:35:37] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-17 23:35:37] [INFO ] Computed and/alt/rep : 417/425/417 causal constraints (skipped 453 transitions) in 64 ms.
[2021-05-17 23:35:37] [INFO ] Added : 13 causal constraints over 3 iterations in 328 ms. Result :sat
[2021-05-17 23:35:38] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 136 ms returned sat
[2021-05-17 23:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 23:35:38] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-17 23:35:38] [INFO ] Computed and/alt/rep : 417/425/417 causal constraints (skipped 453 transitions) in 62 ms.
[2021-05-17 23:35:38] [INFO ] Added : 13 causal constraints over 3 iterations in 302 ms. Result :sat
FORMULA HirschbergSinclair-PT-40-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(F(p0))&&(!p0||(p1 U (p2||G(p1)))))||G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 953 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 953 transition count 907
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 951 transition count 905
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 951 transition count 905
Applied a total of 10 rules in 153 ms. Remains 951 /956 variables (removed 5) and now considering 905/910 (removed 5) transitions.
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:39] [INFO ] Computed 46 place invariants in 5 ms
[2021-05-17 23:35:39] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:39] [INFO ] Computed 46 place invariants in 5 ms
[2021-05-17 23:35:42] [INFO ] Implicit Places using invariants and state equation in 2740 ms returned []
Implicit Place search using SMT with State Equation took 3172 ms to find 0 implicit places.
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:42] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:35:43] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 951/956 places, 905/910 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-00 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s910 1), p2:(AND (LT s447 1) (OR (LT s43 1) (LT s162 1))), p1:(OR (LT s43 1) (LT s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 897 ms.
Product exploration explored 100000 steps with 50000 reset in 855 ms.
Graph (complete) has 1820 edges and 951 vertex of which 911 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Knowledge obtained : [p0, p2, p1]
Adopting property with smaller alphabet thanks to knowledge :p2
Stuttering acceptance computed with spot in 47 ms :[(AND p2 (NOT p0)), (NOT p0)]
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 905/905 transitions.
Applied a total of 0 rules in 29 ms. Remains 951 /951 variables (removed 0) and now considering 905/905 (removed 0) transitions.
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:45] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:35:45] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:45] [INFO ] Computed 46 place invariants in 7 ms
[2021-05-17 23:35:48] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:48] [INFO ] Computed 46 place invariants in 19 ms
[2021-05-17 23:35:49] [INFO ] Dead Transitions using invariants and state equation in 560 ms returned []
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 905/905 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND p2 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 749 ms.
Product exploration explored 100000 steps with 50000 reset in 805 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 50 ms :[(AND p2 (NOT p0)), (NOT p0)]
Support contains 4 out of 951 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 951/951 places, 905/905 transitions.
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 951 transition count 905
Deduced a syphon composed of 399 places in 4 ms
Applied a total of 399 rules in 144 ms. Remains 951 /951 variables (removed 0) and now considering 905/905 (removed 0) transitions.
[2021-05-17 23:35:51] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 905 rows 951 cols
[2021-05-17 23:35:51] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:35:51] [INFO ] Dead Transitions using invariants and state equation in 588 ms returned []
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 905/905 transitions.
Product exploration explored 100000 steps with 50000 reset in 4134 ms.
Product exploration explored 100000 steps with 50000 reset in 4002 ms.
[2021-05-17 23:36:00] [INFO ] Flatten gal took : 65 ms
[2021-05-17 23:36:00] [INFO ] Flatten gal took : 60 ms
[2021-05-17 23:36:00] [INFO ] Time to serialize gal into /tmp/LTL1967848381377726969.gal : 14 ms
[2021-05-17 23:36:00] [INFO ] Time to serialize properties into /tmp/LTL11993662212595390732.ltl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1967848381377726969.gal, -t, CGAL, -LTL, /tmp/LTL11993662212595390732.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1967848381377726969.gal -t CGAL -LTL /tmp/LTL11993662212595390732.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(rcv_left_election_40_6_40_40<1)")))||((X(F("(rcv_left_election_40_6_40_40<1)")))&&(("(rcv_left_election_40_6_40_40>=1)")||(("((newmsg22<1)||(election_21_0_1_to_right_21<1))")U(("((rcv_left_election_40_4_10_10<1)&&((newmsg22<1)||(election_21_0_1_to_right_21<1)))")||(G("((newmsg22<1)||(election_21_0_1_to_right_21<1))")))))))))
Formula 0 simplified : !F(GF"(rcv_left_election_40_6_40_40<1)" | (XF"(rcv_left_election_40_6_40_40<1)" & ("(rcv_left_election_40_6_40_40>=1)" | ("((newmsg22<1)||(election_21_0_1_to_right_21<1))" U ("((rcv_left_election_40_4_10_10<1)&&((newmsg22<1)||(election_21_0_1_to_right_21<1)))" | G"((newmsg22<1)||(election_21_0_1_to_right_21<1))")))))
Detected timeout of ITS tools.
[2021-05-17 23:36:15] [INFO ] Flatten gal took : 38 ms
[2021-05-17 23:36:15] [INFO ] Applying decomposition
[2021-05-17 23:36:15] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12661395982562285049.txt, -o, /tmp/graph12661395982562285049.bin, -w, /tmp/graph12661395982562285049.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12661395982562285049.bin, -l, -1, -v, -w, /tmp/graph12661395982562285049.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:36:15] [INFO ] Decomposing Gal with order
[2021-05-17 23:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:36:15] [INFO ] Removed a total of 94 redundant transitions.
[2021-05-17 23:36:15] [INFO ] Flatten gal took : 123 ms
[2021-05-17 23:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-17 23:36:15] [INFO ] Time to serialize gal into /tmp/LTL1476530632457191911.gal : 17 ms
[2021-05-17 23:36:15] [INFO ] Time to serialize properties into /tmp/LTL4178256555073005346.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1476530632457191911.gal, -t, CGAL, -LTL, /tmp/LTL4178256555073005346.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1476530632457191911.gal -t CGAL -LTL /tmp/LTL4178256555073005346.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i8.u33.rcv_left_election_40_6_40_40<1)")))||((X(F("(i8.u33.rcv_left_election_40_6_40_40<1)")))&&(("(i8.u33.rcv_left_election_40_6_40_40>=1)")||(("((i10.u16.newmsg22<1)||(i10.u16.election_21_0_1_to_right_21<1))")U(("((i2.i0.u38.rcv_left_election_40_4_10_10<1)&&((i10.u16.newmsg22<1)||(i10.u16.election_21_0_1_to_right_21<1)))")||(G("((i10.u16.newmsg22<1)||(i10.u16.election_21_0_1_to_right_21<1))")))))))))
Formula 0 simplified : !F(GF"(i8.u33.rcv_left_election_40_6_40_40<1)" | (XF"(i8.u33.rcv_left_election_40_6_40_40<1)" & ("(i8.u33.rcv_left_election_40_6_40_40>=1)" | ("((i10.u16.newmsg22<1)||(i10.u16.election_21_0_1_to_right_21<1))" U ("((i2.i0.u38.rcv_left_election_40_4_10_10<1)&&((i10.u16.newmsg22<1)||(i10.u16.election_21_0_1_to_right_21<1)))" | G"((i10.u16.newmsg22<1)||(i10.u16.election_21_0_1_to_right_21<1))")))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17761730729374268598
[2021-05-17 23:36:30] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17761730729374268598
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17761730729374268598]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17761730729374268598] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17761730729374268598] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-40-00 finished in 52711 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p1)||(p2&&X(F((G(p1)||p3))))||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 951 transition count 905
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 948 transition count 902
Applied a total of 16 rules in 108 ms. Remains 948 /956 variables (removed 8) and now considering 902/910 (removed 8) transitions.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:36:31] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:36:32] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:36:32] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:36:34] [INFO ] Implicit Places using invariants and state equation in 2616 ms returned []
Implicit Place search using SMT with State Equation took 3049 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:36:34] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:36:35] [INFO ] Dead Transitions using invariants and state equation in 544 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/956 places, 902/910 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-40-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s23 1) (LT s852 1)), p2:(OR (LT s21 1) (LT s641 1)), p1:(OR (LT s23 1) (LT s852 1)), p3:(OR (LT s47 1) (LT s392 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 114 reset in 358 ms.
Product exploration explored 100000 steps with 112 reset in 372 ms.
Graph (complete) has 1815 edges and 948 vertex of which 908 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, p2, p1, p3]
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 114 reset in 341 ms.
Product exploration explored 100000 steps with 114 reset in 390 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Support contains 6 out of 948 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 948/948 places, 902/902 transitions.
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 377 rules applied. Total rules applied 377 place count 948 transition count 902
Deduced a syphon composed of 377 places in 4 ms
Applied a total of 377 rules in 62 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2021-05-17 23:36:37] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:36:37] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:36:38] [INFO ] Dead Transitions using invariants and state equation in 523 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Product exploration explored 100000 steps with 113 reset in 363 ms.
Product exploration explored 100000 steps with 113 reset in 383 ms.
[2021-05-17 23:36:39] [INFO ] Flatten gal took : 50 ms
[2021-05-17 23:36:39] [INFO ] Flatten gal took : 29 ms
[2021-05-17 23:36:39] [INFO ] Time to serialize gal into /tmp/LTL1737790050642061574.gal : 5 ms
[2021-05-17 23:36:39] [INFO ] Time to serialize properties into /tmp/LTL1110195614319286118.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1737790050642061574.gal, -t, CGAL, -LTL, /tmp/LTL1110195614319286118.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1737790050642061574.gal -t CGAL -LTL /tmp/LTL1110195614319286118.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("((newmsg12<1)||(election_40_6_12_to_right_11<1))")||(X("((newmsg12<1)||(election_40_6_12_to_right_11<1))")))||((X(F(("((newmsg24<1)||(election_40_4_16_to_left_25<1))")||(G("((newmsg12<1)||(election_40_6_12_to_right_11<1))")))))&&("((newmsg11<1)||(election_40_5_11_to_right_10<1))")))))
Formula 0 simplified : !G("((newmsg12<1)||(election_40_6_12_to_right_11<1))" | X"((newmsg12<1)||(election_40_6_12_to_right_11<1))" | ("((newmsg11<1)||(election_40_5_11_to_right_10<1))" & XF("((newmsg24<1)||(election_40_4_16_to_left_25<1))" | G"((newmsg12<1)||(election_40_6_12_to_right_11<1))")))
Detected timeout of ITS tools.
[2021-05-17 23:36:54] [INFO ] Flatten gal took : 29 ms
[2021-05-17 23:36:54] [INFO ] Applying decomposition
[2021-05-17 23:36:54] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12345656117982438702.txt, -o, /tmp/graph12345656117982438702.bin, -w, /tmp/graph12345656117982438702.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12345656117982438702.bin, -l, -1, -v, -w, /tmp/graph12345656117982438702.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:36:54] [INFO ] Decomposing Gal with order
[2021-05-17 23:36:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:36:54] [INFO ] Removed a total of 96 redundant transitions.
[2021-05-17 23:36:54] [INFO ] Flatten gal took : 57 ms
[2021-05-17 23:36:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 23:36:54] [INFO ] Time to serialize gal into /tmp/LTL12954883429964074128.gal : 196 ms
[2021-05-17 23:36:54] [INFO ] Time to serialize properties into /tmp/LTL4169599612944339361.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12954883429964074128.gal, -t, CGAL, -LTL, /tmp/LTL4169599612944339361.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12954883429964074128.gal -t CGAL -LTL /tmp/LTL4169599612944339361.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((("((i3.u11.newmsg12<1)||(i3.u10.election_40_6_12_to_right_11<1))")||(X("((i3.u11.newmsg12<1)||(i3.u10.election_40_6_12_to_right_11<1))")))||((X(F(("((i11.i0.u19.newmsg24<1)||(i11.i0.u19.election_40_4_16_to_left_25<1))")||(G("((i3.u11.newmsg12<1)||(i3.u10.election_40_6_12_to_right_11<1))")))))&&("((i3.u10.newmsg11<1)||(i2.i1.u9.election_40_5_11_to_right_10<1))")))))
Formula 0 simplified : !G("((i3.u11.newmsg12<1)||(i3.u10.election_40_6_12_to_right_11<1))" | X"((i3.u11.newmsg12<1)||(i3.u10.election_40_6_12_to_right_11<1))" | ("((i3.u10.newmsg11<1)||(i2.i1.u9.election_40_5_11_to_right_10<1))" & XF("((i11.i0.u19.newmsg24<1)||(i11.i0.u19.election_40_4_16_to_left_25<1))" | G"((i3.u11.newmsg12<1)||(i3.u10.election_40_6_12_to_right_11<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11430317748680941834
[2021-05-17 23:37:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11430317748680941834
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11430317748680941834]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11430317748680941834] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11430317748680941834] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-40-01 finished in 38936 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0) U (p1&&G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 951 transition count 905
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 948 transition count 902
Applied a total of 16 rules in 127 ms. Remains 948 /956 variables (removed 8) and now considering 902/910 (removed 8) transitions.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:10] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:37:11] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:11] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:37:13] [INFO ] Implicit Places using invariants and state equation in 2695 ms returned []
Implicit Place search using SMT with State Equation took 3099 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:13] [INFO ] Computed 46 place invariants in 10 ms
[2021-05-17 23:37:14] [INFO ] Dead Transitions using invariants and state equation in 564 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/956 places, 902/910 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-40-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s71 1) (LT s498 1)), p0:(OR (LT s21 1) (LT s560 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 150 reset in 458 ms.
Product exploration explored 100000 steps with 154 reset in 544 ms.
Graph (complete) has 1815 edges and 948 vertex of which 908 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.11 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 151 reset in 405 ms.
Product exploration explored 100000 steps with 157 reset in 426 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Support contains 4 out of 948 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 948/948 places, 902/902 transitions.
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 948 transition count 902
Deduced a syphon composed of 385 places in 4 ms
Applied a total of 385 rules in 57 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2021-05-17 23:37:17] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:17] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:37:17] [INFO ] Dead Transitions using invariants and state equation in 523 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Product exploration explored 100000 steps with 162 reset in 467 ms.
Product exploration explored 100000 steps with 162 reset in 443 ms.
[2021-05-17 23:37:18] [INFO ] Flatten gal took : 28 ms
[2021-05-17 23:37:18] [INFO ] Flatten gal took : 31 ms
[2021-05-17 23:37:18] [INFO ] Time to serialize gal into /tmp/LTL16120279399086359827.gal : 4 ms
[2021-05-17 23:37:18] [INFO ] Time to serialize properties into /tmp/LTL1245287977468315208.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16120279399086359827.gal, -t, CGAL, -LTL, /tmp/LTL1245287977468315208.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16120279399086359827.gal -t CGAL -LTL /tmp/LTL1245287977468315208.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X("((newmsg11<1)||(reply_40_5_to_right_10<1))"))U((G(F("((newmsg11<1)||(reply_40_5_to_right_10<1))")))&&("((newmsg36<1)||(election_40_5_4_to_left_37<1))")))))
Formula 0 simplified : !G(X"((newmsg11<1)||(reply_40_5_to_right_10<1))" U ("((newmsg36<1)||(election_40_5_4_to_left_37<1))" & GF"((newmsg11<1)||(reply_40_5_to_right_10<1))"))
Detected timeout of ITS tools.
[2021-05-17 23:37:33] [INFO ] Flatten gal took : 38 ms
[2021-05-17 23:37:33] [INFO ] Applying decomposition
[2021-05-17 23:37:33] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15023098812894006917.txt, -o, /tmp/graph15023098812894006917.bin, -w, /tmp/graph15023098812894006917.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15023098812894006917.bin, -l, -1, -v, -w, /tmp/graph15023098812894006917.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:37:33] [INFO ] Decomposing Gal with order
[2021-05-17 23:37:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:37:33] [INFO ] Removed a total of 99 redundant transitions.
[2021-05-17 23:37:33] [INFO ] Flatten gal took : 56 ms
[2021-05-17 23:37:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-17 23:37:33] [INFO ] Time to serialize gal into /tmp/LTL3668781783833553510.gal : 6 ms
[2021-05-17 23:37:33] [INFO ] Time to serialize properties into /tmp/LTL12262326650143569815.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3668781783833553510.gal, -t, CGAL, -LTL, /tmp/LTL12262326650143569815.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3668781783833553510.gal -t CGAL -LTL /tmp/LTL12262326650143569815.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X("((i3.u40.newmsg11<1)||(i3.u69.reply_40_5_to_right_10<1))"))U((G(F("((i3.u40.newmsg11<1)||(i3.u69.reply_40_5_to_right_10<1))")))&&("((i9.i0.u33.newmsg36<1)||(i9.i0.u66.election_40_5_4_to_left_37<1))")))))
Formula 0 simplified : !G(X"((i3.u40.newmsg11<1)||(i3.u69.reply_40_5_to_right_10<1))" U ("((i9.i0.u33.newmsg36<1)||(i9.i0.u66.election_40_5_4_to_left_37<1))" & GF"((i3.u40.newmsg11<1)||(i3.u69.reply_40_5_to_right_10<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5375612676799175134
[2021-05-17 23:37:48] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5375612676799175134
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5375612676799175134]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5375612676799175134] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5375612676799175134] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-40-03 finished in 39320 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 951 transition count 905
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 948 transition count 902
Applied a total of 16 rules in 127 ms. Remains 948 /956 variables (removed 8) and now considering 902/910 (removed 8) transitions.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:50] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:37:50] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:50] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:37:53] [INFO ] Implicit Places using invariants and state equation in 2710 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:37:53] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:37:53] [INFO ] Dead Transitions using invariants and state equation in 528 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/956 places, 902/910 transitions.
Stuttering acceptance computed with spot in 5677 ms :[(AND (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-40-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (LT s724 1) (LT s263 1)), p1:(LT s263 1), p0:(GEQ s724 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 136 reset in 354 ms.
Product exploration explored 100000 steps with 136 reset in 379 ms.
Graph (complete) has 1815 edges and 948 vertex of which 908 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 136 reset in 337 ms.
Product exploration explored 100000 steps with 136 reset in 410 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 2 out of 948 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 948/948 places, 902/902 transitions.
Performed 406 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 948 transition count 902
Deduced a syphon composed of 406 places in 4 ms
Applied a total of 406 rules in 52 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2021-05-17 23:38:01] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:38:01] [INFO ] Computed 46 place invariants in 15 ms
[2021-05-17 23:38:02] [INFO ] Dead Transitions using invariants and state equation in 583 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/948 places, 902/902 transitions.
Product exploration explored 100000 steps with 255 reset in 331 ms.
Product exploration explored 100000 steps with 256 reset in 378 ms.
[2021-05-17 23:38:02] [INFO ] Flatten gal took : 24 ms
[2021-05-17 23:38:02] [INFO ] Flatten gal took : 24 ms
[2021-05-17 23:38:02] [INFO ] Time to serialize gal into /tmp/LTL4671578208988666718.gal : 3 ms
[2021-05-17 23:38:02] [INFO ] Time to serialize properties into /tmp/LTL12453582793885009755.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4671578208988666718.gal, -t, CGAL, -LTL, /tmp/LTL12453582793885009755.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4671578208988666718.gal -t CGAL -LTL /tmp/LTL12453582793885009755.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(rcv_right_reply_40_5_12>=1)"))&&(("(rcv_right_election_40_2_1_39<1)")U(("((rcv_right_reply_40_5_12<1)&&(rcv_right_election_40_2_1_39<1))")||(G("(rcv_right_election_40_2_1_39<1)")))))))
Formula 0 simplified : !X(F"(rcv_right_reply_40_5_12>=1)" & ("(rcv_right_election_40_2_1_39<1)" U ("((rcv_right_reply_40_5_12<1)&&(rcv_right_election_40_2_1_39<1))" | G"(rcv_right_election_40_2_1_39<1)")))
Detected timeout of ITS tools.
[2021-05-17 23:38:17] [INFO ] Flatten gal took : 25 ms
[2021-05-17 23:38:17] [INFO ] Applying decomposition
[2021-05-17 23:38:17] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7005781791460190554.txt, -o, /tmp/graph7005781791460190554.bin, -w, /tmp/graph7005781791460190554.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7005781791460190554.bin, -l, -1, -v, -w, /tmp/graph7005781791460190554.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:38:18] [INFO ] Decomposing Gal with order
[2021-05-17 23:38:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:38:18] [INFO ] Removed a total of 59 redundant transitions.
[2021-05-17 23:38:18] [INFO ] Flatten gal took : 49 ms
[2021-05-17 23:38:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-17 23:38:18] [INFO ] Time to serialize gal into /tmp/LTL9069214689568746482.gal : 6 ms
[2021-05-17 23:38:18] [INFO ] Time to serialize properties into /tmp/LTL14135214068776616073.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9069214689568746482.gal, -t, CGAL, -LTL, /tmp/LTL14135214068776616073.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9069214689568746482.gal -t CGAL -LTL /tmp/LTL14135214068776616073.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i2.u9.rcv_right_reply_40_5_12>=1)"))&&(("(i11.u34.rcv_right_election_40_2_1_39<1)")U(("((i2.u9.rcv_right_reply_40_5_12<1)&&(i11.u34.rcv_right_election_40_2_1_39<1))")||(G("(i11.u34.rcv_right_election_40_2_1_39<1)")))))))
Formula 0 simplified : !X(F"(i2.u9.rcv_right_reply_40_5_12>=1)" & ("(i11.u34.rcv_right_election_40_2_1_39<1)" U ("((i2.u9.rcv_right_reply_40_5_12<1)&&(i11.u34.rcv_right_election_40_2_1_39<1))" | G"(i11.u34.rcv_right_election_40_2_1_39<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4073156231028755382
[2021-05-17 23:38:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4073156231028755382
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4073156231028755382]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4073156231028755382] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4073156231028755382] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-40-04 finished in 44134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((p0 U (p1||G(p0)))))&&F(((X(F(p2))&&G(p3))||G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 953 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 953 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 952 transition count 906
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 952 transition count 906
Applied a total of 8 rules in 78 ms. Remains 952 /956 variables (removed 4) and now considering 906/910 (removed 4) transitions.
// Phase 1: matrix 906 rows 952 cols
[2021-05-17 23:38:34] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:38:34] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 906 rows 952 cols
[2021-05-17 23:38:34] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:38:37] [INFO ] Implicit Places using invariants and state equation in 2804 ms returned []
Implicit Place search using SMT with State Equation took 3207 ms to find 0 implicit places.
// Phase 1: matrix 906 rows 952 cols
[2021-05-17 23:38:37] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:38:43] [INFO ] Dead Transitions using invariants and state equation in 6098 ms returned []
Finished structural reductions, in 1 iterations. Remains : 952/956 places, 906/910 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-05 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LT s131 1), p2:(LT s209 1), p1:(AND (GEQ s29 1) (GEQ s936 1) (LT s899 1)), p0:(LT s899 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 359 ms.
Product exploration explored 100000 steps with 186 reset in 397 ms.
Graph (complete) has 1821 edges and 952 vertex of which 912 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Knowledge obtained : [p3, p2, (NOT p1), p0]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 209 reset in 374 ms.
Product exploration explored 100000 steps with 192 reset in 401 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 952/952 places, 906/906 transitions.
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 952 transition count 906
Deduced a syphon composed of 397 places in 4 ms
Applied a total of 397 rules in 48 ms. Remains 952 /952 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2021-05-17 23:38:45] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 906 rows 952 cols
[2021-05-17 23:38:45] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:38:46] [INFO ] Dead Transitions using invariants and state equation in 557 ms returned []
Finished structural reductions, in 1 iterations. Remains : 952/952 places, 906/906 transitions.
Product exploration explored 100000 steps with 264 reset in 364 ms.
Product exploration explored 100000 steps with 285 reset in 410 ms.
[2021-05-17 23:38:47] [INFO ] Flatten gal took : 32 ms
[2021-05-17 23:38:47] [INFO ] Flatten gal took : 37 ms
[2021-05-17 23:38:47] [INFO ] Time to serialize gal into /tmp/LTL7544353311634046089.gal : 22 ms
[2021-05-17 23:38:47] [INFO ] Time to serialize properties into /tmp/LTL18437100143897032569.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7544353311634046089.gal, -t, CGAL, -LTL, /tmp/LTL18437100143897032569.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7544353311634046089.gal -t CGAL -LTL /tmp/LTL18437100143897032569.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F(("(rcv_left_election_40_6_33_33<1)")U(("(((newmsg15>=1)&&(elected_40_to_left_16>=1))&&(rcv_left_election_40_6_33_33<1))")||(G("(rcv_left_election_40_6_33_33<1)"))))))&&(F(((X(F("(rcv_left_election_32_0_1_33<1)")))&&(G("(rcv_left_reply_13_0_13<1)")))||(G(F("(rcv_left_election_32_0_1_33<1)")))))))
Formula 0 simplified : !(XF("(rcv_left_election_40_6_33_33<1)" U ("(((newmsg15>=1)&&(elected_40_to_left_16>=1))&&(rcv_left_election_40_6_33_33<1))" | G"(rcv_left_election_40_6_33_33<1)")) & F((XF"(rcv_left_election_32_0_1_33<1)" & G"(rcv_left_reply_13_0_13<1)") | GF"(rcv_left_election_32_0_1_33<1)"))
Detected timeout of ITS tools.
[2021-05-17 23:39:02] [INFO ] Flatten gal took : 36 ms
[2021-05-17 23:39:02] [INFO ] Applying decomposition
[2021-05-17 23:39:02] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13451154228351187552.txt, -o, /tmp/graph13451154228351187552.bin, -w, /tmp/graph13451154228351187552.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13451154228351187552.bin, -l, -1, -v, -w, /tmp/graph13451154228351187552.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:39:02] [INFO ] Decomposing Gal with order
[2021-05-17 23:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:39:02] [INFO ] Removed a total of 87 redundant transitions.
[2021-05-17 23:39:02] [INFO ] Flatten gal took : 83 ms
[2021-05-17 23:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 23:39:02] [INFO ] Time to serialize gal into /tmp/LTL10876642175149673593.gal : 21 ms
[2021-05-17 23:39:02] [INFO ] Time to serialize properties into /tmp/LTL4843950272919812346.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10876642175149673593.gal, -t, CGAL, -LTL, /tmp/LTL4843950272919812346.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10876642175149673593.gal -t CGAL -LTL /tmp/LTL4843950272919812346.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(F(("(i9.i1.u85.rcv_left_election_40_6_33_33<1)")U(("(((i4.u13.newmsg15>=1)&&(i4.u96.elected_40_to_left_16>=1))&&(i9.i1.u85.rcv_left_election_40_6_33_33<1))")||(G("(i9.i1.u85.rcv_left_election_40_6_33_33<1)"))))))&&(F(((X(F("(i9.i1.u29.rcv_left_election_32_0_1_33<1)")))&&(G("(i3.u37.rcv_left_reply_13_0_13<1)")))||(G(F("(i9.i1.u29.rcv_left_election_32_0_1_33<1)")))))))
Formula 0 simplified : !(XF("(i9.i1.u85.rcv_left_election_40_6_33_33<1)" U ("(((i4.u13.newmsg15>=1)&&(i4.u96.elected_40_to_left_16>=1))&&(i9.i1.u85.rcv_left_election_40_6_33_33<1))" | G"(i9.i1.u85.rcv_left_election_40_6_33_33<1)")) & F((XF"(i9.i1.u29.rcv_left_election_32_0_1_33<1)" & G"(i3.u37.rcv_left_reply_13_0_13<1)") | GF"(i9.i1.u29.rcv_left_election_32_0_1_33<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10462549874880462392
[2021-05-17 23:39:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10462549874880462392
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10462549874880462392]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10462549874880462392] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10462549874880462392] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-40-05 finished in 44676 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 952 transition count 906
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 952 transition count 906
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 949 transition count 903
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 949 transition count 903
Applied a total of 14 rules in 87 ms. Remains 949 /956 variables (removed 7) and now considering 903/910 (removed 7) transitions.
// Phase 1: matrix 903 rows 949 cols
[2021-05-17 23:39:18] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-17 23:39:19] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 903 rows 949 cols
[2021-05-17 23:39:19] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:39:22] [INFO ] Implicit Places using invariants and state equation in 3268 ms returned []
Implicit Place search using SMT with State Equation took 3997 ms to find 0 implicit places.
// Phase 1: matrix 903 rows 949 cols
[2021-05-17 23:39:22] [INFO ] Computed 46 place invariants in 5 ms
[2021-05-17 23:39:23] [INFO ] Dead Transitions using invariants and state equation in 610 ms returned []
Finished structural reductions, in 1 iterations. Remains : 949/956 places, 903/910 transitions.
Stuttering acceptance computed with spot in 9663 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s253 1) (GEQ s262 1) (GEQ s5 1) (GEQ s86 1) (OR (LT s17 1) (LT s811 1))), p0:(AND (GEQ s253 1) (GEQ s262 1) (GEQ s5 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-40-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-06 finished in 14396 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(X(X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 951 transition count 905
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 948 transition count 902
Applied a total of 16 rules in 77 ms. Remains 948 /956 variables (removed 8) and now considering 902/910 (removed 8) transitions.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:39:33] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:39:33] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:39:33] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:39:36] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 3103 ms to find 0 implicit places.
// Phase 1: matrix 902 rows 948 cols
[2021-05-17 23:39:36] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-17 23:39:36] [INFO ] Dead Transitions using invariants and state equation in 522 ms returned []
Finished structural reductions, in 1 iterations. Remains : 948/956 places, 902/910 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s927 1)), p1:(AND (GEQ s33 1) (GEQ s572 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-07 finished in 3947 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U G(p1)) U p2))], workingDir=/home/mcc/execution]
Support contains 5 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 381 transitions
Trivial Post-agglo rules discarded 381 transitions
Performed 381 trivial Post agglomeration. Transition count delta: 381
Iterating post reduction 0 with 381 rules applied. Total rules applied 381 place count 955 transition count 528
Reduce places removed 381 places and 0 transitions.
Iterating post reduction 1 with 381 rules applied. Total rules applied 762 place count 574 transition count 528
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 767 place count 569 transition count 523
Iterating global reduction 2 with 5 rules applied. Total rules applied 772 place count 569 transition count 523
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 774 place count 569 transition count 521
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 776 place count 567 transition count 521
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 777 place count 566 transition count 520
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 778 place count 565 transition count 519
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 779 place count 564 transition count 518
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 780 place count 563 transition count 517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 781 place count 562 transition count 516
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 782 place count 561 transition count 515
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 783 place count 560 transition count 514
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 784 place count 559 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 785 place count 558 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 786 place count 557 transition count 511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 787 place count 556 transition count 510
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 788 place count 555 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 789 place count 554 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 790 place count 553 transition count 507
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 791 place count 552 transition count 506
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 792 place count 551 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 793 place count 550 transition count 504
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 794 place count 549 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 795 place count 548 transition count 502
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 796 place count 547 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 797 place count 546 transition count 500
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 798 place count 545 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 799 place count 544 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 800 place count 543 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 801 place count 542 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 541 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 803 place count 540 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 804 place count 539 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 805 place count 538 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 806 place count 537 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 807 place count 536 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 808 place count 535 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 809 place count 534 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 810 place count 533 transition count 487
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 811 place count 532 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 812 place count 531 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 813 place count 530 transition count 484
Applied a total of 813 rules in 979 ms. Remains 530 /956 variables (removed 426) and now considering 484/910 (removed 426) transitions.
// Phase 1: matrix 484 rows 530 cols
[2021-05-17 23:39:38] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:39:38] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 484 rows 530 cols
[2021-05-17 23:39:38] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:39:40] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2021-05-17 23:39:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 484 rows 530 cols
[2021-05-17 23:39:40] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:39:40] [INFO ] Dead Transitions using invariants and state equation in 293 ms returned []
Finished structural reductions, in 1 iterations. Remains : 530/956 places, 484/910 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut1406706471124409693.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10416 ms :[false, (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-10 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s401 1)), p1:(GEQ s91 1), p0:(AND (GEQ s38 1) (GEQ s486 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 517 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-40-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-10 finished in 13938 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 955 transition count 508
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 554 transition count 508
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 807 place count 549 transition count 503
Iterating global reduction 2 with 5 rules applied. Total rules applied 812 place count 549 transition count 503
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 814 place count 549 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 816 place count 547 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 817 place count 546 transition count 500
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 818 place count 545 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 819 place count 544 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 820 place count 543 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 821 place count 542 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 822 place count 541 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 823 place count 540 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 824 place count 539 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 825 place count 538 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 826 place count 537 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 827 place count 536 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 828 place count 535 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 829 place count 534 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 830 place count 533 transition count 487
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 831 place count 532 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 832 place count 531 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 833 place count 530 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 529 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 835 place count 528 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 527 transition count 481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 526 transition count 480
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 838 place count 525 transition count 479
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 839 place count 524 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 840 place count 523 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 841 place count 522 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 842 place count 521 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 843 place count 520 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 519 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 845 place count 518 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 846 place count 517 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 847 place count 516 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 848 place count 515 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 849 place count 514 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 850 place count 513 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 851 place count 512 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 852 place count 511 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 853 place count 510 transition count 464
Applied a total of 853 rules in 547 ms. Remains 510 /956 variables (removed 446) and now considering 464/910 (removed 446) transitions.
// Phase 1: matrix 464 rows 510 cols
[2021-05-17 23:39:51] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-17 23:39:52] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 464 rows 510 cols
[2021-05-17 23:39:52] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:39:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-17 23:39:53] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
[2021-05-17 23:39:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 464 rows 510 cols
[2021-05-17 23:39:53] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:39:54] [INFO ] Dead Transitions using invariants and state equation in 354 ms returned []
Finished structural reductions, in 1 iterations. Remains : 510/956 places, 464/910 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s79 1))], 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 1457 reset in 685 ms.
Product exploration explored 100000 steps with 1468 reset in 756 ms.
Graph (complete) has 1302 edges and 510 vertex of which 470 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1479 reset in 697 ms.
Product exploration explored 100000 steps with 1478 reset in 762 ms.
[2021-05-17 23:39:57] [INFO ] Flatten gal took : 18 ms
[2021-05-17 23:39:57] [INFO ] Flatten gal took : 13 ms
[2021-05-17 23:39:57] [INFO ] Time to serialize gal into /tmp/LTL13752448555066531013.gal : 2 ms
[2021-05-17 23:39:57] [INFO ] Time to serialize properties into /tmp/LTL13558711920096040715.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13752448555066531013.gal, -t, CGAL, -LTL, /tmp/LTL13558711920096040715.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13752448555066531013.gal -t CGAL -LTL /tmp/LTL13558711920096040715.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((newmsg18>=1)&&(election_19_0_1_to_left_19>=1))")))
Formula 0 simplified : !F"((newmsg18>=1)&&(election_19_0_1_to_left_19>=1))"
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t42.t43, t46.t47, t51.t52, t55.t56, t59.t60, t63.t64, t67.t68, t71.t72, t75.t76, t79.t80, t83.t84, t87.t88, t93.t94, t97.t98, t101.t102, t105.t106, t110, t111.t112, t113.t114, t116, t117.t118, t121.t122, t125.t126, t130.t131, t134.t135, t138.t139, t142.t143, t146.t147, t150.t151, t154.t155, t158.t159, t162.t163, t166.t167, t170.t171, t176.t177, t180.t181, t184.t185, t188.t189, t192.t193, t196.t197, t786.t787, t866.t867, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/420/44/464
Detected timeout of ITS tools.
[2021-05-17 23:40:12] [INFO ] Flatten gal took : 31 ms
[2021-05-17 23:40:12] [INFO ] Applying decomposition
[2021-05-17 23:40:12] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9654236888912287518.txt, -o, /tmp/graph9654236888912287518.bin, -w, /tmp/graph9654236888912287518.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9654236888912287518.bin, -l, -1, -v, -w, /tmp/graph9654236888912287518.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:40:12] [INFO ] Decomposing Gal with order
[2021-05-17 23:40:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:40:12] [INFO ] Removed a total of 319 redundant transitions.
[2021-05-17 23:40:12] [INFO ] Flatten gal took : 24 ms
[2021-05-17 23:40:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2021-05-17 23:40:12] [INFO ] Time to serialize gal into /tmp/LTL3995134077631634801.gal : 4 ms
[2021-05-17 23:40:12] [INFO ] Time to serialize properties into /tmp/LTL7008748742581190210.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3995134077631634801.gal, -t, CGAL, -LTL, /tmp/LTL7008748742581190210.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3995134077631634801.gal -t CGAL -LTL /tmp/LTL7008748742581190210.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((i0.i0.u0.newmsg18>=1)&&(i0.i0.u0.election_19_0_1_to_left_19>=1))")))
Formula 0 simplified : !F"((i0.i0.u0.newmsg18>=1)&&(i0.i0.u0.election_19_0_1_to_left_19>=1))"
Reverse transition relation is NOT exact ! Due to transitions t18, t46_t47, t87_t88, t113_t114, t134_t135, t162_t163, t188_t189, t305_t306, t786_t787, i0.t529_t530, i0.i0.t17, i0.i0.t101_t102, i0.i0.t105_t106, i0.i0.u0.t110, i0.i0.u0.t116, i0.i0.u18.t111.t112, i0.i1.t93_t94, i2.t866_t867, i2.t196_t197, i2.t192_t193, i3.t42_t43, i4.t63_t64, i4.t59_t60, i4.t55_t56, i4.t51_t52, i5.t158_t159, i5.t154_t155, i5.t150_t151, i5.t146_t147, i5.t142_t143, i5.t138_t139, i6.t75_t76, i6.i0.t79_t80, i6.i0.t83_t84, i6.i1.t71_t72, i7.t184_t185, i7.t180_t181, i7.t176_t177, i7.t170_t171, i7.t166_t167, i8.t130_t131, i8.t125_t126, i8.t121_t122, i8.t117_t118, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/410/44/454
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8844784486525891828
[2021-05-17 23:40:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8844784486525891828
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8844784486525891828]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8844784486525891828] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8844784486525891828] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HirschbergSinclair-PT-40-12 finished in 37337 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 955 transition count 501
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 547 transition count 501
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 821 place count 542 transition count 496
Iterating global reduction 2 with 5 rules applied. Total rules applied 826 place count 542 transition count 496
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 828 place count 542 transition count 494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 830 place count 540 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 831 place count 539 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 832 place count 538 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 833 place count 537 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 536 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 835 place count 535 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 534 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 533 transition count 487
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 838 place count 532 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 839 place count 531 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 840 place count 530 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 841 place count 529 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 842 place count 528 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 843 place count 527 transition count 481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 526 transition count 480
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 845 place count 525 transition count 479
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 846 place count 524 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 847 place count 523 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 848 place count 522 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 849 place count 521 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 850 place count 520 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 851 place count 519 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 852 place count 518 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 853 place count 517 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 854 place count 516 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 855 place count 515 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 856 place count 514 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 857 place count 513 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 858 place count 512 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 859 place count 511 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 860 place count 510 transition count 464
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 861 place count 509 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 862 place count 508 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 863 place count 507 transition count 461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 864 place count 506 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 865 place count 505 transition count 459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 866 place count 504 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 867 place count 503 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 868 place count 502 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 869 place count 501 transition count 455
Applied a total of 869 rules in 507 ms. Remains 501 /956 variables (removed 455) and now considering 455/910 (removed 455) transitions.
// Phase 1: matrix 455 rows 501 cols
[2021-05-17 23:40:28] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:40:29] [INFO ] Implicit Places using invariants in 387 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2021-05-17 23:40:29] [INFO ] Computed 46 place invariants in 8 ms
[2021-05-17 23:40:30] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
[2021-05-17 23:40:31] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2021-05-17 23:40:31] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-17 23:40:31] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Finished structural reductions, in 1 iterations. Remains : 501/956 places, 455/910 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s83 1)], 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][true, true]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-13 finished in 2866 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 956 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 956/956 places, 910/910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 955 transition count 501
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 547 transition count 501
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 821 place count 542 transition count 496
Iterating global reduction 2 with 5 rules applied. Total rules applied 826 place count 542 transition count 496
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 828 place count 542 transition count 494
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 830 place count 540 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 831 place count 539 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 832 place count 538 transition count 492
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 833 place count 537 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 536 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 835 place count 535 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 534 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 533 transition count 487
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 838 place count 532 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 839 place count 531 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 840 place count 530 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 841 place count 529 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 842 place count 528 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 843 place count 527 transition count 481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 526 transition count 480
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 845 place count 525 transition count 479
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 846 place count 524 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 847 place count 523 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 848 place count 522 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 849 place count 521 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 850 place count 520 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 851 place count 519 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 852 place count 518 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 853 place count 517 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 854 place count 516 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 855 place count 515 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 856 place count 514 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 857 place count 513 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 858 place count 512 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 859 place count 511 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 860 place count 510 transition count 464
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 861 place count 509 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 862 place count 508 transition count 462
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 863 place count 507 transition count 461
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 864 place count 506 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 865 place count 505 transition count 459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 866 place count 504 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 867 place count 503 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 868 place count 502 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 869 place count 501 transition count 455
Applied a total of 869 rules in 478 ms. Remains 501 /956 variables (removed 455) and now considering 455/910 (removed 455) transitions.
// Phase 1: matrix 455 rows 501 cols
[2021-05-17 23:40:31] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-17 23:40:32] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2021-05-17 23:40:32] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-17 23:40:33] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2021-05-17 23:40:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 455 rows 501 cols
[2021-05-17 23:40:33] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-17 23:40:34] [INFO ] Dead Transitions using invariants and state equation in 361 ms returned []
Finished structural reductions, in 1 iterations. Remains : 501/956 places, 455/910 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, (G p0 | G!p0)], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10110 ms :[false]
Running random walk in product with property : HirschbergSinclair-PT-40-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 202 reset in 375 ms.
Product exploration explored 100000 steps with 202 reset in 431 ms.
Graph (complete) has 1289 edges and 501 vertex of which 461 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 492 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-14 finished in 14566 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14599536592513153644
[2021-05-17 23:40:45] [INFO ] Computing symmetric may disable matrix : 910 transitions.
[2021-05-17 23:40:45] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:40:45] [INFO ] Computing symmetric may enable matrix : 910 transitions.
[2021-05-17 23:40:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:40:45] [INFO ] Applying decomposition
[2021-05-17 23:40:45] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17919054780880699246.txt, -o, /tmp/graph17919054780880699246.bin, -w, /tmp/graph17919054780880699246.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17919054780880699246.bin, -l, -1, -v, -w, /tmp/graph17919054780880699246.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:40:46] [INFO ] Decomposing Gal with order
[2021-05-17 23:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:40:46] [INFO ] Computing Do-Not-Accords matrix : 910 transitions.
[2021-05-17 23:40:46] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:40:46] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14599536592513153644
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14599536592513153644]
[2021-05-17 23:40:46] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-17 23:40:46] [INFO ] Flatten gal took : 56 ms
[2021-05-17 23:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 23:40:46] [INFO ] Time to serialize gal into /tmp/LTLFireability14034503663557864130.gal : 6 ms
[2021-05-17 23:40:46] [INFO ] Time to serialize properties into /tmp/LTLFireability9063316952194497029.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability14034503663557864130.gal, -t, CGAL, -LTL, /tmp/LTLFireability9063316952194497029.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability14034503663557864130.gal -t CGAL -LTL /tmp/LTLFireability9063316952194497029.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !(((X(F("(i11.i1.u36.rcv_left_election_40_6_40_40<1)")))U(((X(F("(i11.i1.u36.rcv_left_election_40_6_40_40<1)")))&&(("(i11.i1.u36.rcv_left_election_40_6_40_40>=1)")||((!("((i9.i1.u41.newmsg22>=1)&&(i9.i1.u41.election_21_0_1_to_right_21>=1))"))U(("((i3.u9.rcv_left_election_40_4_10_10<1)&&(!((i9.i1.u41.newmsg22>=1)&&(i9.i1.u41.election_21_0_1_to_right_21>=1))))")||(G(!("((i9.i1.u41.newmsg22>=1)&&(i9.i1.u41.election_21_0_1_to_right_21>=1))")))))))||(G(X(F("(i11.i1.u36.rcv_left_election_40_6_40_40<1)")))))))
Formula 0 simplified : !(XF"(i11.i1.u36.rcv_left_election_40_6_40_40<1)" U ((XF"(i11.i1.u36.rcv_left_election_40_6_40_40<1)" & ("(i11.i1.u36.rcv_left_election_40_6_40_40>=1)" | (!"((i9.i1.u41.newmsg22>=1)&&(i9.i1.u41.election_21_0_1_to_right_21>=1))" U ("((i3.u9.rcv_left_election_40_4_10_10<1)&&(!((i9.i1.u41.newmsg22>=1)&&(i9.i1.u41.election_21_0_1_to_right_21>=1))))" | G!"((i9.i1.u41.newmsg22>=1)&&(i9.i1.u41.election_21_0_1_to_right_21>=1))")))) | GXF"(i11.i1.u36.rcv_left_election_40_6_40_40<1)"))
Compilation finished in 5797 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14599536592513153644]
Link finished in 61 ms.
WARNING : LTS min runner thread failed on error :java.lang.UnsupportedOperationException: Unexpected Nary operator in expression translated to C : (APREF p3 p4)
java.lang.UnsupportedOperationException: Unexpected Nary operator in expression translated to C : (APREF p3 p4)
at fr.lip6.move.gal.structural.expr.CExpressionPrinter.visit(CExpressionPrinter.java:138)
at fr.lip6.move.gal.structural.expr.CExpressionPrinter.visit(CExpressionPrinter.java:1)
at fr.lip6.move.gal.structural.expr.NaryOp.accept(NaryOp.java:126)
at fr.lip6.move.gal.structural.expr.CExpressionPrinter.visit(CExpressionPrinter.java:143)
at fr.lip6.move.gal.structural.expr.CExpressionPrinter.visit(CExpressionPrinter.java:1)
at fr.lip6.move.gal.structural.expr.NaryOp.accept(NaryOp.java:126)
at fr.lip6.move.gal.pn2pins.PetriNet2PinsTransformer.printLTLProperty(PetriNet2PinsTransformer.java:819)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:146)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions start1, start2, start3, start5, start6, start8, start11, start15, start17, start18, start21, start25, start28, start29, start32, start33, start37, start40, hdl_right_election_6_0_1_5, hdl_right_election_18_0_1_17, hdl_right_election_29_0_1_28, elected_40_40, i0.hdl_right_election_2_0_1_1, i0.u1.hdl_left_election_1_0_1_2, i1.hdl_right_election_5_0_1_4, i1.hdl_right_election_4_0_1_3, i1.start4, i1.u2.hdl_left_election_2_0_1_3, i1.u2.reply_3_0_from_left_3, i1.u3.hdl_left_election_3_0_1_4, i1.u4.hdl_left_election_4_0_1_5, i2.start7, i2.u5.hdl_left_election_5_0_1_6, i2.u5.hdl_right_election_7_0_1_6, i2.u6.hdl_left_election_6_0_1_7, i2.u6.hdl_right_election_8_0_1_7, i3.hdl_right_election_10_0_1_9, i3.start10, i3.start9, i3.u7.hdl_left_election_7_0_1_8, i3.u7.hdl_right_election_9_0_1_8, i3.u8.hdl_left_election_8_0_1_9, i3.u9.hdl_left_election_9_0_1_10, i3.u9.hdl_right_election_11_0_1_10, i4.start13, i4.start12, i4.i0.u10.hdl_left_election_10_0_1_11, i4.i0.u10.hdl_right_election_12_0_1_11, i4.i0.u11.hdl_left_election_11_0_1_12, i4.i1.start14, i4.i1.u12.hdl_left_election_12_0_1_13, i4.i1.u12.hdl_left_reply_13_0_13, i4.i1.u12.hdl_right_election_14_0_1_13, i4.i1.u13.hdl_left_election_13_0_1_14, i4.i1.u13.hdl_right_election_15_0_1_14, i5.hdl_right_election_17_0_1_16, i5.start16, i5.i0.hdl_right_election_16_0_1_15, i5.i0.u14.hdl_left_election_14_0_1_15, i5.i0.u15.hdl_left_election_15_0_1_16, i5.i1.u16.hdl_left_election_16_0_1_17, i6.hdl_right_election_20_0_1_19, i6.hdl_right_election_19_0_1_18, i6.start20, i6.start19, i6.u17.hdl_left_election_17_0_1_18, i6.u18.hdl_left_election_18_0_1_19, i6.u39.hdl_left_election_19_0_1_20, i6.u39.hdl_right_election_21_0_1_20, i7.hdl_right_election_31_0_1_30, i7.start31, i7.start30, i7.i0.hdl_right_election_30_0_1_29, i7.i0.u26.hdl_left_election_28_0_1_29, i7.i0.u27.hdl_left_election_29_0_1_30, i7.i1.u28.hdl_left_election_30_0_1_31, i7.i1.u28.hdl_right_election_32_0_1_31, i7.i1.u29.hdl_left_election_31_0_1_32, i8.start35, i8.i0.start34, i8.i0.u30.hdl_left_election_32_0_1_33, i8.i0.u30.hdl_left_reply_33_0_33, i8.i0.u30.hdl_right_election_34_0_1_33, i8.i0.u31.hdl_left_election_33_0_1_34, i8.i0.u31.hdl_right_election_35_0_1_34, i8.i1.start36, i8.i1.u32.hdl_left_election_34_0_1_35, i8.i1.u32.hdl_right_election_36_0_1_35, i8.i1.u33.hdl_left_election_35_0_1_36, i8.i1.u33.hdl_right_election_37_0_1_36, i9.start23, i9.i0.start24, i9.i0.u21.hdl_left_election_22_0_1_23, i9.i0.u21.hdl_right_election_24_0_1_23, i9.i0.u22.hdl_left_election_23_0_1_24, i9.i0.u22.hdl_right_election_25_0_1_24, i9.i1.start22, i9.i1.hdl_right_election_23_0_1_22, i9.i1.u19.hdl_left_election_20_0_1_21, i9.i1.u41.hdl_left_election_21_0_1_22, i9.i1.u41.reply_22_0_from_left_22, i10.hdl_right_election_27_0_1_26, i10.start27, i10.start26, i10.i0.u23.hdl_left_election_24_0_1_25, i10.i0.u23.hdl_right_election_26_0_1_25, i10.i0.u24.hdl_left_election_25_0_1_26, i10.i1.hdl_right_election_28_0_1_27, i10.i1.u42.hdl_left_election_26_0_1_27, i10.i1.u43.hdl_left_election_27_0_1_28, i11.hdl_right_election_39_0_1_38, i11.start39, i11.start38, i11.i0.u34.hdl_left_election_36_0_1_37, i11.i0.u34.hdl_right_election_38_0_1_37, i11.i0.u35.hdl_left_election_37_0_1_38, i11.i1.u36.hdl_right_election_1_0_1_40, i11.i1.u36.hdl_right_election_40_6_40_40, i11.i1.u36.hdl_left_election_40_6_40_40, i11.i1.u46.hdl_left_election_38_0_1_39, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/790/120/910
Computing Next relation with stutter on 1.83312e+29 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
12708 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,127.203,1908852,1,0,1.99482e+06,932284,12245,1.54362e+07,4947,6.09163e+06,1941489
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-40-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(((!("((i4.i0.u11.newmsg12>=1)&&(i4.i0.u11.election_40_6_12_to_right_11>=1))"))||(X(!("((i4.i0.u11.newmsg12>=1)&&(i4.i0.u11.election_40_6_12_to_right_11>=1))"))))||((!("((i4.i0.u10.newmsg11>=1)&&(i3.u9.election_40_5_11_to_right_10>=1))"))&&(X(F((!("((i9.i0.u22.newmsg24>=1)&&(i9.i0.u22.election_40_4_16_to_left_25>=1))"))||(G(!("((i4.i0.u11.newmsg12>=1)&&(i4.i0.u11.election_40_6_12_to_right_11>=1))"))))))))))
Formula 1 simplified : !G(!"((i4.i0.u11.newmsg12>=1)&&(i4.i0.u11.election_40_6_12_to_right_11>=1))" | X!"((i4.i0.u11.newmsg12>=1)&&(i4.i0.u11.election_40_6_12_to_right_11>=1))" | (!"((i4.i0.u10.newmsg11>=1)&&(i3.u9.election_40_5_11_to_right_10>=1))" & XF(!"((i9.i0.u22.newmsg24>=1)&&(i9.i0.u22.election_40_4_16_to_left_25>=1))" | G!"((i4.i0.u11.newmsg12>=1)&&(i4.i0.u11.election_40_6_12_to_right_11>=1))")))
Computing Next relation with stutter on 1.83312e+29 deadlock states
Detected timeout of ITS tools.
[2021-05-18 00:02:30] [INFO ] Flatten gal took : 24 ms
[2021-05-18 00:02:30] [INFO ] Time to serialize gal into /tmp/LTLFireability6768159057817790719.gal : 3 ms
[2021-05-18 00:02:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2843943934611031819.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability6768159057817790719.gal, -t, CGAL, -LTL, /tmp/LTLFireability2843943934611031819.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6768159057817790719.gal -t CGAL -LTL /tmp/LTLFireability2843943934611031819.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((G(((!("((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))"))||(X(!("((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))"))))||((!("((newmsg11>=1)&&(election_40_5_11_to_right_10>=1))"))&&(X(F((!("((newmsg24>=1)&&(election_40_4_16_to_left_25>=1))"))||(G(!("((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))"))))))))))
Formula 0 simplified : !G(!"((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))" | X!"((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))" | (!"((newmsg11>=1)&&(election_40_5_11_to_right_10>=1))" & XF(!"((newmsg24>=1)&&(election_40_4_16_to_left_25>=1))" | G!"((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))")))
Reverse transition relation is NOT exact ! Due to transitions start1, start2, start3, start4, start5, start6, start7, start8, start9, start10, start11, start12, start13, start14, start15, start16, start17, start18, start19, start20, start21, start22, start23, start24, start25, start26, start27, start28, start29, start30, start31, start32, start33, start34, start35, start36, start37, start38, start39, start40, hdl_right_election_1_0_1_40, hdl_left_election_1_0_1_2, hdl_right_election_2_0_1_1, hdl_left_election_2_0_1_3, reply_3_0_from_left_3, hdl_left_election_3_0_1_4, hdl_right_election_4_0_1_3, hdl_left_election_4_0_1_5, hdl_right_election_5_0_1_4, hdl_left_election_5_0_1_6, hdl_right_election_6_0_1_5, hdl_left_election_6_0_1_7, hdl_right_election_7_0_1_6, hdl_left_election_7_0_1_8, hdl_right_election_8_0_1_7, hdl_left_election_8_0_1_9, hdl_right_election_9_0_1_8, hdl_left_election_9_0_1_10, hdl_right_election_10_0_1_9, hdl_left_election_10_0_1_11, hdl_right_election_11_0_1_10, hdl_left_election_11_0_1_12, hdl_right_election_12_0_1_11, hdl_left_election_12_0_1_13, hdl_left_reply_13_0_13, hdl_left_election_13_0_1_14, hdl_right_election_14_0_1_13, hdl_left_election_14_0_1_15, hdl_right_election_15_0_1_14, hdl_left_election_15_0_1_16, hdl_right_election_16_0_1_15, hdl_left_election_16_0_1_17, hdl_right_election_17_0_1_16, hdl_left_election_17_0_1_18, hdl_right_election_18_0_1_17, hdl_left_election_18_0_1_19, hdl_right_election_19_0_1_18, hdl_left_election_19_0_1_20, hdl_right_election_20_0_1_19, hdl_left_election_20_0_1_21, hdl_right_election_21_0_1_20, hdl_left_election_21_0_1_22, reply_22_0_from_left_22, hdl_left_election_22_0_1_23, hdl_right_election_23_0_1_22, hdl_left_election_23_0_1_24, hdl_right_election_24_0_1_23, hdl_left_election_24_0_1_25, hdl_right_election_25_0_1_24, hdl_left_election_25_0_1_26, hdl_right_election_26_0_1_25, hdl_left_election_26_0_1_27, hdl_right_election_27_0_1_26, hdl_left_election_27_0_1_28, hdl_right_election_28_0_1_27, hdl_left_election_28_0_1_29, hdl_right_election_29_0_1_28, hdl_left_election_29_0_1_30, hdl_right_election_30_0_1_29, hdl_left_election_30_0_1_31, hdl_right_election_31_0_1_30, hdl_left_election_31_0_1_32, hdl_right_election_32_0_1_31, hdl_left_election_32_0_1_33, hdl_left_reply_33_0_33, hdl_left_election_33_0_1_34, hdl_right_election_34_0_1_33, hdl_left_election_34_0_1_35, hdl_right_election_35_0_1_34, hdl_left_election_35_0_1_36, hdl_right_election_36_0_1_35, hdl_left_election_36_0_1_37, hdl_right_election_37_0_1_36, hdl_left_election_37_0_1_38, hdl_right_election_38_0_1_37, hdl_left_election_38_0_1_39, hdl_right_election_39_0_1_38, hdl_right_election_40_6_40_40, hdl_left_election_40_6_40_40, elected_40_40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/790/120/910
Computing Next relation with stutter on 1.83312e+29 deadlock states
Detected timeout of ITS tools.
[2021-05-18 00:24:14] [INFO ] Flatten gal took : 24 ms
[2021-05-18 00:24:14] [INFO ] Input system was already deterministic with 910 transitions.
[2021-05-18 00:24:14] [INFO ] Transformed 956 places.
[2021-05-18 00:24:14] [INFO ] Transformed 910 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 00:24:19] [INFO ] Time to serialize gal into /tmp/LTLFireability18059257493146866833.gal : 11 ms
[2021-05-18 00:24:19] [INFO ] Time to serialize properties into /tmp/LTLFireability5375607318217683406.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability18059257493146866833.gal, -t, CGAL, -LTL, /tmp/LTLFireability5375607318217683406.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability18059257493146866833.gal -t CGAL -LTL /tmp/LTLFireability5375607318217683406.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((!("((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))"))||(X(!("((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))"))))||((!("((newmsg11>=1)&&(election_40_5_11_to_right_10>=1))"))&&(X(F((!("((newmsg24>=1)&&(election_40_4_16_to_left_25>=1))"))||(G(!("((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))"))))))))))
Formula 0 simplified : !G(!"((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))" | X!"((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))" | (!"((newmsg11>=1)&&(election_40_5_11_to_right_10>=1))" & XF(!"((newmsg24>=1)&&(election_40_4_16_to_left_25>=1))" | G!"((newmsg12>=1)&&(election_40_6_12_to_right_11>=1))")))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t41, t43, t45, t47, t50, t52, t54, t56, t58, t60, t62, t64, t66, t68, t70, t72, t74, t76, t78, t80, t82, t84, t86, t88, t92, t94, t96, t98, t100, t102, t104, t106, t108, t110, t112, t114, t116, t118, t120, t122, t124, t126, t129, t131, t133, t135, t137, t139, t141, t143, t145, t147, t149, t151, t153, t155, t157, t159, t161, t163, t165, t167, t169, t171, t175, t177, t179, t181, t183, t185, t187, t189, t191, t193, t195, t197, t199, t789, t869, t909, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/790/120/910
Computing Next relation with stutter on 1.83312e+29 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="HirschbergSinclair-PT-40"
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-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-40, 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 r292-tall-162124156500453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-40.tgz
mv HirschbergSinclair-PT-40 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;