fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415100037
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for QuasiCertifProtocol-COL-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16242.731 3600000.00 3851189.00 208385.50 FTFTFTT?FFFFTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 15K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 93K 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-18-00
FORMULA_NAME QuasiCertifProtocol-COL-18-01
FORMULA_NAME QuasiCertifProtocol-COL-18-02
FORMULA_NAME QuasiCertifProtocol-COL-18-03
FORMULA_NAME QuasiCertifProtocol-COL-18-04
FORMULA_NAME QuasiCertifProtocol-COL-18-05
FORMULA_NAME QuasiCertifProtocol-COL-18-06
FORMULA_NAME QuasiCertifProtocol-COL-18-07
FORMULA_NAME QuasiCertifProtocol-COL-18-08
FORMULA_NAME QuasiCertifProtocol-COL-18-09
FORMULA_NAME QuasiCertifProtocol-COL-18-10
FORMULA_NAME QuasiCertifProtocol-COL-18-11
FORMULA_NAME QuasiCertifProtocol-COL-18-12
FORMULA_NAME QuasiCertifProtocol-COL-18-13
FORMULA_NAME QuasiCertifProtocol-COL-18-14
FORMULA_NAME QuasiCertifProtocol-COL-18-15

=== Now, execution of the tool begins

BK_START 1621232147231

Running Version 0
[2021-05-17 06:15:48] [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:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:15:49] [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:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 06:15:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 610 ms
[2021-05-17 06:15:49] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:15:49] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions in 4 ms.
[2021-05-17 06:15:49] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_12662457050931806606.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:49] [INFO ] Flatten gal took : 19 ms
[2021-05-17 06:15:49] [INFO ] Flatten gal took : 6 ms
[2021-05-17 06:15:49] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions in 19 ms.
[2021-05-17 06:15:49] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_11840699892778552638.dot
[2021-05-17 06:15:49] [INFO ] Initial state test concluded for 2 properties.
FORMULA QuasiCertifProtocol-COL-18-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 577 out of 1398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 82 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2021-05-17 06:15:50] [INFO ] Computed 1062 place invariants in 64 ms
[2021-05-17 06:15:51] [INFO ] Implicit Places using invariants in 1087 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2021-05-17 06:15:51] [INFO ] Computed 1062 place invariants in 42 ms
[2021-05-17 06:15:52] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2454 ms to find 19 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:15:52] [INFO ] Computed 1044 place invariants in 109 ms
[2021-05-17 06:15:52] [INFO ] Dead Transitions using invariants and state equation in 531 ms returned []
Starting structural reductions, iteration 1 : 1337/1398 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:15:53] [INFO ] Computed 1044 place invariants in 139 ms
[2021-05-17 06:15:53] [INFO ] Dead Transitions using invariants and state equation in 742 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1337/1398 places, 296/296 transitions.
[2021-05-17 06:15:53] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 06:15:53] [INFO ] Flatten gal took : 104 ms
FORMULA QuasiCertifProtocol-COL-18-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:15:54] [INFO ] Flatten gal took : 73 ms
[2021-05-17 06:15:54] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 100000 steps, including 4417 resets, run finished after 781 ms. (steps per millisecond=128 ) properties (out of 18) seen :6
Running SMT prover for 12 properties.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:15:55] [INFO ] Computed 1044 place invariants in 149 ms
[2021-05-17 06:15:55] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 227 ms returned sat
[2021-05-17 06:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:55] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2021-05-17 06:15:56] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 26 ms.
[2021-05-17 06:15:56] [INFO ] Added : 41 causal constraints over 9 iterations in 747 ms. Result :sat
[2021-05-17 06:15:57] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 211 ms returned sat
[2021-05-17 06:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:57] [INFO ] [Real]Absence check using state equation in 370 ms returned unsat
[2021-05-17 06:15:58] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 312 ms returned sat
[2021-05-17 06:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:15:58] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2021-05-17 06:15:59] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 53 ms.
[2021-05-17 06:15:59] [INFO ] Added : 60 causal constraints over 12 iterations in 650 ms. Result :sat
[2021-05-17 06:16:00] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 186 ms returned sat
[2021-05-17 06:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:00] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-17 06:16:00] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 32 ms.
[2021-05-17 06:16:01] [INFO ] Added : 21 causal constraints over 5 iterations in 337 ms. Result :sat
[2021-05-17 06:16:01] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 328 ms returned sat
[2021-05-17 06:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:02] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2021-05-17 06:16:02] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 42 ms.
[2021-05-17 06:16:02] [INFO ] Added : 20 causal constraints over 4 iterations in 279 ms. Result :sat
[2021-05-17 06:16:03] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 221 ms returned sat
[2021-05-17 06:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:03] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2021-05-17 06:16:03] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2021-05-17 06:16:03] [INFO ] Added : 41 causal constraints over 9 iterations in 322 ms. Result :sat
[2021-05-17 06:16:04] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 166 ms returned sat
[2021-05-17 06:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:04] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2021-05-17 06:16:04] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2021-05-17 06:16:05] [INFO ] Added : 80 causal constraints over 16 iterations in 771 ms. Result :sat
[2021-05-17 06:16:05] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 200 ms returned sat
[2021-05-17 06:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:06] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-17 06:16:06] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 06:16:06] [INFO ] Added : 21 causal constraints over 5 iterations in 223 ms. Result :sat
[2021-05-17 06:16:06] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 272 ms returned sat
[2021-05-17 06:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:07] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2021-05-17 06:16:07] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2021-05-17 06:16:08] [INFO ] Added : 97 causal constraints over 20 iterations in 836 ms. Result :sat
[2021-05-17 06:16:08] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 188 ms returned sat
[2021-05-17 06:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:09] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2021-05-17 06:16:09] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 26 ms.
[2021-05-17 06:16:09] [INFO ] Added : 79 causal constraints over 16 iterations in 681 ms. Result :sat
[2021-05-17 06:16:10] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 207 ms returned sat
[2021-05-17 06:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:10] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-17 06:16:10] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 37 ms.
[2021-05-17 06:16:10] [INFO ] Added : 20 causal constraints over 4 iterations in 277 ms. Result :sat
[2021-05-17 06:16:11] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 180 ms returned sat
[2021-05-17 06:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:16:11] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-17 06:16:11] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2021-05-17 06:16:11] [INFO ] Added : 40 causal constraints over 8 iterations in 290 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-17 06:16:11] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-COL-18-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 21 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 111 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:16:12] [INFO ] Computed 1044 place invariants in 123 ms
[2021-05-17 06:16:13] [INFO ] Implicit Places using invariants in 1293 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:16:13] [INFO ] Computed 1044 place invariants in 77 ms
[2021-05-17 06:16:15] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:16:15] [INFO ] Computed 1044 place invariants in 66 ms
[2021-05-17 06:16:16] [INFO ] Dead Transitions using invariants and state equation in 569 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(GEQ s1331 1), p1:(OR (AND (GEQ s0 1) (GEQ s1233 1)) (AND (GEQ s0 1) (GEQ s1232 1)) (AND (GEQ s0 1) (GEQ s1231 1)) (AND (GEQ s0 1) (GEQ s1230 1)) (AND (GEQ s0 1) (GEQ s1229 1)) (AND (GEQ s0 1) (GEQ s1228 1)) (AND (GEQ s0 1) (GEQ s1227 1)) (AND (GEQ s0 1) (GEQ s1226 1)) (AND (GEQ s0 1) (GEQ s1235 1)) (AND (GEQ s0 1) (GEQ s1234 1)) (AND (GEQ s0 1) (GEQ s1217 1)) (AND (GEQ s0 1) (GEQ s1225 1)) (AND (GEQ s0 1) (GEQ s1224 1)) (AND (GEQ s0 1) (GEQ s1223 1)) (AND (GEQ s0 1) (GEQ s1222 1)) (AND (GEQ s0 1) (GEQ s1221 1)) (AND (GEQ s0 1) (GEQ s1220 1)) (AND (GEQ s0 1) (GEQ s1219 1)) (AND (GEQ s0 1) (GEQ s1218 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 544 ms.
Product exploration explored 100000 steps with 33333 reset in 454 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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 (NOT p1))), (NOT p0), p1]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 544 ms.
Product exploration explored 100000 steps with 33333 reset in 501 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 21 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1337 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 241 ms. Remains 1337 /1337 variables (removed 0) and now considering 297/296 (removed -1) transitions.
[2021-05-17 06:16:19] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 297 rows 1337 cols
[2021-05-17 06:16:19] [INFO ] Computed 1044 place invariants in 132 ms
[2021-05-17 06:16:20] [INFO ] Dead Transitions using invariants and state equation in 669 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 297/296 transitions.
Product exploration explored 100000 steps with 33333 reset in 1894 ms.
Product exploration explored 100000 steps with 33333 reset in 2462 ms.
[2021-05-17 06:16:24] [INFO ] Flatten gal took : 44 ms
[2021-05-17 06:16:24] [INFO ] Flatten gal took : 41 ms
[2021-05-17 06:16:24] [INFO ] Time to serialize gal into /tmp/LTL7270373953207380142.gal : 13 ms
[2021-05-17 06:16:24] [INFO ] Time to serialize properties into /tmp/LTL13323317006488129866.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/LTL7270373953207380142.gal, -t, CGAL, -LTL, /tmp/LTL13323317006488129866.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/LTL7270373953207380142.gal -t CGAL -LTL /tmp/LTL13323317006488129866.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(a5_0>=1)")U(X("((((((((((((((((((((malicious_reservoir_0>=1)&&(Sstart_16>=1))||((malicious_reservoir_0>=1)&&(Sstart_15>=1)))||((malicious_reservoir_0>=1)&&(Sstart_14>=1)))||((malicious_reservoir_0>=1)&&(Sstart_13>=1)))||((malicious_reservoir_0>=1)&&(Sstart_12>=1)))||((malicious_reservoir_0>=1)&&(Sstart_11>=1)))||((malicious_reservoir_0>=1)&&(Sstart_10>=1)))||((malicious_reservoir_0>=1)&&(Sstart_9>=1)))||((malicious_reservoir_0>=1)&&(Sstart_18>=1)))||((malicious_reservoir_0>=1)&&(Sstart_17>=1)))||((malicious_reservoir_0>=1)&&(Sstart_0>=1)))||((malicious_reservoir_0>=1)&&(Sstart_8>=1)))||((malicious_reservoir_0>=1)&&(Sstart_7>=1)))||((malicious_reservoir_0>=1)&&(Sstart_6>=1)))||((malicious_reservoir_0>=1)&&(Sstart_5>=1)))||((malicious_reservoir_0>=1)&&(Sstart_4>=1)))||((malicious_reservoir_0>=1)&&(Sstart_3>=1)))||((malicious_reservoir_0>=1)&&(Sstart_2>=1)))||((malicious_reservoir_0>=1)&&(Sstart_1>=1)))")))))
Formula 0 simplified : !X("(a5_0>=1)" U X"((((((((((((((((((((malicious_reservoir_0>=1)&&(Sstart_16>=1))||((malicious_reservoir_0>=1)&&(Sstart_15>=1)))||((malicious_reservoir_0>=1)&&(Sstart_14>=1)))||((malicious_reservoir_0>=1)&&(Sstart_13>=1)))||((malicious_reservoir_0>=1)&&(Sstart_12>=1)))||((malicious_reservoir_0>=1)&&(Sstart_11>=1)))||((malicious_reservoir_0>=1)&&(Sstart_10>=1)))||((malicious_reservoir_0>=1)&&(Sstart_9>=1)))||((malicious_reservoir_0>=1)&&(Sstart_18>=1)))||((malicious_reservoir_0>=1)&&(Sstart_17>=1)))||((malicious_reservoir_0>=1)&&(Sstart_0>=1)))||((malicious_reservoir_0>=1)&&(Sstart_8>=1)))||((malicious_reservoir_0>=1)&&(Sstart_7>=1)))||((malicious_reservoir_0>=1)&&(Sstart_6>=1)))||((malicious_reservoir_0>=1)&&(Sstart_5>=1)))||((malicious_reservoir_0>=1)&&(Sstart_4>=1)))||((malicious_reservoir_0>=1)&&(Sstart_3>=1)))||((malicious_reservoir_0>=1)&&(Sstart_2>=1)))||((malicious_reservoir_0>=1)&&(Sstart_1>=1)))")
Detected timeout of ITS tools.
[2021-05-17 06:16:40] [INFO ] Flatten gal took : 77 ms
[2021-05-17 06:16:40] [INFO ] Applying decomposition
[2021-05-17 06:16:40] [INFO ] Flatten gal took : 52 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/graph7751874395965353935.txt, -o, /tmp/graph7751874395965353935.bin, -w, /tmp/graph7751874395965353935.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/graph7751874395965353935.bin, -l, -1, -v, -w, /tmp/graph7751874395965353935.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:16:40] [INFO ] Decomposing Gal with order
[2021-05-17 06:16:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:16:40] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-17 06:16:40] [INFO ] Flatten gal took : 157 ms
[2021-05-17 06:16:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 47 ms.
[2021-05-17 06:16:40] [INFO ] Time to serialize gal into /tmp/LTL8491126742634053078.gal : 14 ms
[2021-05-17 06:16:40] [INFO ] Time to serialize properties into /tmp/LTL5525190454735224310.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/LTL8491126742634053078.gal, -t, CGAL, -LTL, /tmp/LTL5525190454735224310.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/LTL8491126742634053078.gal -t CGAL -LTL /tmp/LTL5525190454735224310.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i13.u107.a5_0>=1)")U(X("((((((((((((((((((((u0.malicious_reservoir_0>=1)&&(i12.i1.u58.Sstart_16>=1))||((u0.malicious_reservoir_0>=1)&&(i17.i1.u68.Sstart_15>=1)))||((u0.malicious_reservoir_0>=1)&&(i27.i0.u67.Sstart_14>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u72.Sstart_13>=1)))||((u0.malicious_reservoir_0>=1)&&(i16.i1.u66.Sstart_12>=1)))||((u0.malicious_reservoir_0>=1)&&(i10.u50.Sstart_11>=1)))||((u0.malicious_reservoir_0>=1)&&(i15.u65.Sstart_10>=1)))||((u0.malicious_reservoir_0>=1)&&(i9.u49.Sstart_9>=1)))||((u0.malicious_reservoir_0>=1)&&(i11.u54.Sstart_18>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u73.Sstart_17>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u59.Sstart_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u48.Sstart_8>=1)))||((u0.malicious_reservoir_0>=1)&&(i18.u64.Sstart_7>=1)))||((u0.malicious_reservoir_0>=1)&&(i14.i0.u63.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i1.u62.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i13.u61.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u46.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i20.i0.u60.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.i1.u45.Sstart_1>=1)))")))))
Formula 0 simplified : !X("(i13.u107.a5_0>=1)" U X"((((((((((((((((((((u0.malicious_reservoir_0>=1)&&(i12.i1.u58.Sstart_16>=1))||((u0.malicious_reservoir_0>=1)&&(i17.i1.u68.Sstart_15>=1)))||((u0.malicious_reservoir_0>=1)&&(i27.i0.u67.Sstart_14>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u72.Sstart_13>=1)))||((u0.malicious_reservoir_0>=1)&&(i16.i1.u66.Sstart_12>=1)))||((u0.malicious_reservoir_0>=1)&&(i10.u50.Sstart_11>=1)))||((u0.malicious_reservoir_0>=1)&&(i15.u65.Sstart_10>=1)))||((u0.malicious_reservoir_0>=1)&&(i9.u49.Sstart_9>=1)))||((u0.malicious_reservoir_0>=1)&&(i11.u54.Sstart_18>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u73.Sstart_17>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u59.Sstart_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u48.Sstart_8>=1)))||((u0.malicious_reservoir_0>=1)&&(i18.u64.Sstart_7>=1)))||((u0.malicious_reservoir_0>=1)&&(i14.i0.u63.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i7.i1.u62.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i13.u61.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i6.i1.u46.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i20.i0.u60.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.i1.u45.Sstart_1>=1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2845832843273619803
[2021-05-17 06:16:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2845832843273619803
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/ltsmin2845832843273619803]
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/ltsmin2845832843273619803] 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/ltsmin2845832843273619803] 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-18-03 finished in 44803 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 78 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 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 1336 transition count 295
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 1336 transition count 295
Applied a total of 3 rules in 332 ms. Remains 1336 /1337 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 06:16:57] [INFO ] Computed 1044 place invariants in 74 ms
[2021-05-17 06:16:58] [INFO ] Implicit Places using invariants in 1454 ms returned []
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 06:16:58] [INFO ] Computed 1044 place invariants in 80 ms
[2021-05-17 06:17:00] [INFO ] Implicit Places using invariants and state equation in 2119 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
[2021-05-17 06:17:00] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 06:17:00] [INFO ] Computed 1044 place invariants in 71 ms
[2021-05-17 06:17:01] [INFO ] Dead Transitions using invariants and state equation in 609 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1336/1337 places, 295/296 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s1290 1)) (OR (LT s0 1) (LT s1291 1)) (OR (LT s0 1) (LT s1292 1)) (OR (LT s0 1) (LT s1282 1)) (OR (LT s0 1) (LT s1283 1)) (OR (LT s0 1) (LT s1284 1)) (OR (LT s0 1) (LT s1285 1)) (OR (LT s0 1) (LT s1286 1)) (OR (LT s0 1) (LT s1287 1)) (OR (LT s0 1) (LT s1288 1)) (OR (LT s0 1) (LT s1289 1)) (OR (LT s0 1) (LT s1274 1)) (OR (LT s0 1) (LT s1275 1)) (OR (LT s0 1) (LT s1276 1)) (OR (LT s0 1) (LT s1277 1)) (OR (LT s0 1) (LT s1278 1)) (OR (LT s0 1) (LT s1279 1)) (OR (LT s0 1) (LT s1280 1)) (OR (LT s0 1) (LT s1281 1))), p0:(AND (OR (LT s1192 1) (LT s1230 1)) (OR (LT s1184 1) (LT s1222 1)) (OR (LT s1189 1) (LT s1227 1)) (OR (LT s1191 1) (LT s1229 1)) (OR (LT s1193 1) (LT s1231 1)) (OR (LT s1195 1) (LT s1233 1)) (OR (LT s1197 1) (LT s1235 1)) (OR (LT s1179 1) (LT s1217 1)) (OR (LT s1181 1) (LT s1219 1)) (OR (LT s1183 1) (LT s1221 1)) (OR (LT s1185 1) (LT s1223 1)) (OR (LT s1187 1) (LT s1225 1)) (OR (LT s1196 1) (LT s1234 1)) (OR (LT s1180 1) (LT s1218 1)) (OR (LT s1188 1) (LT s1226 1)) (OR (LT s1190 1) (LT s1228 1)) (OR (LT s1194 1) (LT s1232 1)) (OR (LT s1182 1) (LT s1220 1)) (OR (LT s1186 1) (LT s1224 1)) (OR (LT s1122 1) (LT s1123 1) (LT s1124 1) (LT s1125 1) (LT s1126 1) (LT s1127 1) (LT s1128 1) (LT s1129 1) (LT s1130 1) (LT s1131 1) (LT s1132 1) (LT s1133 1) (LT s1134 1) (LT s1135 1) (LT s1136 1) (LT s1137 1) (LT s1138 1) (LT s1139 1) (LT s1140 1) (LT s1332 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4420 reset in 501 ms.
Product exploration explored 100000 steps with 4421 reset in 545 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 295
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]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA QuasiCertifProtocol-COL-18-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-18-05 finished in 6054 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 39 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:02] [INFO ] Computed 1044 place invariants in 139 ms
[2021-05-17 06:17:04] [INFO ] Implicit Places using invariants in 1426 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:04] [INFO ] Computed 1044 place invariants in 74 ms
[2021-05-17 06:17:06] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned []
Implicit Place search using SMT with State Equation took 3869 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:06] [INFO ] Computed 1044 place invariants in 55 ms
[2021-05-17 06:17:07] [INFO ] Dead Transitions using invariants and state equation in 462 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (LT s1157 1) (LT s1252 1)) (OR (LT s1141 1) (LT s1236 1)) (OR (LT s1144 1) (LT s1239 1)) (OR (LT s1149 1) (LT s1244 1)) (OR (LT s1152 1) (LT s1247 1)) (OR (LT s1154 1) (LT s1249 1)) (OR (LT s1142 1) (LT s1237 1)) (OR (LT s1146 1) (LT s1241 1)) (OR (LT s1150 1) (LT s1245 1)) (OR (LT s1153 1) (LT s1248 1)) (OR (LT s1145 1) (LT s1240 1)) (OR (LT s1148 1) (LT s1243 1)) (OR (LT s1156 1) (LT s1251 1)) (OR (LT s1158 1) (LT s1253 1)) (OR (LT s1155 1) (LT s1250 1)) (OR (LT s1159 1) (LT s1254 1)) (OR (LT s1143 1) (LT s1238 1)) (OR (LT s1147 1) (LT s1242 1)) (OR (LT s1151 1) (LT s1246 1))), p0:(LT s1336 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 691 ms.
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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, (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 897 ms.
Product exploration explored 100000 steps with 50000 reset in 656 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 39 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1337 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 146 ms. Remains 1337 /1337 variables (removed 0) and now considering 297/296 (removed -1) transitions.
[2021-05-17 06:17:11] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 297 rows 1337 cols
[2021-05-17 06:17:11] [INFO ] Computed 1044 place invariants in 118 ms
[2021-05-17 06:17:11] [INFO ] Dead Transitions using invariants and state equation in 707 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 297/296 transitions.
Product exploration explored 100000 steps with 50000 reset in 3246 ms.
Product exploration explored 100000 steps with 50000 reset in 2942 ms.
[2021-05-17 06:17:18] [INFO ] Flatten gal took : 55 ms
[2021-05-17 06:17:18] [INFO ] Flatten gal took : 43 ms
[2021-05-17 06:17:18] [INFO ] Time to serialize gal into /tmp/LTL5113909805270658035.gal : 5 ms
[2021-05-17 06:17:18] [INFO ] Time to serialize properties into /tmp/LTL4449637253760663295.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/LTL5113909805270658035.gal, -t, CGAL, -LTL, /tmp/LTL4449637253760663295.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/LTL5113909805270658035.gal -t CGAL -LTL /tmp/LTL4449637253760663295.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(Astart_0<1)"))||(X("((((((((((((((((((((n3_16<1)||(s2_16<1))&&((n3_0<1)||(s2_0<1)))&&((n3_3<1)||(s2_3<1)))&&((n3_8<1)||(s2_8<1)))&&((n3_11<1)||(s2_11<1)))&&((n3_13<1)||(s2_13<1)))&&((n3_1<1)||(s2_1<1)))&&((n3_5<1)||(s2_5<1)))&&((n3_9<1)||(s2_9<1)))&&((n3_12<1)||(s2_12<1)))&&((n3_4<1)||(s2_4<1)))&&((n3_7<1)||(s2_7<1)))&&((n3_15<1)||(s2_15<1)))&&((n3_17<1)||(s2_17<1)))&&((n3_14<1)||(s2_14<1)))&&((n3_18<1)||(s2_18<1)))&&((n3_2<1)||(s2_2<1)))&&((n3_6<1)||(s2_6<1)))&&((n3_10<1)||(s2_10<1)))"))))
Formula 0 simplified : !(G"(Astart_0<1)" | X"((((((((((((((((((((n3_16<1)||(s2_16<1))&&((n3_0<1)||(s2_0<1)))&&((n3_3<1)||(s2_3<1)))&&((n3_8<1)||(s2_8<1)))&&((n3_11<1)||(s2_11<1)))&&((n3_13<1)||(s2_13<1)))&&((n3_1<1)||(s2_1<1)))&&((n3_5<1)||(s2_5<1)))&&((n3_9<1)||(s2_9<1)))&&((n3_12<1)||(s2_12<1)))&&((n3_4<1)||(s2_4<1)))&&((n3_7<1)||(s2_7<1)))&&((n3_15<1)||(s2_15<1)))&&((n3_17<1)||(s2_17<1)))&&((n3_14<1)||(s2_14<1)))&&((n3_18<1)||(s2_18<1)))&&((n3_2<1)||(s2_2<1)))&&((n3_6<1)||(s2_6<1)))&&((n3_10<1)||(s2_10<1)))")
Detected timeout of ITS tools.
[2021-05-17 06:17:33] [INFO ] Flatten gal took : 62 ms
[2021-05-17 06:17:33] [INFO ] Applying decomposition
[2021-05-17 06:17:33] [INFO ] Flatten gal took : 46 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/graph10754948804868502708.txt, -o, /tmp/graph10754948804868502708.bin, -w, /tmp/graph10754948804868502708.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/graph10754948804868502708.bin, -l, -1, -v, -w, /tmp/graph10754948804868502708.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:17:33] [INFO ] Decomposing Gal with order
[2021-05-17 06:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:17:33] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-17 06:17:33] [INFO ] Flatten gal took : 105 ms
[2021-05-17 06:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 26 ms.
[2021-05-17 06:17:33] [INFO ] Time to serialize gal into /tmp/LTL5635085205232728135.gal : 9 ms
[2021-05-17 06:17:33] [INFO ] Time to serialize properties into /tmp/LTL11390889515437893983.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/LTL5635085205232728135.gal, -t, CGAL, -LTL, /tmp/LTL11390889515437893983.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/LTL5635085205232728135.gal -t CGAL -LTL /tmp/LTL11390889515437893983.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i6.i1.u56.Astart_0<1)"))||(X("((((((((((((((((((((i10.i1.u41.n3_16<1)||(i10.i1.u69.s2_16<1))&&((i2.i1.u24.n3_0<1)||(i2.i1.u60.s2_0<1)))&&((i15.i1.u33.n3_3<1)||(i15.i1.u55.s2_3<1)))&&((i21.i1.u36.n3_8<1)||(i21.i1.u74.s2_8<1)))&&((i12.i1.u28.n3_11<1)||(i12.i1.u65.s2_11<1)))&&((i6.i1.u29.n3_13<1)||(i6.i1.u66.s2_13<1)))&&((i13.u32.n3_1<1)||(i13.u44.s2_1<1)))&&((i20.u35.n3_5<1)||(i20.u72.s2_5<1)))&&((i4.i1.u37.n3_9<1)||(i4.i1.u75.s2_9<1)))&&((i14.i0.u39.n3_12<1)||(i14.i0.u76.s2_12<1)))&&((i6.i0.u34.n3_4<1)||(i6.i0.u47.s2_4<1)))&&((i3.i1.u27.n3_7<1)||(i3.i1.u73.s2_7<1)))&&((i17.u30.n3_15<1)||(i17.u68.s2_15<1)))&&((i18.i1.u31.n3_17<1)||(i18.i1.u70.s2_17<1)))&&((i5.i1.u40.n3_14<1)||(i5.i1.u67.s2_14<1)))&&((i11.u42.n3_18<1)||(i11.u54.s2_18<1)))&&((i19.i1.u25.n3_2<1)||(i19.i1.u71.s2_2<1)))&&((i16.u26.n3_6<1)||(i16.u57.s2_6<1)))&&((i7.i1.u38.n3_10<1)||(i7.i1.u58.s2_10<1)))"))))
Formula 0 simplified : !(G"(i6.i1.u56.Astart_0<1)" | X"((((((((((((((((((((i10.i1.u41.n3_16<1)||(i10.i1.u69.s2_16<1))&&((i2.i1.u24.n3_0<1)||(i2.i1.u60.s2_0<1)))&&((i15.i1.u33.n3_3<1)||(i15.i1.u55.s2_3<1)))&&((i21.i1.u36.n3_8<1)||(i21.i1.u74.s2_8<1)))&&((i12.i1.u28.n3_11<1)||(i12.i1.u65.s2_11<1)))&&((i6.i1.u29.n3_13<1)||(i6.i1.u66.s2_13<1)))&&((i13.u32.n3_1<1)||(i13.u44.s2_1<1)))&&((i20.u35.n3_5<1)||(i20.u72.s2_5<1)))&&((i4.i1.u37.n3_9<1)||(i4.i1.u75.s2_9<1)))&&((i14.i0.u39.n3_12<1)||(i14.i0.u76.s2_12<1)))&&((i6.i0.u34.n3_4<1)||(i6.i0.u47.s2_4<1)))&&((i3.i1.u27.n3_7<1)||(i3.i1.u73.s2_7<1)))&&((i17.u30.n3_15<1)||(i17.u68.s2_15<1)))&&((i18.i1.u31.n3_17<1)||(i18.i1.u70.s2_17<1)))&&((i5.i1.u40.n3_14<1)||(i5.i1.u67.s2_14<1)))&&((i11.u42.n3_18<1)||(i11.u54.s2_18<1)))&&((i19.i1.u25.n3_2<1)||(i19.i1.u71.s2_2<1)))&&((i16.u26.n3_6<1)||(i16.u57.s2_6<1)))&&((i7.i1.u38.n3_10<1)||(i7.i1.u58.s2_10<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6663922989974617591
[2021-05-17 06:17:48] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6663922989974617591
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/ltsmin6663922989974617591]
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/ltsmin6663922989974617591] 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/ltsmin6663922989974617591] 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-18-06 finished in 47058 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||F(p1)))||X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 39 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 76 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:50] [INFO ] Computed 1044 place invariants in 122 ms
[2021-05-17 06:17:51] [INFO ] Implicit Places using invariants in 1471 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:51] [INFO ] Computed 1044 place invariants in 69 ms
[2021-05-17 06:17:53] [INFO ] Implicit Places using invariants and state equation in 2319 ms returned []
Implicit Place search using SMT with State Equation took 3813 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:53] [INFO ] Computed 1044 place invariants in 62 ms
[2021-05-17 06:17:54] [INFO ] Dead Transitions using invariants and state equation in 529 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1334 1), p1:(OR (AND (GEQ s1114 1) (GEQ s1266 1)) (AND (GEQ s1117 1) (GEQ s1269 1)) (AND (GEQ s1119 1) (GEQ s1271 1)) (AND (GEQ s1109 1) (GEQ s1261 1)) (AND (GEQ s1111 1) (GEQ s1263 1)) (AND (GEQ s1103 1) (GEQ s1255 1)) (AND (GEQ s1104 1) (GEQ s1256 1)) (AND (GEQ s1106 1) (GEQ s1258 1)) (AND (GEQ s1120 1) (GEQ s1272 1)) (AND (GEQ s1108 1) (GEQ s1260 1)) (AND (GEQ s1112 1) (GEQ s1264 1)) (AND (GEQ s1116 1) (GEQ s1268 1)) (AND (GEQ s1118 1) (GEQ s1270 1)) (AND (GEQ s1110 1) (GEQ s1262 1)) (AND (GEQ s1121 1) (GEQ s1273 1)) (AND (GEQ s1107 1) (GEQ s1259 1)) (AND (GEQ s1113 1) (GEQ s1265 1)) (AND (GEQ s1115 1) (GEQ s1267 1)) (AND (GEQ s1105 1) (GEQ s1257 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4421 reset in 353 ms.
Product exploration explored 100000 steps with 4413 reset in 290 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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 (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4416 reset in 274 ms.
Product exploration explored 100000 steps with 4419 reset in 298 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 39 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 87 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2021-05-17 06:17:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:17:56] [INFO ] Computed 1044 place invariants in 120 ms
[2021-05-17 06:17:57] [INFO ] Dead Transitions using invariants and state equation in 639 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Product exploration explored 100000 steps with 4416 reset in 613 ms.
Product exploration explored 100000 steps with 4416 reset in 401 ms.
[2021-05-17 06:17:58] [INFO ] Flatten gal took : 26 ms
[2021-05-17 06:17:58] [INFO ] Flatten gal took : 25 ms
[2021-05-17 06:17:58] [INFO ] Time to serialize gal into /tmp/LTL17914771155889642400.gal : 3 ms
[2021-05-17 06:17:58] [INFO ] Time to serialize properties into /tmp/LTL17937774291787535559.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/LTL17914771155889642400.gal, -t, CGAL, -LTL, /tmp/LTL17937774291787535559.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/LTL17914771155889642400.gal -t CGAL -LTL /tmp/LTL17937774291787535559.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("(a2_0<1)")||(F("((((((((((((((((((((n5_11>=1)&&(s3_11>=1))||((n5_14>=1)&&(s3_14>=1)))||((n5_16>=1)&&(s3_16>=1)))||((n5_6>=1)&&(s3_6>=1)))||((n5_8>=1)&&(s3_8>=1)))||((n5_0>=1)&&(s3_0>=1)))||((n5_1>=1)&&(s3_1>=1)))||((n5_3>=1)&&(s3_3>=1)))||((n5_17>=1)&&(s3_17>=1)))||((n5_5>=1)&&(s3_5>=1)))||((n5_9>=1)&&(s3_9>=1)))||((n5_13>=1)&&(s3_13>=1)))||((n5_15>=1)&&(s3_15>=1)))||((n5_7>=1)&&(s3_7>=1)))||((n5_18>=1)&&(s3_18>=1)))||((n5_4>=1)&&(s3_4>=1)))||((n5_10>=1)&&(s3_10>=1)))||((n5_12>=1)&&(s3_12>=1)))||((n5_2>=1)&&(s3_2>=1)))"))))||(X(G("(a2_0<1)")))))
Formula 0 simplified : !(G("(a2_0<1)" | F"((((((((((((((((((((n5_11>=1)&&(s3_11>=1))||((n5_14>=1)&&(s3_14>=1)))||((n5_16>=1)&&(s3_16>=1)))||((n5_6>=1)&&(s3_6>=1)))||((n5_8>=1)&&(s3_8>=1)))||((n5_0>=1)&&(s3_0>=1)))||((n5_1>=1)&&(s3_1>=1)))||((n5_3>=1)&&(s3_3>=1)))||((n5_17>=1)&&(s3_17>=1)))||((n5_5>=1)&&(s3_5>=1)))||((n5_9>=1)&&(s3_9>=1)))||((n5_13>=1)&&(s3_13>=1)))||((n5_15>=1)&&(s3_15>=1)))||((n5_7>=1)&&(s3_7>=1)))||((n5_18>=1)&&(s3_18>=1)))||((n5_4>=1)&&(s3_4>=1)))||((n5_10>=1)&&(s3_10>=1)))||((n5_12>=1)&&(s3_12>=1)))||((n5_2>=1)&&(s3_2>=1)))") | XG"(a2_0<1)")
Detected timeout of ITS tools.
[2021-05-17 06:18:13] [INFO ] Flatten gal took : 43 ms
[2021-05-17 06:18:13] [INFO ] Applying decomposition
[2021-05-17 06:18:13] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9047024988746918233.txt, -o, /tmp/graph9047024988746918233.bin, -w, /tmp/graph9047024988746918233.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/graph9047024988746918233.bin, -l, -1, -v, -w, /tmp/graph9047024988746918233.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:18:13] [INFO ] Decomposing Gal with order
[2021-05-17 06:18:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:18:13] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 06:18:13] [INFO ] Flatten gal took : 79 ms
[2021-05-17 06:18:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 21 ms.
[2021-05-17 06:18:13] [INFO ] Time to serialize gal into /tmp/LTL3391387410245504042.gal : 11 ms
[2021-05-17 06:18:13] [INFO ] Time to serialize properties into /tmp/LTL4412063413931436502.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/LTL3391387410245504042.gal, -t, CGAL, -LTL, /tmp/LTL4412063413931436502.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/LTL3391387410245504042.gal -t CGAL -LTL /tmp/LTL4412063413931436502.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("(i8.i2.u114.a2_0<1)")||(F("((((((((((((((((((((i3.i0.u16.n5_11>=1)&&(i3.i0.u16.s3_11>=1))||((i8.i0.u19.n5_14>=1)&&(i8.i0.u19.s3_14>=1)))||((i14.u80.n5_16>=1)&&(i14.u80.s3_16>=1)))||((i16.u13.n5_6>=1)&&(i16.u13.s3_6>=1)))||((i17.i0.u6.n5_8>=1)&&(i17.i0.u6.s3_8>=1)))||((i18.i1.u9.n5_0>=1)&&(i18.i1.u9.s3_0>=1)))||((i11.i0.u3.n5_1>=1)&&(i11.i0.u3.s3_1>=1)))||((i8.i2.u4.n5_3>=1)&&(i8.i2.u4.s3_3>=1)))||((i7.u8.n5_17>=1)&&(i7.u8.s3_17>=1)))||((i15.i0.u12.n5_5>=1)&&(i15.i0.u12.s3_5>=1)))||((i22.i1.u7.n5_9>=1)&&(i22.i1.u7.s3_9>=1)))||((i24.i1.u18.n5_13>=1)&&(i24.i1.u18.s3_13>=1)))||((i9.u20.n5_15>=1)&&(i9.u20.s3_15>=1)))||((i13.i1.u14.n5_7>=1)&&(i13.i1.u14.s3_7>=1)))||((i6.i0.u22.n5_18>=1)&&(i6.i0.u22.s3_18>=1)))||((i10.i0.u5.n5_4>=1)&&(i10.i0.u5.s3_4>=1)))||((i23.i1.u15.n5_10>=1)&&(i23.i1.u15.s3_10>=1)))||((i4.i0.u79.n5_12>=1)&&(i4.i0.u79.s3_12>=1)))||((i12.i0.u11.n5_2>=1)&&(i12.i0.u11.s3_2>=1)))"))))||(X(G("(i8.i2.u114.a2_0<1)")))))
Formula 0 simplified : !(G("(i8.i2.u114.a2_0<1)" | F"((((((((((((((((((((i3.i0.u16.n5_11>=1)&&(i3.i0.u16.s3_11>=1))||((i8.i0.u19.n5_14>=1)&&(i8.i0.u19.s3_14>=1)))||((i14.u80.n5_16>=1)&&(i14.u80.s3_16>=1)))||((i16.u13.n5_6>=1)&&(i16.u13.s3_6>=1)))||((i17.i0.u6.n5_8>=1)&&(i17.i0.u6.s3_8>=1)))||((i18.i1.u9.n5_0>=1)&&(i18.i1.u9.s3_0>=1)))||((i11.i0.u3.n5_1>=1)&&(i11.i0.u3.s3_1>=1)))||((i8.i2.u4.n5_3>=1)&&(i8.i2.u4.s3_3>=1)))||((i7.u8.n5_17>=1)&&(i7.u8.s3_17>=1)))||((i15.i0.u12.n5_5>=1)&&(i15.i0.u12.s3_5>=1)))||((i22.i1.u7.n5_9>=1)&&(i22.i1.u7.s3_9>=1)))||((i24.i1.u18.n5_13>=1)&&(i24.i1.u18.s3_13>=1)))||((i9.u20.n5_15>=1)&&(i9.u20.s3_15>=1)))||((i13.i1.u14.n5_7>=1)&&(i13.i1.u14.s3_7>=1)))||((i6.i0.u22.n5_18>=1)&&(i6.i0.u22.s3_18>=1)))||((i10.i0.u5.n5_4>=1)&&(i10.i0.u5.s3_4>=1)))||((i23.i1.u15.n5_10>=1)&&(i23.i1.u15.s3_10>=1)))||((i4.i0.u79.n5_12>=1)&&(i4.i0.u79.s3_12>=1)))||((i12.i0.u11.n5_2>=1)&&(i12.i0.u11.s3_2>=1)))") | XG"(i8.i2.u114.a2_0<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18092271119525592226
[2021-05-17 06:18:28] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18092271119525592226
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/ltsmin18092271119525592226]
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/ltsmin18092271119525592226] 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/ltsmin18092271119525592226] 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-18-07 finished in 39996 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(p1))))], workingDir=/home/mcc/execution]
Support contains 21 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 70 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:30] [INFO ] Computed 1044 place invariants in 120 ms
[2021-05-17 06:18:31] [INFO ] Implicit Places using invariants in 1360 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:31] [INFO ] Computed 1044 place invariants in 63 ms
[2021-05-17 06:18:33] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:33] [INFO ] Computed 1044 place invariants in 116 ms
[2021-05-17 06:18:34] [INFO ] Dead Transitions using invariants and state equation in 697 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s1331 1), p1:(OR (AND (GEQ s0 1) (GEQ s1216 1)) (AND (GEQ s0 1) (GEQ s1215 1)) (AND (GEQ s0 1) (GEQ s1214 1)) (AND (GEQ s0 1) (GEQ s1213 1)) (AND (GEQ s0 1) (GEQ s1204 1)) (AND (GEQ s0 1) (GEQ s1203 1)) (AND (GEQ s0 1) (GEQ s1201 1)) (AND (GEQ s0 1) (GEQ s1202 1)) (AND (GEQ s0 1) (GEQ s1199 1)) (AND (GEQ s0 1) (GEQ s1200 1)) (AND (GEQ s0 1) (GEQ s1198 1)) (AND (GEQ s0 1) (GEQ s1212 1)) (AND (GEQ s0 1) (GEQ s1211 1)) (AND (GEQ s0 1) (GEQ s1210 1)) (AND (GEQ s0 1) (GEQ s1209 1)) (AND (GEQ s0 1) (GEQ s1208 1)) (AND (GEQ s0 1) (GEQ s1207 1)) (AND (GEQ s0 1) (GEQ s1206 1)) (AND (GEQ s0 1) (GEQ s1205 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-08 finished in 4532 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p1)&&p0) U (F(p2)||(F(!p1) U !p3))))], workingDir=/home/mcc/execution]
Support contains 457 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1335 transition count 294
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 1335 transition count 294
Applied a total of 3 rules in 102 ms. Remains 1335 /1337 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 06:18:34] [INFO ] Computed 1044 place invariants in 119 ms
[2021-05-17 06:18:35] [INFO ] Implicit Places using invariants in 1263 ms returned []
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 06:18:35] [INFO ] Computed 1044 place invariants in 66 ms
[2021-05-17 06:18:37] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3096 ms to find 19 implicit places.
[2021-05-17 06:18:37] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 294 rows 1316 cols
[2021-05-17 06:18:37] [INFO ] Computed 1026 place invariants in 83 ms
[2021-05-17 06:18:38] [INFO ] Dead Transitions using invariants and state equation in 678 ms returned []
Starting structural reductions, iteration 1 : 1316/1337 places, 294/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 1316 /1316 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2021-05-17 06:18:38] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 294 rows 1316 cols
[2021-05-17 06:18:38] [INFO ] Computed 1026 place invariants in 70 ms
[2021-05-17 06:18:38] [INFO ] Dead Transitions using invariants and state equation in 664 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1316/1337 places, 294/296 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-09 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s1311 1)) (AND (GEQ s0 1) (GEQ s1304 1)) (AND (GEQ s0 1) (GEQ s1303 1)) (AND (GEQ s0 1) (GEQ s1306 1)) (AND (GEQ s0 1) (GEQ s1305 1)) (AND (GEQ s0 1) (GEQ s1308 1)) (AND (GEQ s0 1) (GEQ s1307 1)) (AND (GEQ s0 1) (GEQ s1310 1)) (AND (GEQ s0 1) (GEQ s1309 1)) (AND (GEQ s0 1) (GEQ s1295 1)) (AND (GEQ s0 1) (GEQ s1296 1)) (AND (GEQ s0 1) (GEQ s1297 1)) (AND (GEQ s0 1) (GEQ s1298 1)) (AND (GEQ s0 1) (GEQ s1299 1)) (AND (GEQ s0 1) (GEQ s1300 1)) (AND (GEQ s0 1) (GEQ s1301 1)) (AND (GEQ s0 1) (GEQ s1302 1)) (AND (GEQ s0 1) (GEQ s1293 1)) (AND (GEQ s0 1) (GEQ s1294 1))), p3:(AND (OR (LT s0 1) (LT s1271 1)) (OR (LT s0 1) (LT s1272 1)) (OR (LT s0 1) (LT s1273 1)) (OR (LT s0 1) (LT s1263 1)) (OR (LT s0 1) (LT s1264 1)) (OR (LT s0 1) (LT s1265 1)) (OR (LT s0 1) (LT s1266 1)) (OR (LT s0 1) (LT s1267 1)) (OR (LT s0 1) (LT s1268 1)) (OR (LT s0 1) (LT s1269 1)) (OR (LT s0 1) (LT s1270 1)) (OR (LT s0 1) (LT s1255 1)) (OR (LT s0 1) (LT s1256 1)) (OR (LT s0 1) (LT s1257 1)) (OR (LT s0 1) (LT s1258 1)) (OR (LT s0 1) (LT s1259 1)) (OR (LT s0 1) (LT s1260 1)) (OR (LT s0 1) (LT s1261 1)) (OR (LT s0 1) (LT s1262 1))), p0:(AND (OR (LT s1157 1) (LT s1233 1)) (OR (LT s1141 1) (LT s1217 1)) (OR (LT s1144 1) (LT s1220 1)) (OR (LT s1149 1) (LT s1225 1)) (OR (LT s1152 1) (LT s1228 1)) (OR (LT s1154 1) (LT s1230 1)) (OR (LT s1142 1) (LT s1218 1)) (OR (LT s1146 1) (LT s1222 1)) (OR (LT s1150 1) (LT s1226 1)) (OR (LT s1153 1) (LT s1229 1)) (OR (LT s1145 1) (LT s1221 1)) (OR (LT s1148 1) (LT s1224 1)) (OR (LT s1156 1) (LT s1232 1)) (OR (LT s1158 1) (LT s1234 1)) (OR (LT s1155 1) (LT s1231 1)) (OR (LT s1159 1) (LT s1235 1)) (OR (LT s1143 1) (LT s1219 1)) (OR (LT s1147 1) (LT s1223 1)) (OR (LT s1151 1) (LT s1227 1))), p1:(AND (OR (LT s4 1) (LT s23 1) (LT s42 1) (LT s61 1) (LT s80 1) (LT s99 1) (LT s118 1) (LT s137 1) (LT s156 1) (LT s175 1) (LT s194 1) (LT s213 1) (LT s232 1) (LT s251 1) (LT s270 1) (LT s289 1) (LT s308 1) (LT s327 1) (LT s346 1) (LT s1182 1)) (OR (LT s15 1) (LT s34 1) (LT s53 1) (LT s72 1) (LT s91 1) (LT s110 1) (LT s129 1) (LT s148 1) (LT s167 1) (LT s186 1) (LT s205 1) (LT s224 1) (LT s243 1) (LT s262 1) (LT s281 1) (LT s300 1) (LT s319 1) (LT s338 1) (LT s357 1) (LT s1193 1)) (OR (LT s10 1) (LT s29 1) (LT s48 1) (LT s67 1) (LT s86 1) (LT s105 1) (LT s124 1) (LT s143 1) (LT s162 1) (LT s181 1) (LT s200 1) (LT s219 1) (LT s238 1) (LT s257 1) (LT s276 1) (LT s295 1) (LT s314 1) (LT s333 1) (LT s352 1) (LT s1188 1)) (OR (LT s5 1) (LT s24 1) (LT s43 1) (LT s62 1) (LT s81 1) (LT s100 1) (LT s119 1) (LT s138 1) (LT s157 1) (LT s176 1) (LT s195 1) (LT s214 1) (LT s233 1) (LT s252 1) (LT s271 1) (LT s290 1) (LT s309 1) (LT s328 1) (LT s347 1) (LT s1183 1)) (OR (LT s3 1) (LT s22 1) (LT s41 1) (LT s60 1) (LT s79 1) (LT s98 1) (LT s117 1) (LT s136 1) (LT s155 1) (LT s174 1) (LT s193 1) (LT s212 1) (LT s231 1) (LT s250 1) (LT s269 1) (LT s288 1) (LT s307 1) (LT s326 1) (LT s345 1) (LT s1181 1)) (OR (LT s14 1) (LT s33 1) (LT s52 1) (LT s71 1) (LT s90 1) (LT s109 1) (LT s128 1) (LT s147 1) (LT s166 1) (LT s185 1) (LT s204 1) (LT s223 1) (LT s242 1) (LT s261 1) (LT s280 1) (LT s299 1) (LT s318 1) (LT s337 1) (LT s356 1) (LT s1192 1)) (OR (LT s2 1) (LT s21 1) (LT s40 1) (LT s59 1) (LT s78 1) (LT s97 1) (LT s116 1) (LT s135 1) (LT s154 1) (LT s173 1) (LT s192 1) (LT s211 1) (LT s230 1) (LT s249 1) (LT s268 1) (LT s287 1) (LT s306 1) (LT s325 1) (LT s344 1) (LT s1180 1)) (OR (LT s17 1) (LT s36 1) (LT s55 1) (LT s74 1) (LT s93 1) (LT s112 1) (LT s131 1) (LT s150 1) (LT s169 1) (LT s188 1) (LT s207 1) (LT s226 1) (LT s245 1) (LT s264 1) (LT s283 1) (LT s302 1) (LT s321 1) (LT s340 1) (LT s359 1) (LT s1195 1)) (OR (LT s1 1) (LT s20 1) (LT s39 1) (LT s58 1) (LT s77 1) (LT s96 1) (LT s115 1) (LT s134 1) (LT s153 1) (LT s172 1) (LT s191 1) (LT s210 1) (LT s229 1) (LT s248 1) (LT s267 1) (LT s286 1) (LT s305 1) (LT s324 1) (LT s343 1) (LT s1179 1)) (OR (LT s16 1) (LT s35 1) (LT s54 1) (LT s73 1) (LT s92 1) (LT s111 1) (LT s130 1) (LT s149 1) (LT s168 1) (LT s187 1) (LT s206 1) (LT s225 1) (LT s244 1) (LT s263 1) (LT s282 1) (LT s301 1) (LT s320 1) (LT s339 1) (LT s358 1) (LT s1194 1)) (OR (LT s18 1) (LT s37 1) (LT s56 1) (LT s75 1) (LT s94 1) (LT s113 1) (LT s132 1) (LT s151 1) (LT s170 1) (LT s189 1) (LT s208 1) (LT s227 1) (LT s246 1) (LT s265 1) (LT s284 1) (LT s303 1) (LT s322 1) (LT s341 1) (LT s360 1) (LT s1196 1)) (OR (LT s7 1) (LT s26 1) (LT s45 1) (LT s64 1) (LT s83 1) (LT s102 1) (LT s121 1) (LT s140 1) (LT s159 1) (LT s178 1) (LT s197 1) (LT s216 1) (LT s235 1) (LT s254 1) (LT s273 1) (LT s292 1) (LT s311 1) (LT s330 1) (LT s349 1) (LT s1185 1)) (OR (LT s6 1) (LT s25 1) (LT s44 1) (LT s63 1) (LT s82 1) (LT s101 1) (LT s120 1) (LT s139 1) (LT s158 1) (LT s177 1) (LT s196 1) (LT s215 1) (LT s234 1) (LT s253 1) (LT s272 1) (LT s291 1) (LT s310 1) (LT s329 1) (LT s348 1) (LT s1184 1)) (OR (LT s13 1) (LT s32 1) (LT s51 1) (LT s70 1) (LT s89 1) (LT s108 1) (LT s127 1) (LT s146 1) (LT s165 1) (LT s184 1) (LT s203 1) (LT s222 1) (LT s241 1) (LT s260 1) (LT s279 1) (LT s298 1) (LT s317 1) (LT s336 1) (LT s355 1) (LT s1191 1)) (OR (LT s12 1) (LT s31 1) (LT s50 1) (LT s69 1) (LT s88 1) (LT s107 1) (LT s126 1) (LT s145 1) (LT s164 1) (LT s183 1) (LT s202 1) (LT s221 1) (LT s240 1) (LT s259 1) (LT s278 1) (LT s297 1) (LT s316 1) (LT s335 1) (LT s354 1) (LT s1190 1)) (OR (LT s19 1) (LT s38 1) (LT s57 1) (LT s76 1) (LT s95 1) (LT s114 1) (LT s133 1) (LT s152 1) (LT s171 1) (LT s190 1) (LT s209 1) (LT s228 1) (LT s247 1) (LT s266 1) (LT s285 1) (LT s304 1) (LT s323 1) (LT s342 1) (LT s361 1) (LT s1197 1)) (OR (LT s11 1) (LT s30 1) (LT s49 1) (LT s68 1) (LT s87 1) (LT s106 1) (LT s125 1) (LT s144 1) (LT s163 1) (LT s182 1) (LT s201 1) (LT s220 1) (LT s239 1) (LT s258 1) (LT s277 1) (LT s296 1) (LT s315 1) (LT s334 1) (LT s353 1) (LT s1189 1)) (OR (LT s9 1) (LT s28 1) (LT s47 1) (LT s66 1) (LT s85 1) (LT s104 1) (LT s123 1) (LT s142 1) (LT s161 1) (LT s180 1) (LT s199 1) (LT s218 1) (LT s237 1) (LT s256 1) (LT s275 1) (LT s294 1) (LT s313 1) (LT s332 1) (LT s351 1) (LT s1187 1)) (OR (LT s8 1) (LT s27 1) (LT s46 1) (LT s65 1) (LT s84 1) (LT s103 1) (LT s122 1) (LT s141 1) (LT s160 1) (LT s179 1) (LT s198 1) (LT s217 1) (LT s236 1) (LT s255 1) (LT s274 1) (LT s293 1) (LT s312 1) (LT s331 1) (LT s350 1) (LT s1186 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-COL-18-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-09 finished in 4824 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(!p0))||(X(F(p1)) U (!p0||X(!p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1337 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:39] [INFO ] Computed 1044 place invariants in 112 ms
[2021-05-17 06:18:40] [INFO ] Implicit Places using invariants in 1546 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:40] [INFO ] Computed 1044 place invariants in 68 ms
[2021-05-17 06:18:43] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3765 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:43] [INFO ] Computed 1044 place invariants in 66 ms
[2021-05-17 06:18:43] [INFO ] Dead Transitions using invariants and state equation in 577 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-10 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-10 finished in 4451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(G((p1||G(!p1))))&&p0) U !p2)))], workingDir=/home/mcc/execution]
Support contains 21 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:43] [INFO ] Computed 1044 place invariants in 87 ms
[2021-05-17 06:18:45] [INFO ] Implicit Places using invariants in 1378 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:45] [INFO ] Computed 1044 place invariants in 64 ms
[2021-05-17 06:18:47] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 06:18:47] [INFO ] Computed 1044 place invariants in 68 ms
[2021-05-17 06:18:47] [INFO ] Dead Transitions using invariants and state equation in 513 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 104 ms :[p2, p2, true, false, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-18-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s1334 1), p0:(AND (OR (LT s0 1) (LT s1241 1)) (OR (LT s0 1) (LT s1240 1)) (OR (LT s0 1) (LT s1239 1)) (OR (LT s0 1) (LT s1238 1)) (OR (LT s0 1) (LT s1237 1)) (OR (LT s0 1) (LT s1236 1)) (OR (LT s0 1) (LT s1249 1)) (OR (LT s0 1) (LT s1248 1)) (OR (LT s0 1) (LT s1247 1)) (OR (LT s0 1) (LT s1246 1)) (OR (LT s0 1) (LT s1253 1)) (OR (LT s0 1) (LT s1245 1)) (OR (LT s0 1) (LT s1254 1)) (OR (LT s0 1) (LT s1244 1)) (OR (LT s0 1) (LT s1243 1)) (OR (LT s0 1) (LT s1242 1)) (OR (LT s0 1) (LT s1252 1)) (OR (LT s0 1) (LT s1251 1)) (OR (LT s0 1) (LT s1250 1))), p1:(AND (OR (LT s0 1) (LT s1241 1)) (OR (LT s0 1) (LT s1240 1)) (OR (LT s0 1) (LT s1239 1)) (OR (LT s0 1) (LT s1238 1)) (OR (LT s0 1) (LT s1237 1)) (OR (LT s0 1) (LT s1236 1)) (OR (LT s0 1) (LT s1249 1)) (OR (LT s0 1) (LT s1248 1)) (OR (LT s0 1) (LT s1247 1)) (OR (LT s0 1) (LT s1246 1)) (OR (LT s0 1) (LT s1253 1)) (OR (LT s0 1) (LT s1245 1)) (OR (LT s0 1) (LT s1254 1)) (OR (LT s0 1) (LT s1244 1)) (OR (LT s0 1) (LT s1243 1)) (OR (LT s0 1) (LT s1242 1)) (OR (LT s0 1) (LT s1252 1)) (OR (LT s0 1) (LT s1251 1)) (OR (LT s0 1) (LT s1250 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-11 finished in 4021 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Reduce places removed 1 places and 1 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 1334 transition count 293
Applied a total of 4 rules in 78 ms. Remains 1334 /1337 variables (removed 3) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1334 cols
[2021-05-17 06:18:47] [INFO ] Computed 1044 place invariants in 114 ms
[2021-05-17 06:18:48] [INFO ] Implicit Places using invariants in 1246 ms returned []
// Phase 1: matrix 293 rows 1334 cols
[2021-05-17 06:18:49] [INFO ] Computed 1044 place invariants in 66 ms
[2021-05-17 06:18:51] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3348 ms to find 19 implicit places.
[2021-05-17 06:18:51] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 293 rows 1315 cols
[2021-05-17 06:18:51] [INFO ] Computed 1026 place invariants in 69 ms
[2021-05-17 06:18:51] [INFO ] Dead Transitions using invariants and state equation in 693 ms returned []
Starting structural reductions, iteration 1 : 1315/1337 places, 293/296 transitions.
Applied a total of 0 rules in 65 ms. Remains 1315 /1315 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2021-05-17 06:18:51] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 293 rows 1315 cols
[2021-05-17 06:18:52] [INFO ] Computed 1026 place invariants in 82 ms
[2021-05-17 06:18:52] [INFO ] Dead Transitions using invariants and state equation in 653 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1315/1337 places, 293/296 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s1197 1)) (AND (GEQ s0 1) (GEQ s1196 1)) (AND (GEQ s0 1) (GEQ s1195 1)) (AND (GEQ s0 1) (GEQ s1194 1)) (AND (GEQ s0 1) (GEQ s1185 1)) (AND (GEQ s0 1) (GEQ s1184 1)) (AND (GEQ s0 1) (GEQ s1182 1)) (AND (GEQ s0 1) (GEQ s1183 1)) (AND (GEQ s0 1) (GEQ s1180 1)) (AND (GEQ s0 1) (GEQ s1181 1)) (AND (GEQ s0 1) (GEQ s1179 1)) (AND (GEQ s0 1) (GEQ s1193 1)) (AND (GEQ s0 1) (GEQ s1192 1)) (AND (GEQ s0 1) (GEQ s1191 1)) (AND (GEQ s0 1) (GEQ s1190 1)) (AND (GEQ s0 1) (GEQ s1189 1)) (AND (GEQ s0 1) (GEQ s1188 1)) (AND (GEQ s0 1) (GEQ s1187 1)) (AND (GEQ s0 1) (GEQ s1186 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-13 finished in 4994 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 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 1335 transition count 294
Applied a total of 4 rules in 103 ms. Remains 1335 /1337 variables (removed 2) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 06:18:52] [INFO ] Computed 1044 place invariants in 106 ms
[2021-05-17 06:18:54] [INFO ] Implicit Places using invariants in 1476 ms returned []
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 06:18:54] [INFO ] Computed 1044 place invariants in 60 ms
[2021-05-17 06:18:56] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 3695 ms to find 0 implicit places.
[2021-05-17 06:18:56] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 06:18:56] [INFO ] Computed 1044 place invariants in 70 ms
[2021-05-17 06:18:57] [INFO ] Dead Transitions using invariants and state equation in 598 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1335/1337 places, 294/296 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1160 1) (GEQ s1161 1) (GEQ s1162 1) (GEQ s1163 1) (GEQ s1164 1) (GEQ s1165 1) (GEQ s1166 1) (GEQ s1167 1) (GEQ s1168 1) (GEQ s1169 1) (GEQ s1170 1) (GEQ s1171 1) (GEQ s1172 1) (GEQ s1173 1) (GEQ s1174 1) (GEQ s1175 1) (GEQ s1176 1) (GEQ s1177 1) (GEQ s1178 1) (GEQ s1333 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-14 finished in 4486 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 21 out of 1337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1337/1337 places, 296/296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1336 transition count 295
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 1336 transition count 295
Applied a total of 3 rules in 138 ms. Remains 1336 /1337 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 06:18:57] [INFO ] Computed 1044 place invariants in 119 ms
[2021-05-17 06:18:58] [INFO ] Implicit Places using invariants in 1346 ms returned []
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 06:18:58] [INFO ] Computed 1044 place invariants in 65 ms
[2021-05-17 06:19:01] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
[2021-05-17 06:19:01] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 06:19:01] [INFO ] Computed 1044 place invariants in 73 ms
[2021-05-17 06:19:01] [INFO ] Dead Transitions using invariants and state equation in 444 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1336/1337 places, 295/296 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-15 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1335 1), p1:(AND (GEQ s1122 1) (GEQ s1123 1) (GEQ s1124 1) (GEQ s1125 1) (GEQ s1126 1) (GEQ s1127 1) (GEQ s1128 1) (GEQ s1129 1) (GEQ s1130 1) (GEQ s1131 1) (GEQ s1132 1) (GEQ s1133 1) (GEQ s1134 1) (GEQ s1135 1) (GEQ s1136 1) (GEQ s1137 1) (GEQ s1138 1) (GEQ s1139 1) (GEQ s1140 1) (GEQ s1332 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4416 reset in 239 ms.
Product exploration explored 100000 steps with 4420 reset in 366 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 295
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 (NOT p1))), (NOT p0), (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-COL-18-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-COL-18-15 finished in 5518 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3337574980664619861
[2021-05-17 06:19:02] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2021-05-17 06:19:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:19:02] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2021-05-17 06:19:02] [INFO ] Applying decomposition
[2021-05-17 06:19:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:19:02] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2021-05-17 06:19:02] [INFO ] Flatten gal took : 38 ms
[2021-05-17 06:19:02] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 06:19:02] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3337574980664619861
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/ltsmin3337574980664619861]
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/graph14325648903698981454.txt, -o, /tmp/graph14325648903698981454.bin, -w, /tmp/graph14325648903698981454.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/graph14325648903698981454.bin, -l, -1, -v, -w, /tmp/graph14325648903698981454.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:19:02] [INFO ] Decomposing Gal with order
[2021-05-17 06:19:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:19:02] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 06:19:03] [INFO ] Flatten gal took : 124 ms
[2021-05-17 06:19:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 31 ms.
[2021-05-17 06:19:03] [INFO ] Time to serialize gal into /tmp/LTLFireability337953906865334961.gal : 15 ms
[2021-05-17 06:19:03] [INFO ] Time to serialize properties into /tmp/LTLFireability1949640245195721000.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/LTLFireability337953906865334961.gal, -t, CGAL, -LTL, /tmp/LTLFireability1949640245195721000.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/LTLFireability337953906865334961.gal -t CGAL -LTL /tmp/LTLFireability1949640245195721000.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(("(i11.i0.u112.a5_0>=1)")U(X("((((((((((((((((((((u0.malicious_reservoir_0>=1)&&(i9.i1.u69.Sstart_16>=1))||((u0.malicious_reservoir_0>=1)&&(i14.i1.u79.Sstart_15>=1)))||((u0.malicious_reservoir_0>=1)&&(i16.i1.u55.Sstart_14>=1)))||((u0.malicious_reservoir_0>=1)&&(i21.i1.u54.Sstart_13>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u67.Sstart_12>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.i1.u53.Sstart_11>=1)))||((u0.malicious_reservoir_0>=1)&&(i10.i0.u52.Sstart_10>=1)))||((u0.malicious_reservoir_0>=1)&&(i13.i1.u77.Sstart_9>=1)))||((u0.malicious_reservoir_0>=1)&&(i18.i1.u71.Sstart_18>=1)))||((u0.malicious_reservoir_0>=1)&&(i17.u70.Sstart_17>=1)))||((u0.malicious_reservoir_0>=1)&&(i11.i1.u46.Sstart_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i20.u66.Sstart_8>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u50.Sstart_7>=1)))||((u0.malicious_reservoir_0>=1)&&(i15.i1.u65.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i12.i1.u64.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i19.u48.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i22.i0.u63.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u62.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u47.Sstart_1>=1)))")))))
Formula 0 simplified : !X("(i11.i0.u112.a5_0>=1)" U X"((((((((((((((((((((u0.malicious_reservoir_0>=1)&&(i9.i1.u69.Sstart_16>=1))||((u0.malicious_reservoir_0>=1)&&(i14.i1.u79.Sstart_15>=1)))||((u0.malicious_reservoir_0>=1)&&(i16.i1.u55.Sstart_14>=1)))||((u0.malicious_reservoir_0>=1)&&(i21.i1.u54.Sstart_13>=1)))||((u0.malicious_reservoir_0>=1)&&(i8.i1.u67.Sstart_12>=1)))||((u0.malicious_reservoir_0>=1)&&(i5.i1.u53.Sstart_11>=1)))||((u0.malicious_reservoir_0>=1)&&(i10.i0.u52.Sstart_10>=1)))||((u0.malicious_reservoir_0>=1)&&(i13.i1.u77.Sstart_9>=1)))||((u0.malicious_reservoir_0>=1)&&(i18.i1.u71.Sstart_18>=1)))||((u0.malicious_reservoir_0>=1)&&(i17.u70.Sstart_17>=1)))||((u0.malicious_reservoir_0>=1)&&(i11.i1.u46.Sstart_0>=1)))||((u0.malicious_reservoir_0>=1)&&(i20.u66.Sstart_8>=1)))||((u0.malicious_reservoir_0>=1)&&(i4.i1.u50.Sstart_7>=1)))||((u0.malicious_reservoir_0>=1)&&(i15.i1.u65.Sstart_6>=1)))||((u0.malicious_reservoir_0>=1)&&(i12.i1.u64.Sstart_5>=1)))||((u0.malicious_reservoir_0>=1)&&(i19.u48.Sstart_4>=1)))||((u0.malicious_reservoir_0>=1)&&(i22.i0.u63.Sstart_3>=1)))||((u0.malicious_reservoir_0>=1)&&(i3.i1.u62.Sstart_2>=1)))||((u0.malicious_reservoir_0>=1)&&(i2.i1.u47.Sstart_1>=1)))")
Compilation finished in 3772 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3337574980664619861]
Link finished in 104 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(((LTLAPp0==true) U X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3337574980664619861]
LTSmin run took 4254 ms.
FORMULA QuasiCertifProtocol-COL-18-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp2==true))||X((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3337574980664619861]
LTSmin run took 1215 ms.
FORMULA QuasiCertifProtocol-COL-18-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3337574980664619861]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.970: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.970: LTL layer: formula: ([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true))))
pins2lts-mc-linux64( 1/ 8), 0.990: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.991: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.034: "([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.035: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 1.032: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 1.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.033: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.060: buchi has 3 states
pins2lts-mc-linux64( 5/ 8), 1.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.073: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.954: DFS-FIFO for weak LTL, using special progress label 303
pins2lts-mc-linux64( 0/ 8), 1.954: There are 304 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.954: State length is 1338, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 1.954: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.954: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.954: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.954: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 3.311: ~1 levels ~960 states ~17800 transitions
pins2lts-mc-linux64( 4/ 8), 3.356: ~1 levels ~1920 states ~37320 transitions
pins2lts-mc-linux64( 4/ 8), 3.480: ~1 levels ~3840 states ~79632 transitions
pins2lts-mc-linux64( 1/ 8), 3.935: ~1 levels ~7680 states ~163232 transitions
pins2lts-mc-linux64( 1/ 8), 4.691: ~1 levels ~15360 states ~351944 transitions
pins2lts-mc-linux64( 3/ 8), 6.237: ~1 levels ~30720 states ~573800 transitions
pins2lts-mc-linux64( 4/ 8), 9.053: ~1 levels ~61440 states ~1578632 transitions
pins2lts-mc-linux64( 4/ 8), 13.369: ~1 levels ~122880 states ~3284112 transitions
pins2lts-mc-linux64( 2/ 8), 22.046: ~1 levels ~245760 states ~6768048 transitions
pins2lts-mc-linux64( 6/ 8), 38.829: ~1 levels ~491520 states ~14252144 transitions
pins2lts-mc-linux64( 3/ 8), 65.801: ~1 levels ~983040 states ~25234600 transitions
pins2lts-mc-linux64( 3/ 8), 131.885: ~1 levels ~1966080 states ~52748840 transitions
pins2lts-mc-linux64( 0/ 8), 145.759: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 146.197:
pins2lts-mc-linux64( 0/ 8), 146.197: mean standard work distribution: 6.4% (states) 4.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 146.197:
pins2lts-mc-linux64( 0/ 8), 146.197: Explored 1882790 states 55921214 transitions, fanout: 29.701
pins2lts-mc-linux64( 0/ 8), 146.197: Total exploration time 144.220 sec (143.770 sec minimum, 143.970 sec on average)
pins2lts-mc-linux64( 0/ 8), 146.197: States per second: 13055, Transitions per second: 387749
pins2lts-mc-linux64( 0/ 8), 146.197:
pins2lts-mc-linux64( 0/ 8), 146.197: Progress states detected: 12450386
pins2lts-mc-linux64( 0/ 8), 146.197: Redundant explorations: -84.8778
pins2lts-mc-linux64( 0/ 8), 146.197:
pins2lts-mc-linux64( 0/ 8), 146.197: Queue width: 8B, total height: 14955558, memory: 114.10MB
pins2lts-mc-linux64( 0/ 8), 146.197: Tree memory: 351.0MB, 29.6 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 146.197: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 146.197: Stored 304 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 146.197: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 146.197: Est. total memory use: 465.1MB (~1138.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3337574980664619861]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3337574980664619861]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 06:40:09] [INFO ] Applying decomposition
[2021-05-17 06:40:09] [INFO ] Flatten gal took : 309 ms
[2021-05-17 06:40:09] [INFO ] Decomposing Gal with order
[2021-05-17 06:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:40:10] [INFO ] Removed a total of 170 redundant transitions.
[2021-05-17 06:40:10] [INFO ] Flatten gal took : 718 ms
[2021-05-17 06:40:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 138 ms.
[2021-05-17 06:40:11] [INFO ] Time to serialize gal into /tmp/LTLFireability9660981687523099541.gal : 54 ms
[2021-05-17 06:40:11] [INFO ] Time to serialize properties into /tmp/LTLFireability990526501525748943.ltl : 5 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/LTLFireability9660981687523099541.gal, -t, CGAL, -LTL, /tmp/LTLFireability990526501525748943.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/LTLFireability9660981687523099541.gal -t CGAL -LTL /tmp/LTLFireability990526501525748943.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("(a2.a2_0<1)")||(F("((((((((((((((((((((tsid11.n5_11>=1)&&(tsid11.s3_11>=1))||((tsid14.n5_14>=1)&&(tsid14.s3_14>=1)))||((tsid16.n5_16>=1)&&(tsid16.s3_16>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))||((tsid8.n5_8>=1)&&(tsid8.s3_8>=1)))||((tsid0.n5_0>=1)&&(tsid0.s3_0>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid17.n5_17>=1)&&(tsid17.s3_17>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid9.n5_9>=1)&&(tsid9.s3_9>=1)))||((tsid13.n5_13>=1)&&(tsid13.s3_13>=1)))||((tsid15.n5_15>=1)&&(tsid15.s3_15>=1)))||((tsid7.n5_7>=1)&&(tsid7.s3_7>=1)))||((tsid18.n5_18>=1)&&(tsid18.s3_18>=1)))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid10.n5_10>=1)&&(tsid10.s3_10>=1)))||((tsid12.n5_12>=1)&&(tsid12.s3_12>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))"))))||(X(G("(a2.a2_0<1)")))))
Formula 0 simplified : !(G("(a2.a2_0<1)" | F"((((((((((((((((((((tsid11.n5_11>=1)&&(tsid11.s3_11>=1))||((tsid14.n5_14>=1)&&(tsid14.s3_14>=1)))||((tsid16.n5_16>=1)&&(tsid16.s3_16>=1)))||((tsid6.n5_6>=1)&&(tsid6.s3_6>=1)))||((tsid8.n5_8>=1)&&(tsid8.s3_8>=1)))||((tsid0.n5_0>=1)&&(tsid0.s3_0>=1)))||((tsid1.n5_1>=1)&&(tsid1.s3_1>=1)))||((tsid3.n5_3>=1)&&(tsid3.s3_3>=1)))||((tsid17.n5_17>=1)&&(tsid17.s3_17>=1)))||((tsid5.n5_5>=1)&&(tsid5.s3_5>=1)))||((tsid9.n5_9>=1)&&(tsid9.s3_9>=1)))||((tsid13.n5_13>=1)&&(tsid13.s3_13>=1)))||((tsid15.n5_15>=1)&&(tsid15.s3_15>=1)))||((tsid7.n5_7>=1)&&(tsid7.s3_7>=1)))||((tsid18.n5_18>=1)&&(tsid18.s3_18>=1)))||((tsid4.n5_4>=1)&&(tsid4.s3_4>=1)))||((tsid10.n5_10>=1)&&(tsid10.s3_10>=1)))||((tsid12.n5_12>=1)&&(tsid12.s3_12>=1)))||((tsid2.n5_2>=1)&&(tsid2.s3_2>=1)))") | XG"(a2.a2_0<1)")
Detected timeout of ITS tools.
[2021-05-17 07:01:17] [INFO ] Flatten gal took : 331 ms
[2021-05-17 07:01:19] [INFO ] Input system was already deterministic with 296 transitions.
[2021-05-17 07:01:19] [INFO ] Transformed 1337 places.
[2021-05-17 07:01:19] [INFO ] Transformed 296 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:01:19] [INFO ] Time to serialize gal into /tmp/LTLFireability8973225963653113168.gal : 13 ms
[2021-05-17 07:01:19] [INFO ] Time to serialize properties into /tmp/LTLFireability13215485537658718155.ltl : 5 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/LTLFireability8973225963653113168.gal, -t, CGAL, -LTL, /tmp/LTLFireability13215485537658718155.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/LTLFireability8973225963653113168.gal -t CGAL -LTL /tmp/LTLFireability13215485537658718155.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 : !(((G(("(a2_0<1)")||(F("((((((((((((((((((((n5_11>=1)&&(s3_11>=1))||((n5_14>=1)&&(s3_14>=1)))||((n5_16>=1)&&(s3_16>=1)))||((n5_6>=1)&&(s3_6>=1)))||((n5_8>=1)&&(s3_8>=1)))||((n5_0>=1)&&(s3_0>=1)))||((n5_1>=1)&&(s3_1>=1)))||((n5_3>=1)&&(s3_3>=1)))||((n5_17>=1)&&(s3_17>=1)))||((n5_5>=1)&&(s3_5>=1)))||((n5_9>=1)&&(s3_9>=1)))||((n5_13>=1)&&(s3_13>=1)))||((n5_15>=1)&&(s3_15>=1)))||((n5_7>=1)&&(s3_7>=1)))||((n5_18>=1)&&(s3_18>=1)))||((n5_4>=1)&&(s3_4>=1)))||((n5_10>=1)&&(s3_10>=1)))||((n5_12>=1)&&(s3_12>=1)))||((n5_2>=1)&&(s3_2>=1)))"))))||(X(G("(a2_0<1)")))))
Formula 0 simplified : !(G("(a2_0<1)" | F"((((((((((((((((((((n5_11>=1)&&(s3_11>=1))||((n5_14>=1)&&(s3_14>=1)))||((n5_16>=1)&&(s3_16>=1)))||((n5_6>=1)&&(s3_6>=1)))||((n5_8>=1)&&(s3_8>=1)))||((n5_0>=1)&&(s3_0>=1)))||((n5_1>=1)&&(s3_1>=1)))||((n5_3>=1)&&(s3_3>=1)))||((n5_17>=1)&&(s3_17>=1)))||((n5_5>=1)&&(s3_5>=1)))||((n5_9>=1)&&(s3_9>=1)))||((n5_13>=1)&&(s3_13>=1)))||((n5_15>=1)&&(s3_15>=1)))||((n5_7>=1)&&(s3_7>=1)))||((n5_18>=1)&&(s3_18>=1)))||((n5_4>=1)&&(s3_4>=1)))||((n5_10>=1)&&(s3_10>=1)))||((n5_12>=1)&&(s3_12>=1)))||((n5_2>=1)&&(s3_2>=1)))") | XG"(a2_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-18"
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-18, 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-162089415100037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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