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-162089415100029.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 QuasiCertifProtocol-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415100029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 72K 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 QuasiCertifProtocol-COL-10-00
FORMULA_NAME QuasiCertifProtocol-COL-10-01
FORMULA_NAME QuasiCertifProtocol-COL-10-02
FORMULA_NAME QuasiCertifProtocol-COL-10-03
FORMULA_NAME QuasiCertifProtocol-COL-10-04
FORMULA_NAME QuasiCertifProtocol-COL-10-05
FORMULA_NAME QuasiCertifProtocol-COL-10-06
FORMULA_NAME QuasiCertifProtocol-COL-10-07
FORMULA_NAME QuasiCertifProtocol-COL-10-08
FORMULA_NAME QuasiCertifProtocol-COL-10-09
FORMULA_NAME QuasiCertifProtocol-COL-10-10
FORMULA_NAME QuasiCertifProtocol-COL-10-11
FORMULA_NAME QuasiCertifProtocol-COL-10-12
FORMULA_NAME QuasiCertifProtocol-COL-10-13
FORMULA_NAME QuasiCertifProtocol-COL-10-14
FORMULA_NAME QuasiCertifProtocol-COL-10-15

=== Now, execution of the tool begins

BK_START 1621232136946

Running Version 0
[2021-05-17 06:15:38] [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 06:15:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:15:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 06:15:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 06:15:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 619 ms
[2021-05-17 06:15:39] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:15:39] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 3 ms.
[2021-05-17 06:15:39] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2994936201834121156.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-17 06:15:39] [INFO ] Flatten gal took : 18 ms
[2021-05-17 06:15:39] [INFO ] Flatten gal took : 4 ms
[2021-05-17 06:15:39] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions in 12 ms.
[2021-05-17 06:15:39] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_16736040163826541129.dot
[2021-05-17 06:15:39] [INFO ] Initial state test concluded for 1 properties.
Support contains 260 out of 550 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 38 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2021-05-17 06:15:39] [INFO ] Computed 350 place invariants in 40 ms
[2021-05-17 06:15:40] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 176 rows 524 cols
[2021-05-17 06:15:40] [INFO ] Computed 350 place invariants in 11 ms
[2021-05-17 06:15:40] [INFO ] Implicit Places using invariants and state equation in 444 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 930 ms to find 11 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:40] [INFO ] Computed 340 place invariants in 23 ms
[2021-05-17 06:15:40] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Starting structural reductions, iteration 1 : 513/550 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:40] [INFO ] Computed 340 place invariants in 17 ms
[2021-05-17 06:15:41] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 2 iterations. Remains : 513/550 places, 176/176 transitions.
[2021-05-17 06:15:41] [INFO ] Flatten gal took : 40 ms
[2021-05-17 06:15:41] [INFO ] Flatten gal took : 31 ms
[2021-05-17 06:15:41] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 100000 steps, including 6925 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 21) seen :5
Running SMT prover for 16 properties.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:41] [INFO ] Computed 340 place invariants in 39 ms
[2021-05-17 06:15:42] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 62 ms returned sat
[2021-05-17 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:42] [INFO ] [Real]Absence check using state equation in 109 ms returned unsat
[2021-05-17 06:15:42] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 61 ms returned sat
[2021-05-17 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:42] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-17 06:15:42] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2021-05-17 06:15:42] [INFO ] Added : 11 causal constraints over 3 iterations in 200 ms. Result :sat
[2021-05-17 06:15:42] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 69 ms returned sat
[2021-05-17 06:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:43] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-17 06:15:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:43] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 60 ms returned sat
[2021-05-17 06:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:43] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-17 06:15:43] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 21 ms.
[2021-05-17 06:15:43] [INFO ] Added : 47 causal constraints over 10 iterations in 250 ms. Result :sat
[2021-05-17 06:15:43] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 58 ms returned sat
[2021-05-17 06:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:43] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-17 06:15:43] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 16 ms.
[2021-05-17 06:15:43] [INFO ] Added : 12 causal constraints over 3 iterations in 92 ms. Result :sat
[2021-05-17 06:15:44] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 49 ms returned sat
[2021-05-17 06:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:44] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-17 06:15:44] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2021-05-17 06:15:44] [INFO ] Added : 47 causal constraints over 10 iterations in 225 ms. Result :sat
[2021-05-17 06:15:44] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 54 ms returned sat
[2021-05-17 06:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:44] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-17 06:15:44] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 18 ms.
[2021-05-17 06:15:44] [INFO ] Added : 11 causal constraints over 3 iterations in 104 ms. Result :sat
[2021-05-17 06:15:44] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 60 ms returned sat
[2021-05-17 06:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:45] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-17 06:15:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:15:45] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 55 ms returned sat
[2021-05-17 06:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:45] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-17 06:15:45] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2021-05-17 06:15:45] [INFO ] Added : 18 causal constraints over 4 iterations in 131 ms. Result :sat
[2021-05-17 06:15:45] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 59 ms returned sat
[2021-05-17 06:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:45] [INFO ] [Real]Absence check using state equation in 119 ms returned unsat
[2021-05-17 06:15:45] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 60 ms returned sat
[2021-05-17 06:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:45] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-17 06:15:46] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 21 ms.
[2021-05-17 06:15:46] [INFO ] Added : 23 causal constraints over 5 iterations in 147 ms. Result :sat
[2021-05-17 06:15:46] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 67 ms returned sat
[2021-05-17 06:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:46] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-17 06:15:46] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2021-05-17 06:15:46] [INFO ] Added : 25 causal constraints over 5 iterations in 132 ms. Result :sat
[2021-05-17 06:15:46] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 67 ms returned sat
[2021-05-17 06:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:46] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-17 06:15:46] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2021-05-17 06:15:47] [INFO ] Added : 47 causal constraints over 10 iterations in 268 ms. Result :sat
[2021-05-17 06:15:47] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 82 ms returned sat
[2021-05-17 06:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:47] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-17 06:15:47] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 19 ms.
[2021-05-17 06:15:47] [INFO ] Added : 58 causal constraints over 12 iterations in 264 ms. Result :sat
[2021-05-17 06:15:48] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 58 ms returned sat
[2021-05-17 06:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:48] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-17 06:15:48] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 06:15:48] [INFO ] Added : 36 causal constraints over 8 iterations in 156 ms. Result :sat
[2021-05-17 06:15:48] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 44 ms returned sat
[2021-05-17 06:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:48] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-17 06:15:48] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 06:15:48] [INFO ] Added : 23 causal constraints over 5 iterations in 99 ms. Result :sat
[2021-05-17 06:15:48] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 41 ms returned sat
[2021-05-17 06:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:48] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-17 06:15:48] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2021-05-17 06:15:48] [INFO ] Added : 23 causal constraints over 5 iterations in 96 ms. Result :sat
[2021-05-17 06:15:49] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 67 ms returned sat
[2021-05-17 06:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:49] [INFO ] [Real]Absence check using state equation in 119 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2021-05-17 06:15:49] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-COL-10-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&(X(G(p1))||(p2 U G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:49] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 06:15:49] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:49] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 06:15:50] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:50] [INFO ] Computed 340 place invariants in 23 ms
[2021-05-17 06:15:50] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 408 ms :[(NOT p0), (NOT p0), (NOT p1), false, false, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s510 1), p2:(OR (GEQ s506 1) (GEQ s499 1) (GEQ s498 1) (GEQ s497 1) (GEQ s496 1) (GEQ s500 1) (GEQ s501 1) (GEQ s502 1) (GEQ s503 1) (GEQ s504 1) (GEQ s505 1)), p0:(GEQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-01 finished in 1747 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(G(p1)||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 46 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:50] [INFO ] Computed 340 place invariants in 19 ms
[2021-05-17 06:15:51] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:51] [INFO ] Computed 340 place invariants in 23 ms
[2021-05-17 06:15:52] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:52] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:15:52] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s397 1) (GEQ s452 1)) (AND (GEQ s400 1) (GEQ s455 1)) (AND (GEQ s401 1) (GEQ s456 1)) (AND (GEQ s404 1) (GEQ s459 1)) (AND (GEQ s405 1) (GEQ s460 1)) (AND (GEQ s398 1) (GEQ s453 1)) (AND (GEQ s399 1) (GEQ s454 1)) (AND (GEQ s402 1) (GEQ s457 1)) (AND (GEQ s403 1) (GEQ s458 1)) (AND (GEQ s406 1) (GEQ s461 1)) (AND (GEQ s407 1) (GEQ s462 1))), p1:(AND (OR (LT s0 1) (LT s496 1)) (OR (LT s0 1) (LT s497 1)) (OR (LT s0 1) (LT s506 1)) (OR (LT s0 1) (LT s502 1)) (OR (LT s0 1) (LT s503 1)) (OR (LT s0 1) (LT s504 1)) (OR (LT s0 1) (LT s505 1)) (OR (LT s0 1) (LT s498 1)) (OR (LT s0 1) (LT s499 1)) (OR (LT s0 1) (LT s500 1)) (OR (LT s0 1) (LT s501 1))), p2:(AND (GEQ s408 1) (GEQ s409 1) (GEQ s410 1) (GEQ s411 1) (GEQ s412 1) (GEQ s413 1) (GEQ s414 1) (GEQ s415 1) (GEQ s416 1) (GEQ s417 1) (GEQ s418 1) (GEQ s511 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-02 finished in 1524 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:52] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 06:15:52] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:52] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:15:53] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:53] [INFO ] Computed 340 place invariants in 27 ms
[2021-05-17 06:15:53] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 128 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-10-03 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s0 1) (LT s496 1)) (OR (LT s0 1) (LT s497 1)) (OR (LT s0 1) (LT s506 1)) (OR (LT s0 1) (LT s502 1)) (OR (LT s0 1) (LT s503 1)) (OR (LT s0 1) (LT s504 1)) (OR (LT s0 1) (LT s505 1)) (OR (LT s0 1) (LT s498 1)) (OR (LT s0 1) (LT s499 1)) (OR (LT s0 1) (LT s500 1)) (OR (LT s0 1) (LT s501 1))), p0:(AND (GEQ s509 1) (OR (LT s0 1) (LT s496 1)) (OR (LT s0 1) (LT s497 1)) (OR (LT s0 1) (LT s506 1)) (OR (LT s0 1) (LT s502 1)) (OR (LT s0 1) (LT s503 1)) (OR (LT s0 1) (LT s504 1)) (OR (LT s0 1) (LT s505 1)) (OR (LT s0 1) (LT s498 1)) (OR (LT s0 1) (LT s499 1)) (OR (LT s0 1) (LT s500 1)) (OR (LT s0 1) (LT s501 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-03 finished in 1410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 22 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:53] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:15:54] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:54] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 06:15:54] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:54] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 06:15:55] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-04 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:(AND (OR (LT s422 1) (LT s444 1)) (OR (LT s425 1) (LT s447 1)) (OR (LT s426 1) (LT s448 1)) (OR (LT s429 1) (LT s451 1)) (OR (LT s421 1) (LT s443 1)) (OR (LT s423 1) (LT s445 1)) (OR (LT s424 1) (LT s446 1)) (OR (LT s427 1) (LT s449 1)) (OR (LT s428 1) (LT s450 1)) (OR (LT s419 1) (LT s441 1)) (OR (LT s420 1) (LT s442 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 7 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-04 finished in 1366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 23 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 175
Applied a total of 2 rules in 37 ms. Remains 512 /513 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 06:15:55] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:15:55] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 06:15:55] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 06:15:56] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2021-05-17 06:15:56] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 06:15:56] [INFO ] Computed 340 place invariants in 24 ms
[2021-05-17 06:15:56] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/513 places, 175/176 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s422 1) (LT s444 1)) (OR (LT s425 1) (LT s447 1)) (OR (LT s426 1) (LT s448 1)) (OR (LT s429 1) (LT s451 1)) (OR (LT s421 1) (LT s443 1)) (OR (LT s423 1) (LT s445 1)) (OR (LT s424 1) (LT s446 1)) (OR (LT s427 1) (LT s449 1)) (OR (LT s428 1) (LT s450 1)) (OR (LT s419 1) (LT s441 1)) (OR (LT s420 1) (LT s442 1))), p1:(LT s508 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6921 reset in 298 ms.
Product exploration explored 100000 steps with 6920 reset in 238 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-COL-10-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-10-05 finished in 2197 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 22 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:57] [INFO ] Computed 340 place invariants in 15 ms
[2021-05-17 06:15:57] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:57] [INFO ] Computed 340 place invariants in 26 ms
[2021-05-17 06:15:58] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:15:58] [INFO ] Computed 340 place invariants in 32 ms
[2021-05-17 06:15:58] [INFO ] Dead Transitions using invariants and state equation in 264 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-06 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s376 1) (LT s464 1)) (OR (LT s380 1) (LT s468 1)) (OR (LT s384 1) (LT s472 1)) (OR (LT s385 1) (LT s473 1)) (OR (LT s378 1) (LT s466 1)) (OR (LT s382 1) (LT s470 1)) (OR (LT s375 1) (LT s463 1)) (OR (LT s377 1) (LT s465 1)) (OR (LT s379 1) (LT s467 1)) (OR (LT s381 1) (LT s469 1)) (OR (LT s383 1) (LT s471 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 6913 reset in 266 ms.
Product exploration explored 100000 steps with 6928 reset in 228 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6918 reset in 188 ms.
Product exploration explored 100000 steps with 6922 reset in 199 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 22 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 63 ms. Remains 513 /513 variables (removed 0) and now considering 177/176 (removed -1) transitions.
[2021-05-17 06:16:00] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 177 rows 513 cols
[2021-05-17 06:16:00] [INFO ] Computed 340 place invariants in 32 ms
[2021-05-17 06:16:00] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 177/176 transitions.
Product exploration explored 100000 steps with 6928 reset in 453 ms.
Product exploration explored 100000 steps with 6929 reset in 390 ms.
[2021-05-17 06:16:01] [INFO ] Flatten gal took : 35 ms
[2021-05-17 06:16:01] [INFO ] Flatten gal took : 31 ms
[2021-05-17 06:16:01] [INFO ] Time to serialize gal into /tmp/LTL15752491253819139806.gal : 10 ms
[2021-05-17 06:16:01] [INFO ] Time to serialize properties into /tmp/LTL15913029365334897014.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/LTL15752491253819139806.gal, -t, CGAL, -LTL, /tmp/LTL15913029365334897014.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/LTL15752491253819139806.gal -t CGAL -LTL /tmp/LTL15913029365334897014.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((((((((((((n5_1<1)||(s3_1<1))&&((n5_5<1)||(s3_5<1)))&&((n5_9<1)||(s3_9<1)))&&((n5_10<1)||(s3_10<1)))&&((n5_3<1)||(s3_3<1)))&&((n5_7<1)||(s3_7<1)))&&((n5_0<1)||(s3_0<1)))&&((n5_2<1)||(s3_2<1)))&&((n5_4<1)||(s3_4<1)))&&((n5_6<1)||(s3_6<1)))&&((n5_8<1)||(s3_8<1)))")))))
Formula 0 simplified : !XXG"((((((((((((n5_1<1)||(s3_1<1))&&((n5_5<1)||(s3_5<1)))&&((n5_9<1)||(s3_9<1)))&&((n5_10<1)||(s3_10<1)))&&((n5_3<1)||(s3_3<1)))&&((n5_7<1)||(s3_7<1)))&&((n5_0<1)||(s3_0<1)))&&((n5_2<1)||(s3_2<1)))&&((n5_4<1)||(s3_4<1)))&&((n5_6<1)||(s3_6<1)))&&((n5_8<1)||(s3_8<1)))"
Detected timeout of ITS tools.
[2021-05-17 06:16:16] [INFO ] Flatten gal took : 49 ms
[2021-05-17 06:16:16] [INFO ] Applying decomposition
[2021-05-17 06:16:16] [INFO ] Flatten gal took : 35 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/graph11818330063514907723.txt, -o, /tmp/graph11818330063514907723.bin, -w, /tmp/graph11818330063514907723.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/graph11818330063514907723.bin, -l, -1, -v, -w, /tmp/graph11818330063514907723.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:16:17] [INFO ] Decomposing Gal with order
[2021-05-17 06:16:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:16:17] [INFO ] Removed a total of 108 redundant transitions.
[2021-05-17 06:16:17] [INFO ] Flatten gal took : 90 ms
[2021-05-17 06:16:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 26 ms.
[2021-05-17 06:16:17] [INFO ] Time to serialize gal into /tmp/LTL9263648552562295013.gal : 11 ms
[2021-05-17 06:16:17] [INFO ] Time to serialize properties into /tmp/LTL16999273356821686882.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/LTL9263648552562295013.gal, -t, CGAL, -LTL, /tmp/LTL16999273356821686882.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/LTL9263648552562295013.gal -t CGAL -LTL /tmp/LTL16999273356821686882.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((((((((((((i12.u2.n5_1<1)||(i12.u2.s3_1<1))&&((i7.u10.n5_5<1)||(i7.u10.s3_5<1)))&&((i9.i0.u6.n5_9<1)||(i9.i0.u6.s3_9<1)))&&((i5.i0.u12.n5_10<1)||(i5.i0.u12.s3_10<1)))&&((i1.i0.u3.n5_3<1)||(i1.i0.u3.s3_3<1)))&&((i2.i0.u4.n5_7<1)||(i2.i0.u4.s3_7<1)))&&((i13.i1.u1.n5_0<1)||(i13.i1.u1.s3_0<1)))&&((i10.u46.n5_2<1)||(i10.u46.s3_2<1)))&&((i6.i0.u9.n5_4<1)||(i6.i0.u9.s3_4<1)))&&((i11.u11.n5_6<1)||(i11.u11.s3_6<1)))&&((i8.i1.u5.n5_8<1)||(i8.i1.u5.s3_8<1)))")))))
Formula 0 simplified : !XXG"((((((((((((i12.u2.n5_1<1)||(i12.u2.s3_1<1))&&((i7.u10.n5_5<1)||(i7.u10.s3_5<1)))&&((i9.i0.u6.n5_9<1)||(i9.i0.u6.s3_9<1)))&&((i5.i0.u12.n5_10<1)||(i5.i0.u12.s3_10<1)))&&((i1.i0.u3.n5_3<1)||(i1.i0.u3.s3_3<1)))&&((i2.i0.u4.n5_7<1)||(i2.i0.u4.s3_7<1)))&&((i13.i1.u1.n5_0<1)||(i13.i1.u1.s3_0<1)))&&((i10.u46.n5_2<1)||(i10.u46.s3_2<1)))&&((i6.i0.u9.n5_4<1)||(i6.i0.u9.s3_4<1)))&&((i11.u11.n5_6<1)||(i11.u11.s3_6<1)))&&((i8.i1.u5.n5_8<1)||(i8.i1.u5.s3_8<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11912143175919275429
[2021-05-17 06:16:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11912143175919275429
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/ltsmin11912143175919275429]
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/ltsmin11912143175919275429] 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/ltsmin11912143175919275429] 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 QuasiCertifProtocol-COL-10-06 finished in 35914 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 175
Applied a total of 2 rules in 77 ms. Remains 512 /513 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 06:16:33] [INFO ] Computed 340 place invariants in 22 ms
[2021-05-17 06:16:34] [INFO ] Implicit Places using invariants in 1301 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 06:16:34] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:16:35] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2021-05-17 06:16:35] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 175 rows 512 cols
[2021-05-17 06:16:35] [INFO ] Computed 340 place invariants in 15 ms
[2021-05-17 06:16:35] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/513 places, 175/176 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s509 1), p1:(LT s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13634 reset in 322 ms.
Product exploration explored 100000 steps with 13593 reset in 472 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13600 reset in 293 ms.
Product exploration explored 100000 steps with 13683 reset in 283 ms.
[2021-05-17 06:16:38] [INFO ] Flatten gal took : 24 ms
[2021-05-17 06:16:38] [INFO ] Flatten gal took : 22 ms
[2021-05-17 06:16:38] [INFO ] Time to serialize gal into /tmp/LTL11853772181232012128.gal : 3 ms
[2021-05-17 06:16:38] [INFO ] Time to serialize properties into /tmp/LTL326322321348669486.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/LTL11853772181232012128.gal, -t, CGAL, -LTL, /tmp/LTL326322321348669486.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/LTL11853772181232012128.gal -t CGAL -LTL /tmp/LTL326322321348669486.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(a2_0<1)"))&&(G(F("(Astart_0<1)")))))
Formula 0 simplified : !(F"(a2_0<1)" & GF"(Astart_0<1)")
Detected timeout of ITS tools.
[2021-05-17 06:16:53] [INFO ] Flatten gal took : 17 ms
[2021-05-17 06:16:53] [INFO ] Applying decomposition
[2021-05-17 06:16:53] [INFO ] Flatten gal took : 16 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/graph17166154264309884989.txt, -o, /tmp/graph17166154264309884989.bin, -w, /tmp/graph17166154264309884989.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/graph17166154264309884989.bin, -l, -1, -v, -w, /tmp/graph17166154264309884989.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:16:53] [INFO ] Decomposing Gal with order
[2021-05-17 06:16:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:16:53] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-17 06:16:53] [INFO ] Flatten gal took : 44 ms
[2021-05-17 06:16:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 13 ms.
[2021-05-17 06:16:53] [INFO ] Time to serialize gal into /tmp/LTL17354681466652223785.gal : 4 ms
[2021-05-17 06:16:53] [INFO ] Time to serialize properties into /tmp/LTL10388458602413832466.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/LTL17354681466652223785.gal, -t, CGAL, -LTL, /tmp/LTL10388458602413832466.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/LTL17354681466652223785.gal -t CGAL -LTL /tmp/LTL10388458602413832466.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i16.i0.u65.a2_0<1)"))&&(G(F("(i16.i0.u66.Astart_0<1)")))))
Formula 0 simplified : !(F"(i16.i0.u65.a2_0<1)" & GF"(i16.i0.u66.Astart_0<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11740450336811243857
[2021-05-17 06:17:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11740450336811243857
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/ltsmin11740450336811243857]
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/ltsmin11740450336811243857] 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/ltsmin11740450336811243857] 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 QuasiCertifProtocol-COL-10-07 finished in 36000 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||(F(!p1)&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:09] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:17:09] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:09] [INFO ] Computed 340 place invariants in 26 ms
[2021-05-17 06:17:10] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:10] [INFO ] Computed 340 place invariants in 27 ms
[2021-05-17 06:17:10] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-08 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s440 1)) (AND (GEQ s0 1) (GEQ s439 1)) (AND (GEQ s0 1) (GEQ s438 1)) (AND (GEQ s0 1) (GEQ s437 1)) (AND (GEQ s0 1) (GEQ s432 1)) (AND (GEQ s0 1) (GEQ s431 1)) (AND (GEQ s0 1) (GEQ s430 1)) (AND (GEQ s0 1) (GEQ s436 1)) (AND (GEQ s0 1) (GEQ s435 1)) (AND (GEQ s0 1) (GEQ s434 1)) (AND (GEQ s0 1) (GEQ s433 1))), p2:(LT s512 1), p1:(LT s508 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-08 finished in 1558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 132 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:10] [INFO ] Computed 340 place invariants in 24 ms
[2021-05-17 06:17:11] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:11] [INFO ] Computed 340 place invariants in 28 ms
[2021-05-17 06:17:11] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:11] [INFO ] Computed 340 place invariants in 33 ms
[2021-05-17 06:17:12] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s2 1) (LT s13 1) (LT s24 1) (LT s35 1) (LT s46 1) (LT s57 1) (LT s68 1) (LT s79 1) (LT s90 1) (LT s101 1) (LT s112 1) (LT s431 1)) (OR (LT s1 1) (LT s12 1) (LT s23 1) (LT s34 1) (LT s45 1) (LT s56 1) (LT s67 1) (LT s78 1) (LT s89 1) (LT s100 1) (LT s111 1) (LT s430 1)) (OR (LT s4 1) (LT s15 1) (LT s26 1) (LT s37 1) (LT s48 1) (LT s59 1) (LT s70 1) (LT s81 1) (LT s92 1) (LT s103 1) (LT s114 1) (LT s433 1)) (OR (LT s11 1) (LT s22 1) (LT s33 1) (LT s44 1) (LT s55 1) (LT s66 1) (LT s77 1) (LT s88 1) (LT s99 1) (LT s110 1) (LT s121 1) (LT s440 1)) (OR (LT s6 1) (LT s17 1) (LT s28 1) (LT s39 1) (LT s50 1) (LT s61 1) (LT s72 1) (LT s83 1) (LT s94 1) (LT s105 1) (LT s116 1) (LT s435 1)) (OR (LT s8 1) (LT s19 1) (LT s30 1) (LT s41 1) (LT s52 1) (LT s63 1) (LT s74 1) (LT s85 1) (LT s96 1) (LT s107 1) (LT s118 1) (LT s437 1)) (OR (LT s7 1) (LT s18 1) (LT s29 1) (LT s40 1) (LT s51 1) (LT s62 1) (LT s73 1) (LT s84 1) (LT s95 1) (LT s106 1) (LT s117 1) (LT s436 1)) (OR (LT s10 1) (LT s21 1) (LT s32 1) (LT s43 1) (LT s54 1) (LT s65 1) (LT s76 1) (LT s87 1) (LT s98 1) (LT s109 1) (LT s120 1) (LT s439 1)) (OR (LT s9 1) (LT s20 1) (LT s31 1) (LT s42 1) (LT s53 1) (LT s64 1) (LT s75 1) (LT s86 1) (LT s97 1) (LT s108 1) (LT s119 1) (LT s438 1)) (OR (LT s3 1) (LT s14 1) (LT s25 1) (LT s36 1) (LT s47 1) (LT s58 1) (LT s69 1) (LT s80 1) (LT s91 1) (LT s102 1) (LT s113 1) (LT s432 1)) (OR (LT s5 1) (LT s16 1) (LT s27 1) (LT s38 1) (LT s49 1) (LT s60 1) (LT s71 1) (LT s82 1) (LT s93 1) (LT s104 1) (LT s115 1) (LT s434 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 439 ms.
Product exploration explored 100000 steps with 33333 reset in 403 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-COL-10-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-10-09 finished in 2464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:13] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 06:17:13] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:13] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 06:17:14] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:14] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 06:17:14] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-10-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s512 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][false, false]]
Stuttering criterion allowed to conclude after 34 steps with 10 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-10 finished in 1388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p1)||p0)) U !p1))], workingDir=/home/mcc/execution]
Support contains 24 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 511 transition count 174
Applied a total of 3 rules in 50 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:17:14] [INFO ] Computed 340 place invariants in 14 ms
[2021-05-17 06:17:15] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:17:15] [INFO ] Computed 340 place invariants in 27 ms
[2021-05-17 06:17:16] [INFO ] Implicit Places using invariants and state equation in 575 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1176 ms to find 11 implicit places.
[2021-05-17 06:17:16] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 06:17:16] [INFO ] Computed 330 place invariants in 34 ms
[2021-05-17 06:17:16] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
Starting structural reductions, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 30 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2021-05-17 06:17:16] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 06:17:16] [INFO ] Computed 330 place invariants in 89 ms
[2021-05-17 06:17:16] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Finished structural reductions, in 2 iterations. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 137 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-10-11 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s451 1)) (OR (LT s0 1) (LT s447 1)) (OR (LT s0 1) (LT s448 1)) (OR (LT s0 1) (LT s449 1)) (OR (LT s0 1) (LT s450 1)) (OR (LT s0 1) (LT s443 1)) (OR (LT s0 1) (LT s444 1)) (OR (LT s0 1) (LT s445 1)) (OR (LT s0 1) (LT s446 1)) (OR (LT s0 1) (LT s441 1)) (OR (LT s0 1) (LT s442 1))), p0:(OR (LT s364 1) (LT s365 1) (LT s366 1) (LT s367 1) (LT s368 1) (LT s369 1) (LT s370 1) (LT s371 1) (LT s372 1) (LT s373 1) (LT s374 1) (LT s496 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 9311 reset in 511 ms.
Product exploration explored 100000 steps with 9350 reset in 377 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 174
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), p1, p0]
Stuttering acceptance computed with spot in 150 ms :[p1, (NOT p1), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 9410 reset in 297 ms.
Product exploration explored 100000 steps with 9438 reset in 328 ms.
[2021-05-17 06:17:19] [INFO ] Flatten gal took : 14 ms
[2021-05-17 06:17:19] [INFO ] Flatten gal took : 12 ms
[2021-05-17 06:17:19] [INFO ] Time to serialize gal into /tmp/LTL3615796727566658566.gal : 3 ms
[2021-05-17 06:17:19] [INFO ] Time to serialize properties into /tmp/LTL17047281494156724696.ltl : 18 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/LTL3615796727566658566.gal, -t, CGAL, -LTL, /tmp/LTL17047281494156724696.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/LTL3615796727566658566.gal -t CGAL -LTL /tmp/LTL17047281494156724696.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("((((((((((((n6_0<1)||(n6_1<1))||(n6_2<1))||(n6_3<1))||(n6_4<1))||(n6_5<1))||(n6_6<1))||(n6_7<1))||(n6_8<1))||(n6_9<1))||(n6_10<1))||(a5_0<1))")||(G("((((((((((((malicious_reservoir_0<1)||(s2_10<1))&&((malicious_reservoir_0<1)||(s2_6<1)))&&((malicious_reservoir_0<1)||(s2_7<1)))&&((malicious_reservoir_0<1)||(s2_8<1)))&&((malicious_reservoir_0<1)||(s2_9<1)))&&((malicious_reservoir_0<1)||(s2_2<1)))&&((malicious_reservoir_0<1)||(s2_3<1)))&&((malicious_reservoir_0<1)||(s2_4<1)))&&((malicious_reservoir_0<1)||(s2_5<1)))&&((malicious_reservoir_0<1)||(s2_0<1)))&&((malicious_reservoir_0<1)||(s2_1<1)))"))))U("((((((((((((malicious_reservoir_0>=1)&&(s2_10>=1))||((malicious_reservoir_0>=1)&&(s2_6>=1)))||((malicious_reservoir_0>=1)&&(s2_7>=1)))||((malicious_reservoir_0>=1)&&(s2_8>=1)))||((malicious_reservoir_0>=1)&&(s2_9>=1)))||((malicious_reservoir_0>=1)&&(s2_2>=1)))||((malicious_reservoir_0>=1)&&(s2_3>=1)))||((malicious_reservoir_0>=1)&&(s2_4>=1)))||((malicious_reservoir_0>=1)&&(s2_5>=1)))||((malicious_reservoir_0>=1)&&(s2_0>=1)))||((malicious_reservoir_0>=1)&&(s2_1>=1)))")))
Formula 0 simplified : !(G("((((((((((((n6_0<1)||(n6_1<1))||(n6_2<1))||(n6_3<1))||(n6_4<1))||(n6_5<1))||(n6_6<1))||(n6_7<1))||(n6_8<1))||(n6_9<1))||(n6_10<1))||(a5_0<1))" | G"((((((((((((malicious_reservoir_0<1)||(s2_10<1))&&((malicious_reservoir_0<1)||(s2_6<1)))&&((malicious_reservoir_0<1)||(s2_7<1)))&&((malicious_reservoir_0<1)||(s2_8<1)))&&((malicious_reservoir_0<1)||(s2_9<1)))&&((malicious_reservoir_0<1)||(s2_2<1)))&&((malicious_reservoir_0<1)||(s2_3<1)))&&((malicious_reservoir_0<1)||(s2_4<1)))&&((malicious_reservoir_0<1)||(s2_5<1)))&&((malicious_reservoir_0<1)||(s2_0<1)))&&((malicious_reservoir_0<1)||(s2_1<1)))") U "((((((((((((malicious_reservoir_0>=1)&&(s2_10>=1))||((malicious_reservoir_0>=1)&&(s2_6>=1)))||((malicious_reservoir_0>=1)&&(s2_7>=1)))||((malicious_reservoir_0>=1)&&(s2_8>=1)))||((malicious_reservoir_0>=1)&&(s2_9>=1)))||((malicious_reservoir_0>=1)&&(s2_2>=1)))||((malicious_reservoir_0>=1)&&(s2_3>=1)))||((malicious_reservoir_0>=1)&&(s2_4>=1)))||((malicious_reservoir_0>=1)&&(s2_5>=1)))||((malicious_reservoir_0>=1)&&(s2_0>=1)))||((malicious_reservoir_0>=1)&&(s2_1>=1)))")
Detected timeout of ITS tools.
[2021-05-17 06:17:34] [INFO ] Flatten gal took : 22 ms
[2021-05-17 06:17:34] [INFO ] Applying decomposition
[2021-05-17 06:17:34] [INFO ] Flatten gal took : 12 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/graph6076440518496487573.txt, -o, /tmp/graph6076440518496487573.bin, -w, /tmp/graph6076440518496487573.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/graph6076440518496487573.bin, -l, -1, -v, -w, /tmp/graph6076440518496487573.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:17:34] [INFO ] Decomposing Gal with order
[2021-05-17 06:17:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:17:34] [INFO ] Removed a total of 131 redundant transitions.
[2021-05-17 06:17:34] [INFO ] Flatten gal took : 28 ms
[2021-05-17 06:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 12 ms.
[2021-05-17 06:17:34] [INFO ] Time to serialize gal into /tmp/LTL2870618725317803845.gal : 4 ms
[2021-05-17 06:17:34] [INFO ] Time to serialize properties into /tmp/LTL15926843706236063768.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/LTL2870618725317803845.gal, -t, CGAL, -LTL, /tmp/LTL15926843706236063768.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/LTL2870618725317803845.gal -t CGAL -LTL /tmp/LTL15926843706236063768.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("((((((((((((i12.i1.u1.n6_0<1)||(i1.i0.u2.n6_1<1))||(i2.i0.u3.n6_2<1))||(i3.i0.u4.n6_3<1))||(i9.i1.u35.n6_4<1))||(i11.i1.u36.n6_5<1))||(i7.i0.u10.n6_6<1))||(i10.u11.n6_7<1))||(i4.i0.u5.n6_8<1))||(i14.i1.u6.n6_9<1))||(i8.i0.u12.n6_10<1))||(i12.i0.u56.a5_0<1))")||(G("((((((((((((u0.malicious_reservoir_0<1)||(i8.i1.u30.s2_10<1))&&((u0.malicious_reservoir_0<1)||(i7.i1.u33.s2_6<1)))&&((u0.malicious_reservoir_0<1)||(i10.u34.s2_7<1)))&&((u0.malicious_reservoir_0<1)||(i4.i1.u28.s2_8<1)))&&((u0.malicious_reservoir_0<1)||(i14.i0.u29.s2_9<1)))&&((u0.malicious_reservoir_0<1)||(i2.i1.u31.s2_2<1)))&&((u0.malicious_reservoir_0<1)||(i3.i1.u32.s2_3<1)))&&((u0.malicious_reservoir_0<1)||(i9.i0.u26.s2_4<1)))&&((u0.malicious_reservoir_0<1)||(i11.i0.u27.s2_5<1)))&&((u0.malicious_reservoir_0<1)||(i12.i0.u24.s2_0<1)))&&((u0.malicious_reservoir_0<1)||(i1.i1.u25.s2_1<1)))"))))U("((((((((((((u0.malicious_reservoir_0>=1)&&(i8.i1.u30.s2_10>=1))||((u0.malicious_reservoir_0>=1)&&(i7.i1.u33.s2_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i10.u34.s2_7>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u28.s2_8>=1)))||((u0.malicious_reservoir_0>=1)&&(i14.i0.u29.s2_9>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u31.s2_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u32.s2_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i9.i0.u26.s2_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i11.i0.u27.s2_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i12.i0.u24.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i1.i1.u25.s2_1>=1)))")))
Formula 0 simplified : !(G("((((((((((((i12.i1.u1.n6_0<1)||(i1.i0.u2.n6_1<1))||(i2.i0.u3.n6_2<1))||(i3.i0.u4.n6_3<1))||(i9.i1.u35.n6_4<1))||(i11.i1.u36.n6_5<1))||(i7.i0.u10.n6_6<1))||(i10.u11.n6_7<1))||(i4.i0.u5.n6_8<1))||(i14.i1.u6.n6_9<1))||(i8.i0.u12.n6_10<1))||(i12.i0.u56.a5_0<1))" | G"((((((((((((u0.malicious_reservoir_0<1)||(i8.i1.u30.s2_10<1))&&((u0.malicious_reservoir_0<1)||(i7.i1.u33.s2_6<1)))&&((u0.malicious_reservoir_0<1)||(i10.u34.s2_7<1)))&&((u0.malicious_reservoir_0<1)||(i4.i1.u28.s2_8<1)))&&((u0.malicious_reservoir_0<1)||(i14.i0.u29.s2_9<1)))&&((u0.malicious_reservoir_0<1)||(i2.i1.u31.s2_2<1)))&&((u0.malicious_reservoir_0<1)||(i3.i1.u32.s2_3<1)))&&((u0.malicious_reservoir_0<1)||(i9.i0.u26.s2_4<1)))&&((u0.malicious_reservoir_0<1)||(i11.i0.u27.s2_5<1)))&&((u0.malicious_reservoir_0<1)||(i12.i0.u24.s2_0<1)))&&((u0.malicious_reservoir_0<1)||(i1.i1.u25.s2_1<1)))") U "((((((((((((u0.malicious_reservoir_0>=1)&&(i8.i1.u30.s2_10>=1))||((u0.malicious_reservoir_0>=1)&&(i7.i1.u33.s2_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i10.u34.s2_7>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u28.s2_8>=1)))||((u0.malicious_reservoir_0>=1)&&(i14.i0.u29.s2_9>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u31.s2_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u32.s2_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i9.i0.u26.s2_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i11.i0.u27.s2_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i12.i0.u24.s2_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i1.i1.u25.s2_1>=1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7841678984919532491
[2021-05-17 06:17:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7841678984919532491
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/ltsmin7841678984919532491]
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/ltsmin7841678984919532491] 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/ltsmin7841678984919532491] 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 QuasiCertifProtocol-COL-10-11 finished in 35575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 34 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:50] [INFO ] Computed 340 place invariants in 10 ms
[2021-05-17 06:17:50] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:50] [INFO ] Computed 340 place invariants in 29 ms
[2021-05-17 06:17:51] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 513 cols
[2021-05-17 06:17:51] [INFO ] Computed 340 place invariants in 29 ms
[2021-05-17 06:17:51] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (OR (LT s422 1) (LT s444 1)) (OR (LT s425 1) (LT s447 1)) (OR (LT s426 1) (LT s448 1)) (OR (LT s429 1) (LT s451 1)) (OR (LT s421 1) (LT s443 1)) (OR (LT s423 1) (LT s445 1)) (OR (LT s424 1) (LT s446 1)) (OR (LT s427 1) (LT s449 1)) (OR (LT s428 1) (LT s450 1)) (OR (LT s419 1) (LT s441 1)) (OR (LT s420 1) (LT s442 1)) (OR (LT s0 1) (LT s463 1)) (OR (LT s0 1) (LT s464 1)) (OR (LT s0 1) (LT s465 1)) (OR (LT s0 1) (LT s470 1)) (OR (LT s0 1) (LT s471 1)) (OR (LT s0 1) (LT s472 1)) (OR (LT s0 1) (LT s473 1)) (OR (LT s0 1) (LT s466 1)) (OR (LT s0 1) (LT s467 1)) (OR (LT s0 1) (LT s468 1)) (OR (LT s0 1) (LT s469 1))), p0:(AND (OR (LT s0 1) (LT s463 1)) (OR (LT s0 1) (LT s464 1)) (OR (LT s0 1) (LT s465 1)) (OR (LT s0 1) (LT s470 1)) (OR (LT s0 1) (LT s471 1)) (OR (LT s0 1) (LT s472 1)) (OR (LT s0 1) (LT s473 1)) (OR (LT s0 1) (LT s466 1)) (OR (LT s0 1) (LT s467 1)) (OR (LT s0 1) (LT s468 1)) (OR (LT s0 1) (LT s469 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19826 reset in 358 ms.
Product exploration explored 100000 steps with 19980 reset in 515 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), p1, p0]
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19971 reset in 496 ms.
Product exploration explored 100000 steps with 19952 reset in 492 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 34 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 513 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 178/176 (removed -2) transitions.
[2021-05-17 06:17:54] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 178 rows 513 cols
[2021-05-17 06:17:54] [INFO ] Computed 340 place invariants in 53 ms
[2021-05-17 06:17:55] [INFO ] Dead Transitions using invariants and state equation in 301 ms returned []
Finished structural reductions, in 1 iterations. Remains : 513/513 places, 178/176 transitions.
Product exploration explored 100000 steps with 20017 reset in 1074 ms.
Product exploration explored 100000 steps with 19921 reset in 849 ms.
[2021-05-17 06:17:57] [INFO ] Flatten gal took : 13 ms
[2021-05-17 06:17:57] [INFO ] Flatten gal took : 10 ms
[2021-05-17 06:17:57] [INFO ] Time to serialize gal into /tmp/LTL13305885625700955227.gal : 2 ms
[2021-05-17 06:17:57] [INFO ] Time to serialize properties into /tmp/LTL18223263685026343304.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/LTL13305885625700955227.gal, -t, CGAL, -LTL, /tmp/LTL18223263685026343304.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/LTL13305885625700955227.gal -t CGAL -LTL /tmp/LTL18223263685026343304.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("((((((((((((malicious_reservoir_0<1)||(s3_0<1))&&((malicious_reservoir_0<1)||(s3_1<1)))&&((malicious_reservoir_0<1)||(s3_2<1)))&&((malicious_reservoir_0<1)||(s3_7<1)))&&((malicious_reservoir_0<1)||(s3_8<1)))&&((malicious_reservoir_0<1)||(s3_9<1)))&&((malicious_reservoir_0<1)||(s3_10<1)))&&((malicious_reservoir_0<1)||(s3_3<1)))&&((malicious_reservoir_0<1)||(s3_4<1)))&&((malicious_reservoir_0<1)||(s3_5<1)))&&((malicious_reservoir_0<1)||(s3_6<1)))")U((G("((((((((((((malicious_reservoir_0<1)||(s3_0<1))&&((malicious_reservoir_0<1)||(s3_1<1)))&&((malicious_reservoir_0<1)||(s3_2<1)))&&((malicious_reservoir_0<1)||(s3_7<1)))&&((malicious_reservoir_0<1)||(s3_8<1)))&&((malicious_reservoir_0<1)||(s3_9<1)))&&((malicious_reservoir_0<1)||(s3_10<1)))&&((malicious_reservoir_0<1)||(s3_3<1)))&&((malicious_reservoir_0<1)||(s3_4<1)))&&((malicious_reservoir_0<1)||(s3_5<1)))&&((malicious_reservoir_0<1)||(s3_6<1)))"))||("(((((((((((((((((((((((n1_3<1)||(Sstart_3<1))&&((n1_6<1)||(Sstart_6<1)))&&((n1_7<1)||(Sstart_7<1)))&&((n1_10<1)||(Sstart_10<1)))&&((n1_2<1)||(Sstart_2<1)))&&((n1_4<1)||(Sstart_4<1)))&&((n1_5<1)||(Sstart_5<1)))&&((n1_8<1)||(Sstart_8<1)))&&((n1_9<1)||(Sstart_9<1)))&&((n1_0<1)||(Sstart_0<1)))&&((n1_1<1)||(Sstart_1<1)))&&((malicious_reservoir_0<1)||(s3_0<1)))&&((malicious_reservoir_0<1)||(s3_1<1)))&&((malicious_reservoir_0<1)||(s3_2<1)))&&((malicious_reservoir_0<1)||(s3_7<1)))&&((malicious_reservoir_0<1)||(s3_8<1)))&&((malicious_reservoir_0<1)||(s3_9<1)))&&((malicious_reservoir_0<1)||(s3_10<1)))&&((malicious_reservoir_0<1)||(s3_3<1)))&&((malicious_reservoir_0<1)||(s3_4<1)))&&((malicious_reservoir_0<1)||(s3_5<1)))&&((malicious_reservoir_0<1)||(s3_6<1)))"))))))
Formula 0 simplified : !XX("((((((((((((malicious_reservoir_0<1)||(s3_0<1))&&((malicious_reservoir_0<1)||(s3_1<1)))&&((malicious_reservoir_0<1)||(s3_2<1)))&&((malicious_reservoir_0<1)||(s3_7<1)))&&((malicious_reservoir_0<1)||(s3_8<1)))&&((malicious_reservoir_0<1)||(s3_9<1)))&&((malicious_reservoir_0<1)||(s3_10<1)))&&((malicious_reservoir_0<1)||(s3_3<1)))&&((malicious_reservoir_0<1)||(s3_4<1)))&&((malicious_reservoir_0<1)||(s3_5<1)))&&((malicious_reservoir_0<1)||(s3_6<1)))" U ("(((((((((((((((((((((((n1_3<1)||(Sstart_3<1))&&((n1_6<1)||(Sstart_6<1)))&&((n1_7<1)||(Sstart_7<1)))&&((n1_10<1)||(Sstart_10<1)))&&((n1_2<1)||(Sstart_2<1)))&&((n1_4<1)||(Sstart_4<1)))&&((n1_5<1)||(Sstart_5<1)))&&((n1_8<1)||(Sstart_8<1)))&&((n1_9<1)||(Sstart_9<1)))&&((n1_0<1)||(Sstart_0<1)))&&((n1_1<1)||(Sstart_1<1)))&&((malicious_reservoir_0<1)||(s3_0<1)))&&((malicious_reservoir_0<1)||(s3_1<1)))&&((malicious_reservoir_0<1)||(s3_2<1)))&&((malicious_reservoir_0<1)||(s3_7<1)))&&((malicious_reservoir_0<1)||(s3_8<1)))&&((malicious_reservoir_0<1)||(s3_9<1)))&&((malicious_reservoir_0<1)||(s3_10<1)))&&((malicious_reservoir_0<1)||(s3_3<1)))&&((malicious_reservoir_0<1)||(s3_4<1)))&&((malicious_reservoir_0<1)||(s3_5<1)))&&((malicious_reservoir_0<1)||(s3_6<1)))" | G"((((((((((((malicious_reservoir_0<1)||(s3_0<1))&&((malicious_reservoir_0<1)||(s3_1<1)))&&((malicious_reservoir_0<1)||(s3_2<1)))&&((malicious_reservoir_0<1)||(s3_7<1)))&&((malicious_reservoir_0<1)||(s3_8<1)))&&((malicious_reservoir_0<1)||(s3_9<1)))&&((malicious_reservoir_0<1)||(s3_10<1)))&&((malicious_reservoir_0<1)||(s3_3<1)))&&((malicious_reservoir_0<1)||(s3_4<1)))&&((malicious_reservoir_0<1)||(s3_5<1)))&&((malicious_reservoir_0<1)||(s3_6<1)))"))
Detected timeout of ITS tools.
[2021-05-17 06:18:12] [INFO ] Flatten gal took : 47 ms
[2021-05-17 06:18:12] [INFO ] Applying decomposition
[2021-05-17 06:18:12] [INFO ] Flatten gal took : 24 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/graph4601970942366794594.txt, -o, /tmp/graph4601970942366794594.bin, -w, /tmp/graph4601970942366794594.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/graph4601970942366794594.bin, -l, -1, -v, -w, /tmp/graph4601970942366794594.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:18:12] [INFO ] Decomposing Gal with order
[2021-05-17 06:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:18:12] [INFO ] Removed a total of 109 redundant transitions.
[2021-05-17 06:18:12] [INFO ] Flatten gal took : 29 ms
[2021-05-17 06:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2021-05-17 06:18:12] [INFO ] Time to serialize gal into /tmp/LTL16777561433074161059.gal : 14 ms
[2021-05-17 06:18:12] [INFO ] Time to serialize properties into /tmp/LTL17026125280198553786.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/LTL16777561433074161059.gal, -t, CGAL, -LTL, /tmp/LTL17026125280198553786.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/LTL16777561433074161059.gal -t CGAL -LTL /tmp/LTL17026125280198553786.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("((((((((((((u0.malicious_reservoir_0<1)||(i4.i0.u10.s3_0<1))&&((u0.malicious_reservoir_0<1)||(i6.i0.u4.s3_1<1)))&&((u0.malicious_reservoir_0<1)||(i10.u11.s3_2<1)))&&((u0.malicious_reservoir_0<1)||(i16.i1.u8.s3_7<1)))&&((u0.malicious_reservoir_0<1)||(i9.u9.s3_8<1)))&&((u0.malicious_reservoir_0<1)||(i12.u14.s3_9<1)))&&((u0.malicious_reservoir_0<1)||(i13.i0.u15.s3_10<1)))&&((u0.malicious_reservoir_0<1)||(i5.i0.u5.s3_3<1)))&&((u0.malicious_reservoir_0<1)||(i8.i1.u6.s3_4<1)))&&((u0.malicious_reservoir_0<1)||(i7.u23.s3_5<1)))&&((u0.malicious_reservoir_0<1)||(i11.i1.u13.s3_6<1)))")U((G("((((((((((((u0.malicious_reservoir_0<1)||(i4.i0.u10.s3_0<1))&&((u0.malicious_reservoir_0<1)||(i6.i0.u4.s3_1<1)))&&((u0.malicious_reservoir_0<1)||(i10.u11.s3_2<1)))&&((u0.malicious_reservoir_0<1)||(i16.i1.u8.s3_7<1)))&&((u0.malicious_reservoir_0<1)||(i9.u9.s3_8<1)))&&((u0.malicious_reservoir_0<1)||(i12.u14.s3_9<1)))&&((u0.malicious_reservoir_0<1)||(i13.i0.u15.s3_10<1)))&&((u0.malicious_reservoir_0<1)||(i5.i0.u5.s3_3<1)))&&((u0.malicious_reservoir_0<1)||(i8.i1.u6.s3_4<1)))&&((u0.malicious_reservoir_0<1)||(i7.u23.s3_5<1)))&&((u0.malicious_reservoir_0<1)||(i11.i1.u13.s3_6<1)))"))||("(((((((((((((((((((((((i5.i1.u36.n1_3<1)||(i5.i1.u42.Sstart_3<1))&&((i11.i0.u38.n1_6<1)||(i11.i0.u45.Sstart_6<1)))&&((i16.i0.u32.n1_7<1)||(i16.i0.u32.Sstart_7<1)))&&((i13.i1.u40.n1_10<1)||(i13.i1.u47.Sstart_10<1)))&&((i10.u41.n1_2<1)||(i10.u30.Sstart_2<1)))&&((i8.i0.u37.n1_4<1)||(i8.i0.u43.Sstart_4<1)))&&((i7.u31.n1_5<1)||(i7.u44.Sstart_5<1)))&&((i9.u39.n1_8<1)||(i9.u33.Sstart_8<1)))&&((i12.u46.n1_9<1)||(i12.u34.Sstart_9<1)))&&((i4.i1.u48.n1_0<1)||(i4.i1.u48.Sstart_0<1)))&&((i6.i1.u35.n1_1<1)||(i6.i1.u29.Sstart_1<1)))&&((u0.malicious_reservoir_0<1)||(i4.i0.u10.s3_0<1)))&&((u0.malicious_reservoir_0<1)||(i6.i0.u4.s3_1<1)))&&((u0.malicious_reservoir_0<1)||(i10.u11.s3_2<1)))&&((u0.malicious_reservoir_0<1)||(i16.i1.u8.s3_7<1)))&&((u0.malicious_reservoir_0<1)||(i9.u9.s3_8<1)))&&((u0.malicious_reservoir_0<1)||(i12.u14.s3_9<1)))&&((u0.malicious_reservoir_0<1)||(i13.i0.u15.s3_10<1)))&&((u0.malicious_reservoir_0<1)||(i5.i0.u5.s3_3<1)))&&((u0.malicious_reservoir_0<1)||(i8.i1.u6.s3_4<1)))&&((u0.malicious_reservoir_0<1)||(i7.u23.s3_5<1)))&&((u0.malicious_reservoir_0<1)||(i11.i1.u13.s3_6<1)))"))))))
Formula 0 simplified : !XX("((((((((((((u0.malicious_reservoir_0<1)||(i4.i0.u10.s3_0<1))&&((u0.malicious_reservoir_0<1)||(i6.i0.u4.s3_1<1)))&&((u0.malicious_reservoir_0<1)||(i10.u11.s3_2<1)))&&((u0.malicious_reservoir_0<1)||(i16.i1.u8.s3_7<1)))&&((u0.malicious_reservoir_0<1)||(i9.u9.s3_8<1)))&&((u0.malicious_reservoir_0<1)||(i12.u14.s3_9<1)))&&((u0.malicious_reservoir_0<1)||(i13.i0.u15.s3_10<1)))&&((u0.malicious_reservoir_0<1)||(i5.i0.u5.s3_3<1)))&&((u0.malicious_reservoir_0<1)||(i8.i1.u6.s3_4<1)))&&((u0.malicious_reservoir_0<1)||(i7.u23.s3_5<1)))&&((u0.malicious_reservoir_0<1)||(i11.i1.u13.s3_6<1)))" U ("(((((((((((((((((((((((i5.i1.u36.n1_3<1)||(i5.i1.u42.Sstart_3<1))&&((i11.i0.u38.n1_6<1)||(i11.i0.u45.Sstart_6<1)))&&((i16.i0.u32.n1_7<1)||(i16.i0.u32.Sstart_7<1)))&&((i13.i1.u40.n1_10<1)||(i13.i1.u47.Sstart_10<1)))&&((i10.u41.n1_2<1)||(i10.u30.Sstart_2<1)))&&((i8.i0.u37.n1_4<1)||(i8.i0.u43.Sstart_4<1)))&&((i7.u31.n1_5<1)||(i7.u44.Sstart_5<1)))&&((i9.u39.n1_8<1)||(i9.u33.Sstart_8<1)))&&((i12.u46.n1_9<1)||(i12.u34.Sstart_9<1)))&&((i4.i1.u48.n1_0<1)||(i4.i1.u48.Sstart_0<1)))&&((i6.i1.u35.n1_1<1)||(i6.i1.u29.Sstart_1<1)))&&((u0.malicious_reservoir_0<1)||(i4.i0.u10.s3_0<1)))&&((u0.malicious_reservoir_0<1)||(i6.i0.u4.s3_1<1)))&&((u0.malicious_reservoir_0<1)||(i10.u11.s3_2<1)))&&((u0.malicious_reservoir_0<1)||(i16.i1.u8.s3_7<1)))&&((u0.malicious_reservoir_0<1)||(i9.u9.s3_8<1)))&&((u0.malicious_reservoir_0<1)||(i12.u14.s3_9<1)))&&((u0.malicious_reservoir_0<1)||(i13.i0.u15.s3_10<1)))&&((u0.malicious_reservoir_0<1)||(i5.i0.u5.s3_3<1)))&&((u0.malicious_reservoir_0<1)||(i8.i1.u6.s3_4<1)))&&((u0.malicious_reservoir_0<1)||(i7.u23.s3_5<1)))&&((u0.malicious_reservoir_0<1)||(i11.i1.u13.s3_6<1)))" | G"((((((((((((u0.malicious_reservoir_0<1)||(i4.i0.u10.s3_0<1))&&((u0.malicious_reservoir_0<1)||(i6.i0.u4.s3_1<1)))&&((u0.malicious_reservoir_0<1)||(i10.u11.s3_2<1)))&&((u0.malicious_reservoir_0<1)||(i16.i1.u8.s3_7<1)))&&((u0.malicious_reservoir_0<1)||(i9.u9.s3_8<1)))&&((u0.malicious_reservoir_0<1)||(i12.u14.s3_9<1)))&&((u0.malicious_reservoir_0<1)||(i13.i0.u15.s3_10<1)))&&((u0.malicious_reservoir_0<1)||(i5.i0.u5.s3_3<1)))&&((u0.malicious_reservoir_0<1)||(i8.i1.u6.s3_4<1)))&&((u0.malicious_reservoir_0<1)||(i7.u23.s3_5<1)))&&((u0.malicious_reservoir_0<1)||(i11.i1.u13.s3_6<1)))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11188407255455659982
[2021-05-17 06:18:27] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11188407255455659982
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/ltsmin11188407255455659982]
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/ltsmin11188407255455659982] 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/ltsmin11188407255455659982] 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 QuasiCertifProtocol-COL-10-12 finished in 38284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 22 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 511 transition count 174
Applied a total of 3 rules in 85 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:28] [INFO ] Computed 340 place invariants in 12 ms
[2021-05-17 06:18:29] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:29] [INFO ] Computed 340 place invariants in 27 ms
[2021-05-17 06:18:29] [INFO ] Implicit Places using invariants and state equation in 694 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1010 ms to find 11 implicit places.
[2021-05-17 06:18:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 06:18:29] [INFO ] Computed 330 place invariants in 26 ms
[2021-05-17 06:18:30] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Starting structural reductions, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2021-05-17 06:18:30] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 06:18:30] [INFO ] Computed 330 place invariants in 35 ms
[2021-05-17 06:18:30] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 2 iterations. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-10-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s397 1) (GEQ s441 1)) (AND (GEQ s400 1) (GEQ s444 1)) (AND (GEQ s401 1) (GEQ s445 1)) (AND (GEQ s404 1) (GEQ s448 1)) (AND (GEQ s405 1) (GEQ s449 1)) (AND (GEQ s398 1) (GEQ s442 1)) (AND (GEQ s399 1) (GEQ s443 1)) (AND (GEQ s402 1) (GEQ s446 1)) (AND (GEQ s403 1) (GEQ s447 1)) (AND (GEQ s406 1) (GEQ s450 1)) (AND (GEQ s407 1) (GEQ s451 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]]
Product exploration explored 100000 steps with 6776 reset in 271 ms.
Product exploration explored 100000 steps with 6782 reset in 179 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 174
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA QuasiCertifProtocol-COL-10-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-10-13 finished in 2484 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 144 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 511 transition count 174
Applied a total of 4 rules in 32 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:31] [INFO ] Computed 340 place invariants in 19 ms
[2021-05-17 06:18:31] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:31] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 06:18:32] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2021-05-17 06:18:32] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:32] [INFO ] Computed 340 place invariants in 16 ms
[2021-05-17 06:18:32] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 511/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-10-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s13 1) (LT s24 1) (LT s35 1) (LT s46 1) (LT s57 1) (LT s68 1) (LT s79 1) (LT s90 1) (LT s101 1) (LT s112 1) (LT s431 1)) (OR (LT s1 1) (LT s12 1) (LT s23 1) (LT s34 1) (LT s45 1) (LT s56 1) (LT s67 1) (LT s78 1) (LT s89 1) (LT s100 1) (LT s111 1) (LT s430 1)) (OR (LT s4 1) (LT s15 1) (LT s26 1) (LT s37 1) (LT s48 1) (LT s59 1) (LT s70 1) (LT s81 1) (LT s92 1) (LT s103 1) (LT s114 1) (LT s433 1)) (OR (LT s11 1) (LT s22 1) (LT s33 1) (LT s44 1) (LT s55 1) (LT s66 1) (LT s77 1) (LT s88 1) (LT s99 1) (LT s110 1) (LT s121 1) (LT s440 1)) (OR (LT s6 1) (LT s17 1) (LT s28 1) (LT s39 1) (LT s50 1) (LT s61 1) (LT s72 1) (LT s83 1) (LT s94 1) (LT s105 1) (LT s116 1) (LT s435 1)) (OR (LT s8 1) (LT s19 1) (LT s30 1) (LT s41 1) (LT s52 1) (LT s63 1) (LT s74 1) (LT s85 1) (LT s96 1) (LT s107 1) (LT s118 1) (LT s437 1)) (OR (LT s7 1) (LT s18 1) (LT s29 1) (LT s40 1) (LT s51 1) (LT s62 1) (LT s73 1) (LT s84 1) (LT s95 1) (LT s106 1) (LT s117 1) (LT s436 1)) (OR (LT s10 1) (LT s21 1) (LT s32 1) (LT s43 1) (LT s54 1) (LT s65 1) (LT s76 1) (LT s87 1) (LT s98 1) (LT s109 1) (LT s120 1) (LT s439 1)) (OR (LT s9 1) (LT s20 1) (LT s31 1) (LT s42 1) (LT s53 1) (LT s64 1) (LT s75 1) (LT s86 1) (LT s97 1) (LT s108 1) (LT s119 1) (LT s438 1)) (OR (LT s3 1) (LT s14 1) (LT s25 1) (LT s36 1) (LT s47 1) (LT s58 1) (LT s69 1) (LT s80 1) (LT s91 1) (LT s102 1) (LT s113 1) (LT s432 1)) (OR (LT s5 1) (LT s16 1) (LT s27 1) (LT s38 1) (LT s49 1) (LT s60 1) (LT s71 1) (LT s82 1) (LT s93 1) (LT s104 1) (LT s115 1) (LT s434 1))), p1:(AND (GEQ s408 1) (GEQ s409 1) (GEQ s410 1) (GEQ s411 1) (GEQ s412 1) (GEQ s413 1) (GEQ s414 1) (GEQ s415 1) (GEQ s416 1) (GEQ s417 1) (GEQ s418 1) (GEQ s509 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-14 finished in 1483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 513/513 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 174
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 511 transition count 174
Applied a total of 3 rules in 71 ms. Remains 511 /513 variables (removed 2) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:32] [INFO ] Computed 340 place invariants in 26 ms
[2021-05-17 06:18:33] [INFO ] Implicit Places using invariants in 563 ms returned []
// Phase 1: matrix 174 rows 511 cols
[2021-05-17 06:18:33] [INFO ] Computed 340 place invariants in 25 ms
[2021-05-17 06:18:33] [INFO ] Implicit Places using invariants and state equation in 617 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1183 ms to find 11 implicit places.
[2021-05-17 06:18:33] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 06:18:33] [INFO ] Computed 330 place invariants in 26 ms
[2021-05-17 06:18:34] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Starting structural reductions, iteration 1 : 500/513 places, 174/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2021-05-17 06:18:34] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 174 rows 500 cols
[2021-05-17 06:18:34] [INFO ] Computed 330 place invariants in 20 ms
[2021-05-17 06:18:34] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 2 iterations. Remains : 500/513 places, 174/176 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s386 1) (LT s387 1) (LT s388 1) (LT s389 1) (LT s390 1) (LT s391 1) (LT s392 1) (LT s393 1) (LT s394 1) (LT s395 1) (LT s396 1) (LT s497 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-10-15 finished in 1793 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9558431351711315037
[2021-05-17 06:18:34] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2021-05-17 06:18:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:18:34] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2021-05-17 06:18:34] [INFO ] Applying decomposition
[2021-05-17 06:18:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:18:34] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2021-05-17 06:18:34] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:18:34] [INFO ] Flatten gal took : 31 ms
[2021-05-17 06:18:34] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9558431351711315037
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/ltsmin9558431351711315037]
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/graph2831548881520367258.txt, -o, /tmp/graph2831548881520367258.bin, -w, /tmp/graph2831548881520367258.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/graph2831548881520367258.bin, -l, -1, -v, -w, /tmp/graph2831548881520367258.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:18:34] [INFO ] Decomposing Gal with order
[2021-05-17 06:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:18:34] [INFO ] Removed a total of 108 redundant transitions.
[2021-05-17 06:18:34] [INFO ] Flatten gal took : 36 ms
[2021-05-17 06:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 9 ms.
[2021-05-17 06:18:34] [INFO ] Time to serialize gal into /tmp/LTLFireability17947015065673043444.gal : 4 ms
[2021-05-17 06:18:34] [INFO ] Time to serialize properties into /tmp/LTLFireability9393701598744548785.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/LTLFireability17947015065673043444.gal, -t, CGAL, -LTL, /tmp/LTLFireability9393701598744548785.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/LTLFireability17947015065673043444.gal -t CGAL -LTL /tmp/LTLFireability9393701598744548785.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(G("((((((((((((i1.i0.u1.n5_1<1)||(i1.i0.u1.s3_1<1))&&((i10.i0.u9.n5_5<1)||(i10.i0.u9.s3_5<1)))&&((i6.i0.u3.n5_9<1)||(i6.i0.u3.s3_9<1)))&&((i7.u4.n5_10<1)||(i7.u4.s3_10<1)))&&((i8.u7.n5_3<1)||(i8.u7.s3_3<1)))&&((i11.u11.n5_7<1)||(i11.u11.s3_7<1)))&&((i5.i0.u5.n5_0<1)||(i5.i0.u5.s3_0<1)))&&((i2.i0.u6.n5_2<1)||(i2.i0.u6.s3_2<1)))&&((i9.u8.n5_4<1)||(i9.u8.s3_4<1)))&&((i4.i0.u2.n5_6<1)||(i4.i0.u2.s3_6<1)))&&((i3.i0.u12.n5_8<1)||(i3.i0.u12.s3_8<1)))")))))
Formula 0 simplified : !XXG"((((((((((((i1.i0.u1.n5_1<1)||(i1.i0.u1.s3_1<1))&&((i10.i0.u9.n5_5<1)||(i10.i0.u9.s3_5<1)))&&((i6.i0.u3.n5_9<1)||(i6.i0.u3.s3_9<1)))&&((i7.u4.n5_10<1)||(i7.u4.s3_10<1)))&&((i8.u7.n5_3<1)||(i8.u7.s3_3<1)))&&((i11.u11.n5_7<1)||(i11.u11.s3_7<1)))&&((i5.i0.u5.n5_0<1)||(i5.i0.u5.s3_0<1)))&&((i2.i0.u6.n5_2<1)||(i2.i0.u6.s3_2<1)))&&((i9.u8.n5_4<1)||(i9.u8.s3_4<1)))&&((i4.i0.u2.n5_6<1)||(i4.i0.u2.s3_6<1)))&&((i3.i0.u12.n5_8<1)||(i3.i0.u12.s3_8<1)))"
Compilation finished in 1830 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9558431351711315037]
Link finished in 90 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, X(X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
LTSmin run took 170815 ms.
FORMULA QuasiCertifProtocol-COL-10-06 FALSE 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, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
WARNING : LTSmin timed out (>225 s) on command 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, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
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, -p, --pins-guards, --when, --ltl, ([](([]((LTLAPp4==true))||(LTLAPp3==true))) U !(LTLAPp4==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
LTSmin run took 538 ms.
FORMULA QuasiCertifProtocol-COL-10-11 FALSE TECHNIQUES PARTIAL_ORDER 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(X(((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
LTSmin run took 82116 ms.
FORMULA QuasiCertifProtocol-COL-10-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 1800 s
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, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
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.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.134: Initializing POR dependencies: labels 183, guards 176
pins2lts-mc-linux64( 6/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.216: LTL layer: formula: (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true))))
pins2lts-mc-linux64( 0/ 8), 0.217: "(<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.217: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.238: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.260: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.268: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.319: There are 185 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.319: State length is 514, there are 183 groups
pins2lts-mc-linux64( 0/ 8), 0.319: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.319: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.319: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.319: Visible groups: 4 / 183, labels: 2 / 185
pins2lts-mc-linux64( 0/ 8), 0.319: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.319: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.478: [Blue] ~8 levels ~960 states ~2280 transitions
pins2lts-mc-linux64( 6/ 8), 0.520: [Blue] ~16 levels ~1920 states ~7136 transitions
pins2lts-mc-linux64( 6/ 8), 0.547: [Blue] ~17 levels ~3840 states ~13088 transitions
pins2lts-mc-linux64( 6/ 8), 0.595: [Blue] ~17 levels ~7680 states ~29696 transitions
pins2lts-mc-linux64( 6/ 8), 0.677: [Blue] ~17 levels ~15360 states ~61240 transitions
pins2lts-mc-linux64( 6/ 8), 0.858: [Blue] ~18 levels ~30720 states ~126048 transitions
pins2lts-mc-linux64( 3/ 8), 1.431: [Blue] ~16 levels ~61440 states ~281440 transitions
pins2lts-mc-linux64( 3/ 8), 2.341: [Blue] ~17 levels ~122880 states ~583080 transitions
pins2lts-mc-linux64( 3/ 8), 4.559: [Blue] ~17 levels ~245760 states ~1296504 transitions
pins2lts-mc-linux64( 0/ 8), 8.957: [Blue] ~18 levels ~491520 states ~2875872 transitions
pins2lts-mc-linux64( 3/ 8), 18.173: [Blue] ~18 levels ~983040 states ~5807624 transitions
pins2lts-mc-linux64( 3/ 8), 40.151: [Blue] ~18 levels ~1966080 states ~13187824 transitions
pins2lts-mc-linux64( 2/ 8), 88.347: [Blue] ~19 levels ~3932160 states ~28028880 transitions
pins2lts-mc-linux64( 5/ 8), 186.873: [Blue] ~32 levels ~7864320 states ~56342536 transitions
pins2lts-mc-linux64( 6/ 8), 333.760: [Blue] ~51 levels ~15728640 states ~97141336 transitions
pins2lts-mc-linux64( 6/ 8), 602.760: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 602.793:
pins2lts-mc-linux64( 0/ 8), 602.793: Explored 27336494 states 169481227 transitions, fanout: 6.200
pins2lts-mc-linux64( 0/ 8), 602.793: Total exploration time 602.460 sec (602.430 sec minimum, 602.444 sec on average)
pins2lts-mc-linux64( 0/ 8), 602.793: States per second: 45375, Transitions per second: 281315
pins2lts-mc-linux64( 0/ 8), 602.793:
pins2lts-mc-linux64( 0/ 8), 602.793: State space has 27240608 states, 2971 are accepting
pins2lts-mc-linux64( 0/ 8), 602.793: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 602.794: blue states: 27336494 (100.35%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 602.794: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 602.794: all-red states: 2971 (0.01%), bogus 14 (0.00%)
pins2lts-mc-linux64( 0/ 8), 602.794:
pins2lts-mc-linux64( 0/ 8), 602.794: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 602.794:
pins2lts-mc-linux64( 0/ 8), 602.794: Queue width: 8B, total height: 418, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 602.794: Tree memory: 463.8MB, 17.9 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 602.794: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 602.794: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 602.794: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 602.794: Est. total memory use: 463.8MB (~1024.0MB 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, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
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, -p, --pins-guards, --when, --ltl, (<>(!(LTLAPp1==true))&&[](<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9558431351711315037]
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:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 06:39:32] [INFO ] Applying decomposition
[2021-05-17 06:39:33] [INFO ] Flatten gal took : 28 ms
[2021-05-17 06:39:33] [INFO ] Decomposing Gal with order
[2021-05-17 06:39:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:39:33] [INFO ] Removed a total of 98 redundant transitions.
[2021-05-17 06:39:33] [INFO ] Flatten gal took : 49 ms
[2021-05-17 06:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 7 ms.
[2021-05-17 06:39:33] [INFO ] Time to serialize gal into /tmp/LTLFireability14576690056375531289.gal : 4 ms
[2021-05-17 06:39:33] [INFO ] Time to serialize properties into /tmp/LTLFireability5195813793298515864.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/LTLFireability14576690056375531289.gal, -t, CGAL, -LTL, /tmp/LTLFireability5195813793298515864.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/LTLFireability14576690056375531289.gal -t CGAL -LTL /tmp/LTLFireability5195813793298515864.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(a2.a2_0<1)"))&&(G(F("(Astart.Astart_0<1)")))))
Formula 0 simplified : !(F"(a2.a2_0<1)" & GF"(Astart.Astart_0<1)")
Detected timeout of ITS tools.
[2021-05-17 07:00:32] [INFO ] Flatten gal took : 105 ms
[2021-05-17 07:00:32] [INFO ] Input system was already deterministic with 176 transitions.
[2021-05-17 07:00:32] [INFO ] Transformed 513 places.
[2021-05-17 07:00:32] [INFO ] Transformed 176 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 07:00:32] [INFO ] Time to serialize gal into /tmp/LTLFireability8551138208123020196.gal : 2 ms
[2021-05-17 07:00:32] [INFO ] Time to serialize properties into /tmp/LTLFireability5433717530933686773.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/LTLFireability8551138208123020196.gal, -t, CGAL, -LTL, /tmp/LTLFireability5433717530933686773.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/LTLFireability8551138208123020196.gal -t CGAL -LTL /tmp/LTLFireability5433717530933686773.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 : !(((F("(a2_0<1)"))&&(G(F("(Astart_0<1)")))))
Formula 0 simplified : !(F"(a2_0<1)" & GF"(Astart_0<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="QuasiCertifProtocol-COL-10"
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 QuasiCertifProtocol-COL-10, 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-162089415100029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 ;