Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416200685.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-050051, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416200685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 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 RefineWMG-PT-050051-00
FORMULA_NAME RefineWMG-PT-050051-01
FORMULA_NAME RefineWMG-PT-050051-02
FORMULA_NAME RefineWMG-PT-050051-03
FORMULA_NAME RefineWMG-PT-050051-04
FORMULA_NAME RefineWMG-PT-050051-05
FORMULA_NAME RefineWMG-PT-050051-06
FORMULA_NAME RefineWMG-PT-050051-07
FORMULA_NAME RefineWMG-PT-050051-08
FORMULA_NAME RefineWMG-PT-050051-09
FORMULA_NAME RefineWMG-PT-050051-10
FORMULA_NAME RefineWMG-PT-050051-11
FORMULA_NAME RefineWMG-PT-050051-12
FORMULA_NAME RefineWMG-PT-050051-13
FORMULA_NAME RefineWMG-PT-050051-14
FORMULA_NAME RefineWMG-PT-050051-15

=== Now, execution of the tool begins

BK_START 1621264340933

Running Version 0
[2021-05-17 15:12:22] [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 15:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:12:22] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-17 15:12:22] [INFO ] Transformed 254 places.
[2021-05-17 15:12:22] [INFO ] Transformed 203 transitions.
[2021-05-17 15:12:22] [INFO ] Parsed PT model containing 254 places and 203 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:12:22] [INFO ] Initial state test concluded for 4 properties.
FORMULA RefineWMG-PT-050051-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 27 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:23] [INFO ] Computed 102 place invariants in 8 ms
[2021-05-17 15:12:23] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:23] [INFO ] Computed 102 place invariants in 11 ms
[2021-05-17 15:12:23] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:23] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:12:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:23] [INFO ] Computed 102 place invariants in 9 ms
[2021-05-17 15:12:23] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
[2021-05-17 15:12:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 15:12:23] [INFO ] Flatten gal took : 42 ms
FORMULA RefineWMG-PT-050051-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:12:23] [INFO ] Flatten gal took : 17 ms
[2021-05-17 15:12:23] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 100049 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=510 ) properties (out of 28) seen :18
Running SMT prover for 10 properties.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:24] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:12:24] [INFO ] [Real]Absence check using 102 positive place invariants in 13 ms returned sat
[2021-05-17 15:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:24] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-17 15:12:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:24] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 15:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:24] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-17 15:12:24] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 15:12:24] [INFO ] Added : 95 causal constraints over 19 iterations in 300 ms. Result :sat
[2021-05-17 15:12:24] [INFO ] [Real]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 15:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:24] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 15:12:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:24] [INFO ] [Nat]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 15:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:25] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-17 15:12:25] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 15:12:25] [INFO ] Added : 77 causal constraints over 16 iterations in 219 ms. Result :sat
[2021-05-17 15:12:25] [INFO ] [Real]Absence check using 102 positive place invariants in 13 ms returned sat
[2021-05-17 15:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:25] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-17 15:12:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:25] [INFO ] [Nat]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 15:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:25] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-17 15:12:25] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 15:12:25] [INFO ] Added : 37 causal constraints over 8 iterations in 98 ms. Result :sat
[2021-05-17 15:12:25] [INFO ] [Real]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 15:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:25] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-17 15:12:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:25] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2021-05-17 15:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:25] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-17 15:12:25] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-17 15:12:26] [INFO ] Added : 104 causal constraints over 21 iterations in 247 ms. Result :sat
[2021-05-17 15:12:26] [INFO ] [Real]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 15:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:26] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 15:12:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 15:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:26] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-17 15:12:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 15:12:26] [INFO ] Added : 19 causal constraints over 4 iterations in 84 ms. Result :sat
[2021-05-17 15:12:26] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 15:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:26] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-17 15:12:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:26] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 15:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:26] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-17 15:12:26] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 15:12:26] [INFO ] Added : 37 causal constraints over 8 iterations in 142 ms. Result :sat
[2021-05-17 15:12:26] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 15:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:27] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-17 15:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 16 ms returned sat
[2021-05-17 15:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:27] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-17 15:12:27] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 15:12:27] [INFO ] Added : 27 causal constraints over 6 iterations in 101 ms. Result :sat
[2021-05-17 15:12:27] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 15:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:27] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 15:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 19 ms returned sat
[2021-05-17 15:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:27] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-17 15:12:27] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 15:12:27] [INFO ] Added : 62 causal constraints over 13 iterations in 177 ms. Result :sat
[2021-05-17 15:12:27] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 15:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:27] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-17 15:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2021-05-17 15:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:28] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-17 15:12:28] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:12:28] [INFO ] Added : 31 causal constraints over 7 iterations in 112 ms. Result :sat
[2021-05-17 15:12:28] [INFO ] [Real]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 15:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:28] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-17 15:12:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 15:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:28] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-17 15:12:28] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 15:12:28] [INFO ] Added : 44 causal constraints over 9 iterations in 113 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 30 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:28] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:12:28] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:28] [INFO ] Computed 102 place invariants in 7 ms
[2021-05-17 15:12:28] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:28] [INFO ] Computed 102 place invariants in 10 ms
[2021-05-17 15:12:29] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:29] [INFO ] Computed 102 place invariants in 3 ms
[2021-05-17 15:12:29] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s248 1), p1:(GEQ s232 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 628 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 374 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 5 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 98 place count 158 transition count 108
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 98 rules in 66 ms. Remains 158 /254 variables (removed 96) and now considering 108/203 (removed 95) transitions.
// Phase 1: matrix 108 rows 158 cols
[2021-05-17 15:12:32] [INFO ] Computed 54 place invariants in 14 ms
[2021-05-17 15:12:32] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
[2021-05-17 15:12:32] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 108 rows 158 cols
[2021-05-17 15:12:32] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-17 15:12:32] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/254 places, 108/203 transitions.
Product exploration explored 100000 steps with 50000 reset in 833 ms.
Product exploration explored 100000 steps with 50000 reset in 568 ms.
[2021-05-17 15:12:33] [INFO ] Flatten gal took : 10 ms
[2021-05-17 15:12:33] [INFO ] Flatten gal took : 10 ms
[2021-05-17 15:12:33] [INFO ] Time to serialize gal into /tmp/LTL1198219493379505707.gal : 6 ms
[2021-05-17 15:12:33] [INFO ] Time to serialize properties into /tmp/LTL12388156012320987556.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/LTL1198219493379505707.gal, -t, CGAL, -LTL, /tmp/LTL12388156012320987556.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/LTL1198219493379505707.gal -t CGAL -LTL /tmp/LTL12388156012320987556.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p245>=1)"))U(X("(p229>=1)"))))
Formula 0 simplified : !(F"(p245>=1)" U X"(p229>=1)")
Detected timeout of ITS tools.
[2021-05-17 15:12:48] [INFO ] Flatten gal took : 25 ms
[2021-05-17 15:12:48] [INFO ] Applying decomposition
[2021-05-17 15:12:48] [INFO ] Flatten gal took : 21 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/graph7150394689762328065.txt, -o, /tmp/graph7150394689762328065.bin, -w, /tmp/graph7150394689762328065.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/graph7150394689762328065.bin, -l, -1, -v, -w, /tmp/graph7150394689762328065.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:12:49] [INFO ] Decomposing Gal with order
[2021-05-17 15:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:12:49] [INFO ] Flatten gal took : 46 ms
[2021-05-17 15:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 15:12:49] [INFO ] Time to serialize gal into /tmp/LTL9473844945873620807.gal : 7 ms
[2021-05-17 15:12:49] [INFO ] Time to serialize properties into /tmp/LTL7101338957433590877.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/LTL9473844945873620807.gal, -t, CGAL, -LTL, /tmp/LTL7101338957433590877.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/LTL9473844945873620807.gal -t CGAL -LTL /tmp/LTL7101338957433590877.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i28.i1.u121.p245>=1)"))U(X("(i27.i0.u113.p229>=1)"))))
Formula 0 simplified : !(F"(i28.i1.u121.p245>=1)" U X"(i27.i0.u113.p229>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3349663429359582763
[2021-05-17 15:13:04] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3349663429359582763
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/ltsmin3349663429359582763]
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/ltsmin3349663429359582763] 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/ltsmin3349663429359582763] 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 RefineWMG-PT-050051-00 finished in 36726 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G((p0||F(p1))))&&(p2||X((p3 U p4))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 33 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:05] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:05] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:05] [INFO ] Computed 102 place invariants in 10 ms
[2021-05-17 15:13:05] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:05] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:05] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:05] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:05] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p4))), (NOT p4), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : RefineWMG-PT-050051-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s38 1), p0:(AND (GEQ s221 1) (GEQ s222 1) (GEQ s224 1)), p1:(AND (GEQ s221 1) (GEQ s222 1) (GEQ s224 1) (GEQ s103 1)), p4:(AND (GEQ s103 1) (GEQ s38 1)), p3:(GEQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-01 finished in 832 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)&&(p1 U ((p1&&G(p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:06] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:06] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:06] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:06] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:06] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:06] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:06] [INFO ] Computed 102 place invariants in 3 ms
[2021-05-17 15:13:06] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s56 1) (LT s57 1) (LT s59 1)), p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 635 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 1 ms.
FORMULA RefineWMG-PT-050051-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-03 finished in 1345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(F((G(!p0)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 241 place count 58 transition count 12
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 286 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 286 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 290 place count 11 transition count 10
Applied a total of 290 rules in 14 ms. Remains 11 /254 variables (removed 243) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 15:13:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:13:07] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 15:13:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:13:07] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 15:13:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:13:07] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-17 15:13:07] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-17 15:13:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:13:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s4 5), p1:(OR (LT s7 1) (LT s8 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-05 finished in 251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:07] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:07] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:07] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:07] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:07] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:08] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:08] [INFO ] Computed 102 place invariants in 7 ms
[2021-05-17 15:13:08] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 121 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-050051-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-06 finished in 666 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:08] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:08] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:08] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:08] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:08] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:08] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:08] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:08] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (OR (AND (GEQ s156 1) (GEQ s157 1) (GEQ s159 1)) (AND (GEQ s151 1) (GEQ s152 1) (GEQ s154 1))) (GEQ s156 1) (GEQ s157 1) (GEQ s159 1)), p0:(AND (GEQ s211 1) (GEQ s212 1) (GEQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 125 reset in 824 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA RefineWMG-PT-050051-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-07 finished in 1588 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 149 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 197 place count 56 transition count 55
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 244 place count 56 transition count 8
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 291 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 291 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 7 transition count 6
Applied a total of 295 rules in 9 ms. Remains 7 /254 variables (removed 247) and now considering 6/203 (removed 197) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:13:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 15:13:09] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:13:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 15:13:09] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:13:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:13:09] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-17 15:13:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:13:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 15:13:10] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/254 places, 6/203 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-08 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 s5 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 6 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-08 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&(F(G(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 143 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 194 place count 62 transition count 61
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 236 place count 62 transition count 19
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 278 place count 20 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 278 place count 20 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 284 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 286 place count 16 transition count 15
Applied a total of 286 rules in 8 ms. Remains 16 /254 variables (removed 238) and now considering 15/203 (removed 188) transitions.
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 15:13:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 15:13:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 15:13:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 15:13:10] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 15:13:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 15:13:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-17 15:13:10] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-17 15:13:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 15:13:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/254 places, 15/203 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-050051-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LT s14 1), p1:(OR (LT s9 1) (LT s10 1) (LT s12 1)), p2:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-10 finished in 175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(X(X(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:10] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:10] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:10] [INFO ] Computed 102 place invariants in 6 ms
[2021-05-17 15:13:10] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:10] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:10] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:10] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:10] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p1:(AND (GEQ s176 1) (GEQ s177 1) (GEQ s179 1)), p0:(GEQ s62 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 876 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA RefineWMG-PT-050051-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-11 finished in 1685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U (p1||G(p0)))) U ((p2&&X((p0 U (p3||G(p0)))))||X(G(p4)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:11] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:12] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:12] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:12] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:12] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 15:13:12] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:12] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:12] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p4) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p0) (NOT p4)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), true, (NOT p4), (AND p4 (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-13 automaton TGBA [mat=[[{ cond=(AND (NOT p4) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p4) (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=(OR (AND p2 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p4) (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p4 (NOT p0) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p4) p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p4 p0 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p4) (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p2) p4 (NOT p0) (NOT p3)), acceptance={1} source=1 dest: 3}], [{ cond=(AND p4 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p4 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p4)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p4), acceptance={1} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p4), acceptance={1} source=3 dest: 3}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p4), acceptance={} source=5 dest: 4}, { cond=p4, acceptance={} source=5 dest: 5}], [{ cond=(AND p4 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p4 (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=3, aps=[p4:(OR (LT s141 1) (LT s142 1) (LT s144 1) (AND (OR (LT s141 1) (LT s142 1) (LT s144 1)) (LT s178 1))), p1:(AND (LT s178 1) (OR (LT s141 1) (LT s142 1) (LT s144 1))), p0:(OR (LT s141 1) (LT s142 1) (LT s144 1)), p3:(AND (OR (LT s141 1) (LT s142 1) (LT s144 1)) (LT s178 1)), p2:(OR (LT s226 1) (LT s227 1) (LT s229 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 49486 reset in 652 ms.
Product exploration explored 100000 steps with 49540 reset in 522 ms.
Knowledge obtained : [p4, p1, p0, p3, p2]
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p4) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p0) (NOT p4)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), true, (NOT p4), (AND p4 (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 49499 reset in 642 ms.
Product exploration explored 100000 steps with 49498 reset in 709 ms.
Applying partial POR strategy [true, false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p4) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p0) (NOT p4)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), true, (NOT p4), (AND p4 (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 142 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 95 place count 160 transition count 110
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 95 rules in 21 ms. Remains 160 /254 variables (removed 94) and now considering 110/203 (removed 93) transitions.
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:13:16] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:13:16] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
[2021-05-17 15:13:16] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:13:16] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:13:16] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/254 places, 110/203 transitions.
Product exploration explored 100000 steps with 49512 reset in 1019 ms.
Product exploration explored 100000 steps with 49531 reset in 715 ms.
[2021-05-17 15:13:18] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:13:18] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:13:18] [INFO ] Time to serialize gal into /tmp/LTL8512063526390732653.gal : 2 ms
[2021-05-17 15:13:18] [INFO ] Time to serialize properties into /tmp/LTL16633641773732590094.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/LTL8512063526390732653.gal, -t, CGAL, -LTL, /tmp/LTL16633641773732590094.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/LTL8512063526390732653.gal -t CGAL -LTL /tmp/LTL16633641773732590094.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("(((p138<1)||(p139<1))||(p141<1))")U((G("(((p138<1)||(p139<1))||(p141<1))"))||("((p175<1)&&(((p138<1)||(p139<1))||(p141<1)))"))))U((X(G("((((p138<1)||(p139<1))||(p141<1))||((((p138<1)||(p139<1))||(p141<1))&&(p175<1)))")))||((X(("(((p138<1)||(p139<1))||(p141<1))")U(("((((p138<1)||(p139<1))||(p141<1))&&(p175<1))")||(G("(((p138<1)||(p139<1))||(p141<1))")))))&&("(((p223<1)||(p224<1))||(p226<1))")))))
Formula 0 simplified : !(X("(((p138<1)||(p139<1))||(p141<1))" U ("((p175<1)&&(((p138<1)||(p139<1))||(p141<1)))" | G"(((p138<1)||(p139<1))||(p141<1))")) U (XG"((((p138<1)||(p139<1))||(p141<1))||((((p138<1)||(p139<1))||(p141<1))&&(p175<1)))" | ("(((p223<1)||(p224<1))||(p226<1))" & X("(((p138<1)||(p139<1))||(p141<1))" U ("((((p138<1)||(p139<1))||(p141<1))&&(p175<1))" | G"(((p138<1)||(p139<1))||(p141<1))")))))
Detected timeout of ITS tools.
[2021-05-17 15:13:33] [INFO ] Flatten gal took : 30 ms
[2021-05-17 15:13:33] [INFO ] Applying decomposition
[2021-05-17 15:13:33] [INFO ] Flatten gal took : 18 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/graph6747096941920630884.txt, -o, /tmp/graph6747096941920630884.bin, -w, /tmp/graph6747096941920630884.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/graph6747096941920630884.bin, -l, -1, -v, -w, /tmp/graph6747096941920630884.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:13:33] [INFO ] Decomposing Gal with order
[2021-05-17 15:13:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:13:33] [INFO ] Flatten gal took : 29 ms
[2021-05-17 15:13:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:13:34] [INFO ] Time to serialize gal into /tmp/LTL10890484692489916062.gal : 17 ms
[2021-05-17 15:13:34] [INFO ] Time to serialize properties into /tmp/LTL3264682540766174712.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/LTL10890484692489916062.gal, -t, CGAL, -LTL, /tmp/LTL3264682540766174712.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/LTL10890484692489916062.gal -t CGAL -LTL /tmp/LTL3264682540766174712.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(("(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))")U((G("(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))"))||("((i19.i1.u86.p175<1)&&(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1)))"))))U((X(G("((((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))||((((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))&&(i19.i1.u86.p175<1)))")))||((X(("(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))")U(("((((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))&&(i19.i1.u86.p175<1))")||(G("(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))")))))&&("(((i24.i1.u110.p223<1)||(i24.i1.u111.p224<1))||(i24.i1.u109.p226<1))")))))
Formula 0 simplified : !(X("(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))" U ("((i19.i1.u86.p175<1)&&(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1)))" | G"(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))")) U (XG"((((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))||((((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))&&(i19.i1.u86.p175<1)))" | ("(((i24.i1.u110.p223<1)||(i24.i1.u111.p224<1))||(i24.i1.u109.p226<1))" & X("(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))" U ("((((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))&&(i19.i1.u86.p175<1))" | G"(((i15.i0.u68.p138<1)||(i15.i0.u69.p139<1))||(i15.i0.u67.p141<1))")))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5111478397267570609
[2021-05-17 15:13:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5111478397267570609
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/ltsmin5111478397267570609]
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/ltsmin5111478397267570609] 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/ltsmin5111478397267570609] 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 RefineWMG-PT-050051-13 finished in 38193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:50] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:50] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:50] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:52] [INFO ] Implicit Places using invariants in 1743 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:52] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:52] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:52] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:52] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s228 1), p1:(GEQ s22 1), p2:(GEQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Product exploration explored 100000 steps with 50000 reset in 601 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Product exploration explored 100000 steps with 50000 reset in 558 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 144 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 0 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 97 place count 160 transition count 110
Deduced a syphon composed of 50 places in 1 ms
Applied a total of 97 rules in 11 ms. Remains 160 /254 variables (removed 94) and now considering 110/203 (removed 93) transitions.
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:13:55] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:13:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
[2021-05-17 15:13:55] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:13:55] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:13:55] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/254 places, 110/203 transitions.
Product exploration explored 100000 steps with 50000 reset in 1235 ms.
Product exploration explored 100000 steps with 50000 reset in 938 ms.
[2021-05-17 15:13:58] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:13:58] [INFO ] Flatten gal took : 14 ms
[2021-05-17 15:13:58] [INFO ] Time to serialize gal into /tmp/LTL6489582934210789966.gal : 3 ms
[2021-05-17 15:13:58] [INFO ] Time to serialize properties into /tmp/LTL5350864869035570126.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/LTL6489582934210789966.gal, -t, CGAL, -LTL, /tmp/LTL5350864869035570126.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/LTL6489582934210789966.gal -t CGAL -LTL /tmp/LTL5350864869035570126.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p225>=1)"))||(X(F(("(p19>=1)")||(G("(p85>=1)")))))))
Formula 0 simplified : !(G"(p225>=1)" | XF("(p19>=1)" | G"(p85>=1)"))
Detected timeout of ITS tools.
[2021-05-17 15:14:13] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:14:13] [INFO ] Applying decomposition
[2021-05-17 15:14:13] [INFO ] Flatten gal took : 15 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/graph11744386345168010406.txt, -o, /tmp/graph11744386345168010406.bin, -w, /tmp/graph11744386345168010406.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/graph11744386345168010406.bin, -l, -1, -v, -w, /tmp/graph11744386345168010406.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:14:13] [INFO ] Decomposing Gal with order
[2021-05-17 15:14:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:14:13] [INFO ] Flatten gal took : 9 ms
[2021-05-17 15:14:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 15:14:13] [INFO ] Time to serialize gal into /tmp/LTL6551391480328704222.gal : 3 ms
[2021-05-17 15:14:13] [INFO ] Time to serialize properties into /tmp/LTL17562898561174195762.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/LTL6551391480328704222.gal, -t, CGAL, -LTL, /tmp/LTL17562898561174195762.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/LTL6551391480328704222.gal -t CGAL -LTL /tmp/LTL17562898561174195762.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i24.i1.u108.p225>=1)"))||(X(F(("(i2.i0.u10.p19>=1)")||(G("(i8.i1.u41.p85>=1)")))))))
Formula 0 simplified : !(G"(i24.i1.u108.p225>=1)" | XF("(i2.i0.u10.p19>=1)" | G"(i8.i1.u41.p85>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15693128146602967805
[2021-05-17 15:14:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15693128146602967805
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/ltsmin15693128146602967805]
Compilation finished in 738 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15693128146602967805]
Link finished in 62 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X(<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15693128146602967805]
LTSmin run took 1136 ms.
FORMULA RefineWMG-PT-050051-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-050051-14 finished in 40146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 199 place count 56 transition count 56
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 246 place count 56 transition count 9
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 293 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 293 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 297 place count 7 transition count 7
Applied a total of 297 rules in 6 ms. Remains 7 /254 variables (removed 247) and now considering 7/203 (removed 196) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 15:14:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:14:30] [INFO ] Dead Transitions using invariants and state equation in 354 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 15:14:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:14:30] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 15:14:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:14:30] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-17 15:14:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 15:14:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:14:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/254 places, 7/203 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 273 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-15 finished in 518 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16203390172224145921
[2021-05-17 15:14:30] [INFO ] Applying decomposition
[2021-05-17 15:14:30] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2021-05-17 15:14:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:14:30] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2021-05-17 15:14:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:14:30] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:14:30] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2021-05-17 15:14:30] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:14:30] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16203390172224145921
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/ltsmin16203390172224145921]
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/graph13704365247544521504.txt, -o, /tmp/graph13704365247544521504.bin, -w, /tmp/graph13704365247544521504.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/graph13704365247544521504.bin, -l, -1, -v, -w, /tmp/graph13704365247544521504.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:14:30] [INFO ] Decomposing Gal with order
[2021-05-17 15:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:14:30] [INFO ] Flatten gal took : 16 ms
[2021-05-17 15:14:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:14:30] [INFO ] Time to serialize gal into /tmp/LTLFireability11902650810544929841.gal : 3 ms
[2021-05-17 15:14:30] [INFO ] Time to serialize properties into /tmp/LTLFireability1508931593028787995.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/LTLFireability11902650810544929841.gal, -t, CGAL, -LTL, /tmp/LTLFireability1508931593028787995.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/LTLFireability11902650810544929841.gal -t CGAL -LTL /tmp/LTLFireability1508931593028787995.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((F("(i26.i1.u118.p245>=1)"))U(X("(i25.i0.u110.p229>=1)"))))
Formula 0 simplified : !(F"(i26.i1.u118.p245>=1)" U X"(i25.i0.u110.p229>=1)")
Compilation finished in 901 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16203390172224145921]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true)) U X((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16203390172224145921]
LTSmin run took 664 ms.
FORMULA RefineWMG-PT-050051-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U (((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp5==true)||[]((LTLAPp2==true))))))||X([]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16203390172224145921]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.208: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.208: LTL layer: formula: (X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U (((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp5==true)||[]((LTLAPp2==true))))))||X([]((LTLAPp6==true)))))
pins2lts-mc-linux64( 0/ 8), 0.208: "(X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U (((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp5==true)||[]((LTLAPp2==true))))))||X([]((LTLAPp6==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.208: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.224: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.233: buchi has 11 states
pins2lts-mc-linux64( 0/ 8), 0.307: There are 211 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.307: State length is 255, there are 256 groups
pins2lts-mc-linux64( 0/ 8), 0.307: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.307: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.307: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.307: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.988: [Blue] ~120 levels ~960 states ~198768 transitions
pins2lts-mc-linux64( 4/ 8), 1.129: [Blue] ~139 levels ~1920 states ~235856 transitions
pins2lts-mc-linux64( 4/ 8), 1.594: [Blue] ~294 levels ~3840 states ~503504 transitions
pins2lts-mc-linux64( 4/ 8), 2.237: [Blue] ~612 levels ~7680 states ~1052624 transitions
pins2lts-mc-linux64( 6/ 8), 3.121: [Blue] ~1251 levels ~15360 states ~2100048 transitions
pins2lts-mc-linux64( 6/ 8), 4.336: [Blue] ~2233 levels ~30720 states ~3762608 transitions
pins2lts-mc-linux64( 6/ 8), 7.007: [Blue] ~4183 levels ~61440 states ~7092368 transitions
pins2lts-mc-linux64( 6/ 8), 11.893: [Blue] ~8074 levels ~122880 states ~13810288 transitions
pins2lts-mc-linux64( 6/ 8), 22.963: [Blue] ~15875 levels ~245760 states ~27270544 transitions
pins2lts-mc-linux64( 6/ 8), 44.945: [Blue] ~31452 levels ~491520 states ~54147856 transitions
pins2lts-mc-linux64( 6/ 8), 83.805: [Blue] ~62596 levels ~983040 states ~107888560 transitions
pins2lts-mc-linux64( 6/ 8), 156.097: [Blue] ~124918 levels ~1966080 states ~215427088 transitions
pins2lts-mc-linux64( 0/ 8), 225.148: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 226.059:
pins2lts-mc-linux64( 0/ 8), 226.059: Explored 2512095 states 295495368 transitions, fanout: 117.629
pins2lts-mc-linux64( 0/ 8), 226.059: Total exploration time 225.730 sec (224.880 sec minimum, 225.342 sec on average)
pins2lts-mc-linux64( 0/ 8), 226.059: States per second: 11129, Transitions per second: 1309066
pins2lts-mc-linux64( 0/ 8), 226.059:
pins2lts-mc-linux64( 0/ 8), 226.059: State space has 134217183 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 226.059: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 226.059: blue states: 2512095 (1.87%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 226.059: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 226.059: all-red states: 1158446 (0.86%), bogus 10 (0.00%)
pins2lts-mc-linux64( 0/ 8), 226.059:
pins2lts-mc-linux64( 0/ 8), 226.059: Total memory used for local state coloring: 20.7MB
pins2lts-mc-linux64( 0/ 8), 226.059:
pins2lts-mc-linux64( 0/ 8), 226.059: Queue width: 8B, total height: 1353639, memory: 10.33MB
pins2lts-mc-linux64( 0/ 8), 226.059: Tree memory: 1049.9MB, 8.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 226.059: Tree fill ratio (roots/leafs): 99.0%/10.0%
pins2lts-mc-linux64( 0/ 8), 226.059: Stored 203 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 226.059: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 226.059: Est. total memory use: 1060.3MB (~1034.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U (((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp5==true)||[]((LTLAPp2==true))))))||X([]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16203390172224145921]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))) U (((LTLAPp4==true)&&X(((LTLAPp2==true) U ((LTLAPp5==true)||[]((LTLAPp2==true))))))||X([]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16203390172224145921]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 15:35:13] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:35:13] [INFO ] Time to serialize gal into /tmp/LTLFireability11093081260894260553.gal : 3 ms
[2021-05-17 15:35:13] [INFO ] Time to serialize properties into /tmp/LTLFireability13683359634676177658.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/LTLFireability11093081260894260553.gal, -t, CGAL, -LTL, /tmp/LTLFireability13683359634676177658.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/LTLFireability11093081260894260553.gal -t CGAL -LTL /tmp/LTLFireability13683359634676177658.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X((!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))U(("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))")||(G(!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))))))U(((!("(((p223>=1)&&(p224>=1))&&(p226>=1))"))&&(X((!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))U(("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))")||(G(!("(((p138>=1)&&(p139>=1))&&(p141>=1))")))))))||(G(X((!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))U(("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))")||(G(!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))))))))))
Formula 0 simplified : !(X(!"(((p138>=1)&&(p139>=1))&&(p141>=1))" U ("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))" | G!"(((p138>=1)&&(p139>=1))&&(p141>=1))")) U ((!"(((p223>=1)&&(p224>=1))&&(p226>=1))" & X(!"(((p138>=1)&&(p139>=1))&&(p141>=1))" U ("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))" | G!"(((p138>=1)&&(p139>=1))&&(p141>=1))"))) | GX(!"(((p138>=1)&&(p139>=1))&&(p141>=1))" U ("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))" | G!"(((p138>=1)&&(p139>=1))&&(p141>=1))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:55:55] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:55:55] [INFO ] Input system was already deterministic with 203 transitions.
[2021-05-17 15:55:55] [INFO ] Transformed 254 places.
[2021-05-17 15:55:55] [INFO ] Transformed 203 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-17 15:55:55] [INFO ] Time to serialize gal into /tmp/LTLFireability2972024874970115724.gal : 2 ms
[2021-05-17 15:55:55] [INFO ] Time to serialize properties into /tmp/LTLFireability17977112577350185353.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/LTLFireability2972024874970115724.gal, -t, CGAL, -LTL, /tmp/LTLFireability17977112577350185353.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/LTLFireability2972024874970115724.gal -t CGAL -LTL /tmp/LTLFireability17977112577350185353.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X((!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))U(("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))")||(G(!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))))))U(((!("(((p223>=1)&&(p224>=1))&&(p226>=1))"))&&(X((!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))U(("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))")||(G(!("(((p138>=1)&&(p139>=1))&&(p141>=1))")))))))||(G(X((!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))U(("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))")||(G(!("(((p138>=1)&&(p139>=1))&&(p141>=1))"))))))))))
Formula 0 simplified : !(X(!"(((p138>=1)&&(p139>=1))&&(p141>=1))" U ("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))" | G!"(((p138>=1)&&(p139>=1))&&(p141>=1))")) U ((!"(((p223>=1)&&(p224>=1))&&(p226>=1))" & X(!"(((p138>=1)&&(p139>=1))&&(p141>=1))" U ("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))" | G!"(((p138>=1)&&(p139>=1))&&(p141>=1))"))) | GX(!"(((p138>=1)&&(p139>=1))&&(p141>=1))" U ("((!(((p138>=1)&&(p139>=1))&&(p141>=1)))&&(p175<1))" | G!"(((p138>=1)&&(p139>=1))&&(p141>=1))"))))

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="RefineWMG-PT-050051"
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 RefineWMG-PT-050051, 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 r178-tajo-162089416200685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 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 ;