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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16241.779 3600000.00 3926635.00 211760.50 FTFTFTT?FFFFFFFT 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-162089415200093.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-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 239K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K 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 19K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 27 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Mar 27 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 686K 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-PT-18-00
FORMULA_NAME QuasiCertifProtocol-PT-18-01
FORMULA_NAME QuasiCertifProtocol-PT-18-02
FORMULA_NAME QuasiCertifProtocol-PT-18-03
FORMULA_NAME QuasiCertifProtocol-PT-18-04
FORMULA_NAME QuasiCertifProtocol-PT-18-05
FORMULA_NAME QuasiCertifProtocol-PT-18-06
FORMULA_NAME QuasiCertifProtocol-PT-18-07
FORMULA_NAME QuasiCertifProtocol-PT-18-08
FORMULA_NAME QuasiCertifProtocol-PT-18-09
FORMULA_NAME QuasiCertifProtocol-PT-18-10
FORMULA_NAME QuasiCertifProtocol-PT-18-11
FORMULA_NAME QuasiCertifProtocol-PT-18-12
FORMULA_NAME QuasiCertifProtocol-PT-18-13
FORMULA_NAME QuasiCertifProtocol-PT-18-14
FORMULA_NAME QuasiCertifProtocol-PT-18-15

=== Now, execution of the tool begins

BK_START 1621235808994

Running Version 0
[2021-05-17 07:16:50] [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 07:16:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:16:50] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-17 07:16:50] [INFO ] Transformed 1398 places.
[2021-05-17 07:16:50] [INFO ] Transformed 296 transitions.
[2021-05-17 07:16:50] [INFO ] Parsed PT model containing 1398 places and 296 transitions in 120 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 07:16:50] [INFO ] Initial state test concluded for 3 properties.
FORMULA QuasiCertifProtocol-PT-18-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 198 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 142 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 07:16:50] [INFO ] Computed 1062 place invariants in 69 ms
[2021-05-17 07:16:52] [INFO ] Implicit Places using invariants in 1271 ms returned []
// Phase 1: matrix 296 rows 1356 cols
[2021-05-17 07:16:52] [INFO ] Computed 1062 place invariants in 54 ms
[2021-05-17 07:16:53] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 933, 934]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3029 ms to find 19 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:16:54] [INFO ] Computed 1044 place invariants in 151 ms
[2021-05-17 07:16:54] [INFO ] Dead Transitions using invariants and state equation in 535 ms returned []
Starting structural reductions, iteration 1 : 1337/1398 places, 296/296 transitions.
Applied a total of 0 rules in 51 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 07:16:54] [INFO ] Computed 1044 place invariants in 123 ms
[2021-05-17 07:16:55] [INFO ] Dead Transitions using invariants and state equation in 596 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1337/1398 places, 296/296 transitions.
[2021-05-17 07:16:55] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 07:16:55] [INFO ] Flatten gal took : 149 ms
FORMULA QuasiCertifProtocol-PT-18-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 07:16:55] [INFO ] Flatten gal took : 59 ms
[2021-05-17 07:16:55] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 100000 steps, including 4419 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 18) seen :4
Running SMT prover for 14 properties.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:16:56] [INFO ] Computed 1044 place invariants in 96 ms
[2021-05-17 07:16:56] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 188 ms returned sat
[2021-05-17 07:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:56] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2021-05-17 07:16:57] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 29 ms.
[2021-05-17 07:16:57] [INFO ] Added : 42 causal constraints over 9 iterations in 469 ms. Result :sat
[2021-05-17 07:16:57] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 158 ms returned sat
[2021-05-17 07:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:58] [INFO ] [Real]Absence check using state equation in 253 ms returned unsat
[2021-05-17 07:16:58] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 160 ms returned sat
[2021-05-17 07:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:58] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2021-05-17 07:16:58] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 07:16:59] [INFO ] Added : 59 causal constraints over 12 iterations in 519 ms. Result :sat
[2021-05-17 07:16:59] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 164 ms returned sat
[2021-05-17 07:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:16:59] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-17 07:16:59] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 17 ms.
[2021-05-17 07:17:00] [INFO ] Added : 21 causal constraints over 5 iterations in 217 ms. Result :sat
[2021-05-17 07:17:00] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 141 ms returned sat
[2021-05-17 07:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:00] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2021-05-17 07:17:00] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 17 ms.
[2021-05-17 07:17:00] [INFO ] Added : 20 causal constraints over 4 iterations in 161 ms. Result :sat
[2021-05-17 07:17:01] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 164 ms returned sat
[2021-05-17 07:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:01] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2021-05-17 07:17:01] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 16 ms.
[2021-05-17 07:17:01] [INFO ] Added : 40 causal constraints over 8 iterations in 264 ms. Result :sat
[2021-05-17 07:17:02] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 142 ms returned sat
[2021-05-17 07:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:02] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-17 07:17:02] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 07:17:02] [INFO ] Added : 78 causal constraints over 16 iterations in 500 ms. Result :sat
[2021-05-17 07:17:03] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 149 ms returned sat
[2021-05-17 07:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:03] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2021-05-17 07:17:03] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 17 ms.
[2021-05-17 07:17:03] [INFO ] Added : 20 causal constraints over 4 iterations in 162 ms. Result :sat
[2021-05-17 07:17:03] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 146 ms returned sat
[2021-05-17 07:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:04] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-17 07:17:04] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 07:17:04] [INFO ] Added : 59 causal constraints over 12 iterations in 371 ms. Result :sat
[2021-05-17 07:17:04] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 190 ms returned sat
[2021-05-17 07:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:05] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2021-05-17 07:17:05] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 07:17:05] [INFO ] Added : 40 causal constraints over 8 iterations in 297 ms. Result :sat
[2021-05-17 07:17:05] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 138 ms returned sat
[2021-05-17 07:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:06] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-17 07:17:06] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 17 ms.
[2021-05-17 07:17:06] [INFO ] Added : 23 causal constraints over 5 iterations in 237 ms. Result :sat
[2021-05-17 07:17:06] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 150 ms returned sat
[2021-05-17 07:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:06] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-17 07:17:06] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 16 ms.
[2021-05-17 07:17:07] [INFO ] Added : 78 causal constraints over 16 iterations in 475 ms. Result :sat
[2021-05-17 07:17:07] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 133 ms returned sat
[2021-05-17 07:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:07] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2021-05-17 07:17:07] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 28 ms.
[2021-05-17 07:17:08] [INFO ] Added : 78 causal constraints over 16 iterations in 567 ms. Result :sat
[2021-05-17 07:17:08] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 182 ms returned sat
[2021-05-17 07:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:17:09] [INFO ] [Real]Absence check using state equation in 305 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-17 07:17:09] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-PT-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 127 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 07:17:09] [INFO ] Computed 1044 place invariants in 97 ms
[2021-05-17 07:17:10] [INFO ] Implicit Places using invariants in 1159 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:17:10] [INFO ] Computed 1044 place invariants in 84 ms
[2021-05-17 07:17:12] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:17:12] [INFO ] Computed 1044 place invariants in 104 ms
[2021-05-17 07:17:12] [INFO ] Dead Transitions using invariants and state equation in 589 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s125 1), p1:(OR (AND (GEQ s0 1) (GEQ s117 1)) (AND (GEQ s0 1) (GEQ s116 1)) (AND (GEQ s0 1) (GEQ s115 1)) (AND (GEQ s0 1) (GEQ s124 1)) (AND (GEQ s0 1) (GEQ s123 1)) (AND (GEQ s0 1) (GEQ s122 1)) (AND (GEQ s0 1) (GEQ s121 1)) (AND (GEQ s0 1) (GEQ s120 1)) (AND (GEQ s0 1) (GEQ s119 1)) (AND (GEQ s0 1) (GEQ s118 1)) (AND (GEQ s0 1) (GEQ s132 1)) (AND (GEQ s0 1) (GEQ s131 1)) (AND (GEQ s0 1) (GEQ s130 1)) (AND (GEQ s0 1) (GEQ s126 1)) (AND (GEQ s0 1) (GEQ s137 1)) (AND (GEQ s0 1) (GEQ s136 1)) (AND (GEQ s0 1) (GEQ s135 1)) (AND (GEQ s0 1) (GEQ s134 1)) (AND (GEQ s0 1) (GEQ s133 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 750 ms.
Product exploration explored 100000 steps with 33333 reset in 602 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 110 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 668 ms.
Product exploration explored 100000 steps with 33333 reset in 615 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 119 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 273 ms. Remains 1337 /1337 variables (removed 0) and now considering 297/296 (removed -1) transitions.
[2021-05-17 07:17:16] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 297 rows 1337 cols
[2021-05-17 07:17:16] [INFO ] Computed 1044 place invariants in 95 ms
[2021-05-17 07:17:17] [INFO ] Dead Transitions using invariants and state equation in 604 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 297/296 transitions.
Product exploration explored 100000 steps with 33333 reset in 2502 ms.
Product exploration explored 100000 steps with 33333 reset in 2534 ms.
[2021-05-17 07:17:22] [INFO ] Flatten gal took : 59 ms
[2021-05-17 07:17:22] [INFO ] Flatten gal took : 47 ms
[2021-05-17 07:17:22] [INFO ] Time to serialize gal into /tmp/LTL7761120992340755834.gal : 39 ms
[2021-05-17 07:17:22] [INFO ] Time to serialize properties into /tmp/LTL1139452012331906304.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7761120992340755834.gal, -t, CGAL, -LTL, /tmp/LTL1139452012331906304.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/LTL7761120992340755834.gal -t CGAL -LTL /tmp/LTL1139452012331906304.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(a5>=1)")U(X("((((((((((((((((((((malicious_reservoir>=1)&&(Sstart_5>=1))||((malicious_reservoir>=1)&&(Sstart_6>=1)))||((malicious_reservoir>=1)&&(Sstart_7>=1)))||((malicious_reservoir>=1)&&(Sstart_16>=1)))||((malicious_reservoir>=1)&&(Sstart_17>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1)))||((malicious_reservoir>=1)&&(Sstart_1>=1)))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_3>=1)))||((malicious_reservoir>=1)&&(Sstart_4>=1)))||((malicious_reservoir>=1)&&(Sstart_11>=1)))||((malicious_reservoir>=1)&&(Sstart_8>=1)))||((malicious_reservoir>=1)&&(Sstart_9>=1)))||((malicious_reservoir>=1)&&(Sstart_18>=1)))||((malicious_reservoir>=1)&&(Sstart_14>=1)))||((malicious_reservoir>=1)&&(Sstart_15>=1)))||((malicious_reservoir>=1)&&(Sstart_12>=1)))||((malicious_reservoir>=1)&&(Sstart_13>=1)))||((malicious_reservoir>=1)&&(Sstart_10>=1)))")))))
Formula 0 simplified : !X("(a5>=1)" U X"((((((((((((((((((((malicious_reservoir>=1)&&(Sstart_5>=1))||((malicious_reservoir>=1)&&(Sstart_6>=1)))||((malicious_reservoir>=1)&&(Sstart_7>=1)))||((malicious_reservoir>=1)&&(Sstart_16>=1)))||((malicious_reservoir>=1)&&(Sstart_17>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1)))||((malicious_reservoir>=1)&&(Sstart_1>=1)))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_3>=1)))||((malicious_reservoir>=1)&&(Sstart_4>=1)))||((malicious_reservoir>=1)&&(Sstart_11>=1)))||((malicious_reservoir>=1)&&(Sstart_8>=1)))||((malicious_reservoir>=1)&&(Sstart_9>=1)))||((malicious_reservoir>=1)&&(Sstart_18>=1)))||((malicious_reservoir>=1)&&(Sstart_14>=1)))||((malicious_reservoir>=1)&&(Sstart_15>=1)))||((malicious_reservoir>=1)&&(Sstart_12>=1)))||((malicious_reservoir>=1)&&(Sstart_13>=1)))||((malicious_reservoir>=1)&&(Sstart_10>=1)))")
Detected timeout of ITS tools.
[2021-05-17 07:17:37] [INFO ] Flatten gal took : 36 ms
[2021-05-17 07:17:37] [INFO ] Applying decomposition
[2021-05-17 07:17:37] [INFO ] Flatten gal took : 42 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/graph7322480428800106158.txt, -o, /tmp/graph7322480428800106158.bin, -w, /tmp/graph7322480428800106158.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/graph7322480428800106158.bin, -l, -1, -v, -w, /tmp/graph7322480428800106158.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:17:38] [INFO ] Decomposing Gal with order
[2021-05-17 07:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:17:38] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 07:17:38] [INFO ] Flatten gal took : 183 ms
[2021-05-17 07:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 43 ms.
[2021-05-17 07:17:38] [INFO ] Time to serialize gal into /tmp/LTL3980618357982463348.gal : 12 ms
[2021-05-17 07:17:38] [INFO ] Time to serialize properties into /tmp/LTL567307181972867063.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/LTL3980618357982463348.gal, -t, CGAL, -LTL, /tmp/LTL567307181972867063.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/LTL3980618357982463348.gal -t CGAL -LTL /tmp/LTL567307181972867063.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i34.i1.u48.a5>=1)")U(X("((((((((((((((((((((u0.malicious_reservoir>=1)&&(i29.i0.u43.Sstart_5>=1))||((u0.malicious_reservoir>=1)&&(i15.i1.u42.Sstart_6>=1)))||((u0.malicious_reservoir>=1)&&(i28.i1.u93.Sstart_7>=1)))||((u0.malicious_reservoir>=1)&&(i32.i0.u46.Sstart_16>=1)))||((u0.malicious_reservoir>=1)&&(i33.i0.u90.Sstart_17>=1)))||((u0.malicious_reservoir>=1)&&(i38.i1.u97.Sstart_0>=1)))||((u0.malicious_reservoir>=1)&&(i31.i1.u35.Sstart_1>=1)))||((u0.malicious_reservoir>=1)&&(i24.i1.u96.Sstart_2>=1)))||((u0.malicious_reservoir>=1)&&(i23.i1.u45.Sstart_3>=1)))||((u0.malicious_reservoir>=1)&&(i30.i0.u44.Sstart_4>=1)))||((u0.malicious_reservoir>=1)&&(i21.i1.u50.Sstart_11>=1)))||((u0.malicious_reservoir>=1)&&(i16.i1.u94.Sstart_8>=1)))||((u0.malicious_reservoir>=1)&&(i26.i0.u49.Sstart_9>=1)))||((u0.malicious_reservoir>=1)&&(i25.i1.u89.Sstart_18>=1)))||((u0.malicious_reservoir>=1)&&(i18.i1.u87.Sstart_14>=1)))||((u0.malicious_reservoir>=1)&&(i37.i1.u54.Sstart_15>=1)))||((u0.malicious_reservoir>=1)&&(i34.i0.u53.Sstart_12>=1)))||((u0.malicious_reservoir>=1)&&(i36.i1.u52.Sstart_13>=1)))||((u0.malicious_reservoir>=1)&&(i27.i0.u51.Sstart_10>=1)))")))))
Formula 0 simplified : !X("(i34.i1.u48.a5>=1)" U X"((((((((((((((((((((u0.malicious_reservoir>=1)&&(i29.i0.u43.Sstart_5>=1))||((u0.malicious_reservoir>=1)&&(i15.i1.u42.Sstart_6>=1)))||((u0.malicious_reservoir>=1)&&(i28.i1.u93.Sstart_7>=1)))||((u0.malicious_reservoir>=1)&&(i32.i0.u46.Sstart_16>=1)))||((u0.malicious_reservoir>=1)&&(i33.i0.u90.Sstart_17>=1)))||((u0.malicious_reservoir>=1)&&(i38.i1.u97.Sstart_0>=1)))||((u0.malicious_reservoir>=1)&&(i31.i1.u35.Sstart_1>=1)))||((u0.malicious_reservoir>=1)&&(i24.i1.u96.Sstart_2>=1)))||((u0.malicious_reservoir>=1)&&(i23.i1.u45.Sstart_3>=1)))||((u0.malicious_reservoir>=1)&&(i30.i0.u44.Sstart_4>=1)))||((u0.malicious_reservoir>=1)&&(i21.i1.u50.Sstart_11>=1)))||((u0.malicious_reservoir>=1)&&(i16.i1.u94.Sstart_8>=1)))||((u0.malicious_reservoir>=1)&&(i26.i0.u49.Sstart_9>=1)))||((u0.malicious_reservoir>=1)&&(i25.i1.u89.Sstart_18>=1)))||((u0.malicious_reservoir>=1)&&(i18.i1.u87.Sstart_14>=1)))||((u0.malicious_reservoir>=1)&&(i37.i1.u54.Sstart_15>=1)))||((u0.malicious_reservoir>=1)&&(i34.i0.u53.Sstart_12>=1)))||((u0.malicious_reservoir>=1)&&(i36.i1.u52.Sstart_13>=1)))||((u0.malicious_reservoir>=1)&&(i27.i0.u51.Sstart_10>=1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12350494923329020900
[2021-05-17 07:17:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12350494923329020900
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/ltsmin12350494923329020900]
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/ltsmin12350494923329020900] 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/ltsmin12350494923329020900] 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-PT-18-03 finished in 45356 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 212 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 07:17:54] [INFO ] Computed 1044 place invariants in 111 ms
[2021-05-17 07:17:56] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 07:17:56] [INFO ] Computed 1044 place invariants in 126 ms
[2021-05-17 07:17:57] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 3182 ms to find 0 implicit places.
[2021-05-17 07:17:57] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 295 rows 1336 cols
[2021-05-17 07:17:58] [INFO ] Computed 1044 place invariants in 95 ms
[2021-05-17 07:17:58] [INFO ] Dead Transitions using invariants and state equation in 472 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1336/1337 places, 295/296 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s80 1)) (OR (LT s0 1) (LT s79 1)) (OR (LT s0 1) (LT s60 1)) (OR (LT s0 1) (LT s61 1)) (OR (LT s0 1) (LT s59 1)) (OR (LT s0 1) (LT s55 1)) (OR (LT s0 1) (LT s68 1)) (OR (LT s0 1) (LT s69 1)) (OR (LT s0 1) (LT s66 1)) (OR (LT s0 1) (LT s67 1)) (OR (LT s0 1) (LT s64 1)) (OR (LT s0 1) (LT s65 1)) (OR (LT s0 1) (LT s62 1)) (OR (LT s0 1) (LT s63 1)) (OR (LT s0 1) (LT s74 1)) (OR (LT s0 1) (LT s72 1)) (OR (LT s0 1) (LT s73 1)) (OR (LT s0 1) (LT s70 1)) (OR (LT s0 1) (LT s71 1))), p0:(AND (OR (LT s134 1) (LT s1163 1)) (OR (LT s121 1) (LT s1160 1)) (OR (LT s126 1) (LT s1302 1)) (OR (LT s136 1) (LT s1298 1)) (OR (LT s118 1) (LT s1155 1)) (OR (LT s123 1) (LT s1297 1)) (OR (LT s129 1) (LT s1168 1)) (OR (LT s115 1) (LT s1170 1)) (OR (LT s131 1) (LT s1166 1)) (OR (LT s135 1) (LT s1299 1)) (OR (LT s133 1) (LT s1164 1)) (OR (LT s116 1) (LT s1169 1)) (OR (LT s124 1) (LT s1296 1)) (OR (LT s117 1) (LT s1156 1)) (OR (LT s120 1) (LT s1157 1)) (OR (LT s122 1) (LT s1159 1)) (OR (LT s130 1) (LT s1167 1)) (OR (LT s119 1) (LT s1158 1)) (OR (LT s132 1) (LT s1165 1)) (OR (LT s127 1) (LT s1304 1) (LT s1305 1) (LT s1306 1) (LT s1307 1) (LT s1308 1) (LT s1309 1) (LT s1312 1) (LT s1313 1) (LT s1314 1) (LT s1315 1) (LT s1316 1) (LT s1317 1) (LT s1318 1) (LT s1319 1) (LT s1323 1) (LT s1324 1) (LT s1325 1) (LT s1326 1) (LT s1327 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 4415 reset in 619 ms.
Product exploration explored 100000 steps with 4424 reset in 707 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-PT-18-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-18-05 finished in 5604 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 34 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 07:18:00] [INFO ] Computed 1044 place invariants in 92 ms
[2021-05-17 07:18:01] [INFO ] Implicit Places using invariants in 1340 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:18:01] [INFO ] Computed 1044 place invariants in 174 ms
[2021-05-17 07:18:03] [INFO ] Implicit Places using invariants and state equation in 2378 ms returned []
Implicit Place search using SMT with State Equation took 3719 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:18:04] [INFO ] Computed 1044 place invariants in 124 ms
[2021-05-17 07:18:04] [INFO ] Dead Transitions using invariants and state equation in 524 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s92 1) (LT s1274 1)) (OR (LT s108 1) (LT s1322 1)) (OR (LT s111 1) (LT s1335 1)) (OR (LT s94 1) (LT s1276 1)) (OR (LT s114 1) (LT s1332 1)) (OR (LT s99 1) (LT s1330 1)) (OR (LT s105 1) (LT s1273 1)) (OR (LT s109 1) (LT s1321 1)) (OR (LT s110 1) (LT s1336 1)) (OR (LT s100 1) (LT s1331 1)) (OR (LT s91 1) (LT s1275 1)) (OR (LT s106 1) (LT s1280 1)) (OR (LT s112 1) (LT s1334 1)) (OR (LT s103 1) (LT s1279 1)) (OR (LT s101 1) (LT s1277 1)) (OR (LT s102 1) (LT s1329 1)) (OR (LT s113 1) (LT s1333 1)) (OR (LT s104 1) (LT s1278 1)) (OR (LT s107 1) (LT s1323 1))), p0:(LT s1268 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 775 ms.
Product exploration explored 100000 steps with 50000 reset in 761 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 92 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 758 ms.
Product exploration explored 100000 steps with 50000 reset in 760 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 96 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 0 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 0 ms
Applied a total of 1 rules in 102 ms. Remains 1337 /1337 variables (removed 0) and now considering 297/296 (removed -1) transitions.
[2021-05-17 07:18:08] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 297 rows 1337 cols
[2021-05-17 07:18:08] [INFO ] Computed 1044 place invariants in 119 ms
[2021-05-17 07:18:08] [INFO ] Dead Transitions using invariants and state equation in 484 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 297/296 transitions.
Product exploration explored 100000 steps with 50000 reset in 3279 ms.
Product exploration explored 100000 steps with 50000 reset in 3533 ms.
[2021-05-17 07:18:15] [INFO ] Flatten gal took : 36 ms
[2021-05-17 07:18:15] [INFO ] Flatten gal took : 28 ms
[2021-05-17 07:18:15] [INFO ] Time to serialize gal into /tmp/LTL603899413763043040.gal : 4 ms
[2021-05-17 07:18:15] [INFO ] Time to serialize properties into /tmp/LTL12634469992574899512.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/LTL603899413763043040.gal, -t, CGAL, -LTL, /tmp/LTL12634469992574899512.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/LTL603899413763043040.gal -t CGAL -LTL /tmp/LTL12634469992574899512.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(Astart<1)"))||(X("((((((((((((((((((((s2_2<1)||(n3_2<1))&&((s2_17<1)||(n3_17<1)))&&((s2_14<1)||(n3_14<1)))&&((s2_0<1)||(n3_0<1)))&&((s2_11<1)||(n3_11<1)))&&((s2_9<1)||(n3_9<1)))&&((s2_3<1)||(n3_3<1)))&&((s2_16<1)||(n3_16<1)))&&((s2_15<1)||(n3_15<1)))&&((s2_10<1)||(n3_10<1)))&&((s2_1<1)||(n3_1<1)))&&((s2_4<1)||(n3_4<1)))&&((s2_13<1)||(n3_13<1)))&&((s2_5<1)||(n3_5<1)))&&((s2_7<1)||(n3_7<1)))&&((s2_8<1)||(n3_8<1)))&&((s2_12<1)||(n3_12<1)))&&((s2_6<1)||(n3_6<1)))&&((s2_18<1)||(n3_18<1)))"))))
Formula 0 simplified : !(G"(Astart<1)" | X"((((((((((((((((((((s2_2<1)||(n3_2<1))&&((s2_17<1)||(n3_17<1)))&&((s2_14<1)||(n3_14<1)))&&((s2_0<1)||(n3_0<1)))&&((s2_11<1)||(n3_11<1)))&&((s2_9<1)||(n3_9<1)))&&((s2_3<1)||(n3_3<1)))&&((s2_16<1)||(n3_16<1)))&&((s2_15<1)||(n3_15<1)))&&((s2_10<1)||(n3_10<1)))&&((s2_1<1)||(n3_1<1)))&&((s2_4<1)||(n3_4<1)))&&((s2_13<1)||(n3_13<1)))&&((s2_5<1)||(n3_5<1)))&&((s2_7<1)||(n3_7<1)))&&((s2_8<1)||(n3_8<1)))&&((s2_12<1)||(n3_12<1)))&&((s2_6<1)||(n3_6<1)))&&((s2_18<1)||(n3_18<1)))")
Detected timeout of ITS tools.
[2021-05-17 07:18:30] [INFO ] Flatten gal took : 60 ms
[2021-05-17 07:18:30] [INFO ] Applying decomposition
[2021-05-17 07:18:30] [INFO ] Flatten gal took : 45 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/graph1872946882149315274.txt, -o, /tmp/graph1872946882149315274.bin, -w, /tmp/graph1872946882149315274.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/graph1872946882149315274.bin, -l, -1, -v, -w, /tmp/graph1872946882149315274.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:18:31] [INFO ] Decomposing Gal with order
[2021-05-17 07:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:18:31] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 07:18:31] [INFO ] Flatten gal took : 89 ms
[2021-05-17 07:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 17 ms.
[2021-05-17 07:18:31] [INFO ] Time to serialize gal into /tmp/LTL8474276394173505616.gal : 8 ms
[2021-05-17 07:18:31] [INFO ] Time to serialize properties into /tmp/LTL213135365977923529.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/LTL8474276394173505616.gal, -t, CGAL, -LTL, /tmp/LTL213135365977923529.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/LTL8474276394173505616.gal -t CGAL -LTL /tmp/LTL213135365977923529.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i21.u58.Astart<1)"))||(X("((((((((((((((((((((i22.i0.u46.s2_2<1)||(i22.i0.u106.n3_2<1))&&((i36.i1.u93.s2_17<1)||(i36.i1.u99.n3_17<1)))&&((i16.i1.u42.s2_14<1)||(i16.i1.u113.n3_14<1)))&&((i13.i1.u34.s2_0<1)||(i13.i1.u105.n3_0<1)))&&((i23.i0.u86.s2_11<1)||(i23.i0.u103.n3_11<1)))&&((i29.i0.u51.s2_9<1)||(i29.i0.u110.n3_9<1)))&&((i30.i1.u45.s2_3<1)||(i30.i1.u107.n3_3<1)))&&((i31.i0.u41.s2_16<1)||(i31.i0.u104.n3_16<1)))&&((i38.i1.u94.s2_15<1)||(i38.i1.u114.n3_15<1)))&&((i28.i0.u54.s2_10<1)||(i28.i0.u37.n3_10<1)))&&((i21.u95.s2_1<1)||(i21.u82.n3_1<1)))&&((i34.i1.u44.s2_4<1)||(i34.i1.u108.n3_4<1)))&&((i24.i1.u55.s2_13<1)||(i24.i1.u97.n3_13<1)))&&((i37.u39.s2_5<1)||(i37.u101.n3_5<1)))&&((i19.i0.u38.s2_7<1)||(i19.i0.u102.n3_7<1)))&&((i14.i1.u52.s2_8<1)||(i14.i1.u109.n3_8<1)))&&((i26.u60.s2_12<1)||(i26.u112.n3_12<1)))&&((i27.i0.u43.s2_6<1)||(i27.i0.u100.n3_6<1)))&&((i20.i1.u40.s2_18<1)||(i20.i1.u98.n3_18<1)))"))))
Formula 0 simplified : !(G"(i21.u58.Astart<1)" | X"((((((((((((((((((((i22.i0.u46.s2_2<1)||(i22.i0.u106.n3_2<1))&&((i36.i1.u93.s2_17<1)||(i36.i1.u99.n3_17<1)))&&((i16.i1.u42.s2_14<1)||(i16.i1.u113.n3_14<1)))&&((i13.i1.u34.s2_0<1)||(i13.i1.u105.n3_0<1)))&&((i23.i0.u86.s2_11<1)||(i23.i0.u103.n3_11<1)))&&((i29.i0.u51.s2_9<1)||(i29.i0.u110.n3_9<1)))&&((i30.i1.u45.s2_3<1)||(i30.i1.u107.n3_3<1)))&&((i31.i0.u41.s2_16<1)||(i31.i0.u104.n3_16<1)))&&((i38.i1.u94.s2_15<1)||(i38.i1.u114.n3_15<1)))&&((i28.i0.u54.s2_10<1)||(i28.i0.u37.n3_10<1)))&&((i21.u95.s2_1<1)||(i21.u82.n3_1<1)))&&((i34.i1.u44.s2_4<1)||(i34.i1.u108.n3_4<1)))&&((i24.i1.u55.s2_13<1)||(i24.i1.u97.n3_13<1)))&&((i37.u39.s2_5<1)||(i37.u101.n3_5<1)))&&((i19.i0.u38.s2_7<1)||(i19.i0.u102.n3_7<1)))&&((i14.i1.u52.s2_8<1)||(i14.i1.u109.n3_8<1)))&&((i26.u60.s2_12<1)||(i26.u112.n3_12<1)))&&((i27.i0.u43.s2_6<1)||(i27.i0.u100.n3_6<1)))&&((i20.i1.u40.s2_18<1)||(i20.i1.u98.n3_18<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3158514003789119007
[2021-05-17 07:18:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3158514003789119007
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/ltsmin3158514003789119007]
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/ltsmin3158514003789119007] 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/ltsmin3158514003789119007] 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-PT-18-06 finished in 47132 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 63 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 07:18:47] [INFO ] Computed 1044 place invariants in 129 ms
[2021-05-17 07:18:48] [INFO ] Implicit Places using invariants in 1397 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:18:48] [INFO ] Computed 1044 place invariants in 92 ms
[2021-05-17 07:18:50] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 3596 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:18:51] [INFO ] Computed 1044 place invariants in 95 ms
[2021-05-17 07:18:51] [INFO ] Dead Transitions using invariants and state equation in 509 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s128 1), p1:(OR (AND (GEQ s78 1) (GEQ s1264 1)) (AND (GEQ s77 1) (GEQ s1265 1)) (AND (GEQ s93 1) (GEQ s1251 1)) (AND (GEQ s86 1) (GEQ s1256 1)) (AND (GEQ s97 1) (GEQ s1254 1)) (AND (GEQ s90 1) (GEQ s1260 1)) (AND (GEQ s75 1) (GEQ s1267 1)) (AND (GEQ s84 1) (GEQ s1258 1)) (AND (GEQ s88 1) (GEQ s1262 1)) (AND (GEQ s95 1) (GEQ s1252 1)) (AND (GEQ s81 1) (GEQ s1311 1)) (AND (GEQ s82 1) (GEQ s1312 1)) (AND (GEQ s76 1) (GEQ s1266 1)) (AND (GEQ s89 1) (GEQ s1261 1)) (AND (GEQ s85 1) (GEQ s1257 1)) (AND (GEQ s96 1) (GEQ s1253 1)) (AND (GEQ s98 1) (GEQ s1255 1)) (AND (GEQ s83 1) (GEQ s1259 1)) (AND (GEQ s87 1) (GEQ s1263 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 4418 reset in 342 ms.
Product exploration explored 100000 steps with 4421 reset in 287 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4420 reset in 188 ms.
Product exploration explored 100000 steps with 4412 reset in 206 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 110 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 61 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2021-05-17 07:18:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:18:53] [INFO ] Computed 1044 place invariants in 168 ms
[2021-05-17 07:18:54] [INFO ] Dead Transitions using invariants and state equation in 699 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Product exploration explored 100000 steps with 4417 reset in 619 ms.
Product exploration explored 100000 steps with 4416 reset in 586 ms.
[2021-05-17 07:18:55] [INFO ] Flatten gal took : 57 ms
[2021-05-17 07:18:55] [INFO ] Flatten gal took : 43 ms
[2021-05-17 07:18:55] [INFO ] Time to serialize gal into /tmp/LTL3442263811257576629.gal : 4 ms
[2021-05-17 07:18:55] [INFO ] Time to serialize properties into /tmp/LTL11114050788111647003.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/LTL3442263811257576629.gal, -t, CGAL, -LTL, /tmp/LTL11114050788111647003.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/LTL3442263811257576629.gal -t CGAL -LTL /tmp/LTL11114050788111647003.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("(a2<1)")||(F("((((((((((((((((((((s3_4>=1)&&(n5_4>=1))||((s3_5>=1)&&(n5_5>=1)))||((s3_18>=1)&&(n5_18>=1)))||((s3_12>=1)&&(n5_12>=1)))||((s3_14>=1)&&(n5_14>=1)))||((s3_8>=1)&&(n5_8>=1)))||((s3_3>=1)&&(n5_3>=1)))||((s3_10>=1)&&(n5_10>=1)))||((s3_6>=1)&&(n5_6>=1)))||((s3_16>=1)&&(n5_16>=1)))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))||((s3_2>=1)&&(n5_2>=1)))||((s3_9>=1)&&(n5_9>=1)))||((s3_13>=1)&&(n5_13>=1)))||((s3_17>=1)&&(n5_17>=1)))||((s3_15>=1)&&(n5_15>=1)))||((s3_11>=1)&&(n5_11>=1)))||((s3_7>=1)&&(n5_7>=1)))"))))||(X(G("(a2<1)")))))
Formula 0 simplified : !(G("(a2<1)" | F"((((((((((((((((((((s3_4>=1)&&(n5_4>=1))||((s3_5>=1)&&(n5_5>=1)))||((s3_18>=1)&&(n5_18>=1)))||((s3_12>=1)&&(n5_12>=1)))||((s3_14>=1)&&(n5_14>=1)))||((s3_8>=1)&&(n5_8>=1)))||((s3_3>=1)&&(n5_3>=1)))||((s3_10>=1)&&(n5_10>=1)))||((s3_6>=1)&&(n5_6>=1)))||((s3_16>=1)&&(n5_16>=1)))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))||((s3_2>=1)&&(n5_2>=1)))||((s3_9>=1)&&(n5_9>=1)))||((s3_13>=1)&&(n5_13>=1)))||((s3_17>=1)&&(n5_17>=1)))||((s3_15>=1)&&(n5_15>=1)))||((s3_11>=1)&&(n5_11>=1)))||((s3_7>=1)&&(n5_7>=1)))") | XG"(a2<1)")
Detected timeout of ITS tools.
[2021-05-17 07:19:10] [INFO ] Flatten gal took : 61 ms
[2021-05-17 07:19:10] [INFO ] Applying decomposition
[2021-05-17 07:19:10] [INFO ] Flatten gal took : 45 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/graph5041317723836608720.txt, -o, /tmp/graph5041317723836608720.bin, -w, /tmp/graph5041317723836608720.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/graph5041317723836608720.bin, -l, -1, -v, -w, /tmp/graph5041317723836608720.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:19:10] [INFO ] Decomposing Gal with order
[2021-05-17 07:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:19:10] [INFO ] Removed a total of 189 redundant transitions.
[2021-05-17 07:19:10] [INFO ] Flatten gal took : 154 ms
[2021-05-17 07:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 31 ms.
[2021-05-17 07:19:10] [INFO ] Time to serialize gal into /tmp/LTL14731344530453791791.gal : 9 ms
[2021-05-17 07:19:10] [INFO ] Time to serialize properties into /tmp/LTL11334716385061958023.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/LTL14731344530453791791.gal, -t, CGAL, -LTL, /tmp/LTL11334716385061958023.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/LTL14731344530453791791.gal -t CGAL -LTL /tmp/LTL11334716385061958023.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("(i36.u54.a2<1)")||(F("((((((((((((((((((((i19.i0.u76.s3_4>=1)&&(i19.i0.u76.n5_4>=1))||((i26.i1.u77.s3_5>=1)&&(i26.i1.u77.n5_5>=1)))||((i33.u82.s3_18>=1)&&(i33.u82.n5_18>=1)))||((i35.i0.u67.s3_12>=1)&&(i35.i0.u67.n5_12>=1)))||((i20.i0.u73.s3_14>=1)&&(i20.i0.u73.n5_14>=1)))||((i27.i0.u71.s3_8>=1)&&(i27.i0.u71.n5_8>=1)))||((i34.i0.u72.s3_3>=1)&&(i34.i0.u72.n5_3>=1)))||((i22.i1.u69.s3_10>=1)&&(i22.i1.u69.n5_10>=1)))||((i37.i0.u74.s3_6>=1)&&(i37.i0.u74.n5_6>=1)))||((i32.i1.u80.s3_16>=1)&&(i32.i1.u80.n5_16>=1)))||((i23.i1.u37.s3_1>=1)&&(i23.i1.u37.n5_1>=1)))||((i38.u102.s3_0>=1)&&(i38.u102.n5_0>=1)))||((i30.i1.u78.s3_2>=1)&&(i30.i1.u78.n5_2>=1)))||((i24.i0.u70.s3_9>=1)&&(i24.i0.u70.n5_9>=1)))||((i28.i0.u66.s3_13>=1)&&(i28.i0.u66.n5_13>=1)))||((i21.i0.u81.s3_17>=1)&&(i21.i0.u81.n5_17>=1)))||((i31.i0.u79.s3_15>=1)&&(i31.i0.u79.n5_15>=1)))||((i36.u68.s3_11>=1)&&(i36.u68.n5_11>=1)))||((i29.u75.s3_7>=1)&&(i29.u75.n5_7>=1)))"))))||(X(G("(i36.u54.a2<1)")))))
Formula 0 simplified : !(G("(i36.u54.a2<1)" | F"((((((((((((((((((((i19.i0.u76.s3_4>=1)&&(i19.i0.u76.n5_4>=1))||((i26.i1.u77.s3_5>=1)&&(i26.i1.u77.n5_5>=1)))||((i33.u82.s3_18>=1)&&(i33.u82.n5_18>=1)))||((i35.i0.u67.s3_12>=1)&&(i35.i0.u67.n5_12>=1)))||((i20.i0.u73.s3_14>=1)&&(i20.i0.u73.n5_14>=1)))||((i27.i0.u71.s3_8>=1)&&(i27.i0.u71.n5_8>=1)))||((i34.i0.u72.s3_3>=1)&&(i34.i0.u72.n5_3>=1)))||((i22.i1.u69.s3_10>=1)&&(i22.i1.u69.n5_10>=1)))||((i37.i0.u74.s3_6>=1)&&(i37.i0.u74.n5_6>=1)))||((i32.i1.u80.s3_16>=1)&&(i32.i1.u80.n5_16>=1)))||((i23.i1.u37.s3_1>=1)&&(i23.i1.u37.n5_1>=1)))||((i38.u102.s3_0>=1)&&(i38.u102.n5_0>=1)))||((i30.i1.u78.s3_2>=1)&&(i30.i1.u78.n5_2>=1)))||((i24.i0.u70.s3_9>=1)&&(i24.i0.u70.n5_9>=1)))||((i28.i0.u66.s3_13>=1)&&(i28.i0.u66.n5_13>=1)))||((i21.i0.u81.s3_17>=1)&&(i21.i0.u81.n5_17>=1)))||((i31.i0.u79.s3_15>=1)&&(i31.i0.u79.n5_15>=1)))||((i36.u68.s3_11>=1)&&(i36.u68.n5_11>=1)))||((i29.u75.s3_7>=1)&&(i29.u75.n5_7>=1)))") | XG"(i36.u54.a2<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin431746904864958060
[2021-05-17 07:19:25] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin431746904864958060
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/ltsmin431746904864958060]
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/ltsmin431746904864958060] 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/ltsmin431746904864958060] 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-PT-18-07 finished in 39712 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 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
Applied a total of 2 rules in 127 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 07:19:27] [INFO ] Computed 1044 place invariants in 85 ms
[2021-05-17 07:19:28] [INFO ] Implicit Places using invariants in 1228 ms returned []
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 07:19:28] [INFO ] Computed 1044 place invariants in 69 ms
[2021-05-17 07:19:30] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned [1155, 1156, 1157, 1158, 1159, 1160, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1295, 1296, 1297, 1298, 1301]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3189 ms to find 19 implicit places.
[2021-05-17 07:19:30] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 294 rows 1316 cols
[2021-05-17 07:19:30] [INFO ] Computed 1026 place invariants in 135 ms
[2021-05-17 07:19:30] [INFO ] Dead Transitions using invariants and state equation in 591 ms returned []
Starting structural reductions, iteration 1 : 1316/1337 places, 294/296 transitions.
Applied a total of 0 rules in 51 ms. Remains 1316 /1316 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2021-05-17 07:19:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 294 rows 1316 cols
[2021-05-17 07:19:31] [INFO ] Computed 1026 place invariants in 125 ms
[2021-05-17 07:19:31] [INFO ] Dead Transitions using invariants and state equation in 483 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1316/1337 places, 294/296 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-09 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-09 finished in 4518 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(F(p0)) U (p1 U X(p2))) U !p3)))], workingDir=/home/mcc/execution]
Support contains 24 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 30 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 07:19:31] [INFO ] Computed 1044 place invariants in 126 ms
[2021-05-17 07:19:32] [INFO ] Implicit Places using invariants in 1216 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:19:32] [INFO ] Computed 1044 place invariants in 93 ms
[2021-05-17 07:19:34] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned []
Implicit Place search using SMT with State Equation took 3197 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:19:34] [INFO ] Computed 1044 place invariants in 92 ms
[2021-05-17 07:19:35] [INFO ] Dead Transitions using invariants and state equation in 489 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 153 ms :[p3, p3, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=p3, acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LT s1268 1), p1:(OR (LT s146 1) (LT s1281 1) (LT s1282 1) (LT s1283 1) (LT s1284 1) (LT s1285 1) (LT s1286 1) (LT s1287 1) (LT s1288 1) (LT s1289 1) (LT s1290 1) (LT s1291 1) (LT s1292 1) (LT s1293 1) (LT s1294 1) (LT s1295 1) (LT s1296 1) (LT s1301 1) (LT s1302 1) (LT s1304 1)), p2:(AND (GEQ s0 1) (GEQ s60 1)), p0:(GEQ s25 1)], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 36 steps with 6 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-10 finished in 3891 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(!p0) U p1)&&(G(p2)||(!p3 U !p0))))], workingDir=/home/mcc/execution]
Support contains 5 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 41 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 07:19:35] [INFO ] Computed 1044 place invariants in 131 ms
[2021-05-17 07:19:36] [INFO ] Implicit Places using invariants in 1245 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:19:36] [INFO ] Computed 1044 place invariants in 94 ms
[2021-05-17 07:19:38] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
[2021-05-17 07:19:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:19:38] [INFO ] Computed 1044 place invariants in 94 ms
[2021-05-17 07:19:39] [INFO ] Dead Transitions using invariants and state equation in 451 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (AND p0 (NOT p2))), true, p0, (NOT p1), (NOT p2), p0, (AND p0 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-11 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2 p3), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p3), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2) p3), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2 p3), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s128 1), p2:(GEQ s129 1), p3:(LT s1268 1), p1:(AND (GEQ s0 1) (GEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-11 finished in 3916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 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 36 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 07:19:39] [INFO ] Computed 1044 place invariants in 89 ms
[2021-05-17 07:19:40] [INFO ] Implicit Places using invariants in 1146 ms returned []
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:19:40] [INFO ] Computed 1044 place invariants in 85 ms
[2021-05-17 07:19:42] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 1337 cols
[2021-05-17 07:19:42] [INFO ] Computed 1044 place invariants in 86 ms
[2021-05-17 07:19:42] [INFO ] Dead Transitions using invariants and state equation in 469 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1337/1337 places, 296/296 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-12 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:(GEQ s127 1), p0:(GEQ s129 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-12 finished in 3594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||G(p1)))&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 3 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 71 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 07:19:43] [INFO ] Computed 1044 place invariants in 87 ms
[2021-05-17 07:19:44] [INFO ] Implicit Places using invariants in 1203 ms returned []
// Phase 1: matrix 293 rows 1334 cols
[2021-05-17 07:19:44] [INFO ] Computed 1044 place invariants in 126 ms
[2021-05-17 07:19:46] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned [1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1294, 1295, 1296, 1297, 1300]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3349 ms to find 19 implicit places.
[2021-05-17 07:19:46] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 293 rows 1315 cols
[2021-05-17 07:19:46] [INFO ] Computed 1026 place invariants in 108 ms
[2021-05-17 07:19:46] [INFO ] Dead Transitions using invariants and state equation in 479 ms returned []
Starting structural reductions, iteration 1 : 1315/1337 places, 293/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1315 /1315 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2021-05-17 07:19:46] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 293 rows 1315 cols
[2021-05-17 07:19:47] [INFO ] Computed 1026 place invariants in 124 ms
[2021-05-17 07:19:47] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1315/1337 places, 293/296 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s21 1), p1:(OR (LT s0 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-14 finished in 4522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 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 0 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 111 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 07:19:47] [INFO ] Computed 1044 place invariants in 87 ms
[2021-05-17 07:19:48] [INFO ] Implicit Places using invariants in 1151 ms returned []
// Phase 1: matrix 294 rows 1335 cols
[2021-05-17 07:19:48] [INFO ] Computed 1044 place invariants in 70 ms
[2021-05-17 07:19:50] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned [1155, 1156, 1157, 1158, 1159, 1160, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1295, 1296, 1297, 1298, 1301]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3163 ms to find 19 implicit places.
[2021-05-17 07:19:50] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 294 rows 1316 cols
[2021-05-17 07:19:50] [INFO ] Computed 1026 place invariants in 126 ms
[2021-05-17 07:19:51] [INFO ] Dead Transitions using invariants and state equation in 530 ms returned []
Starting structural reductions, iteration 1 : 1316/1337 places, 294/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1316 /1316 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2021-05-17 07:19:51] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 294 rows 1316 cols
[2021-05-17 07:19:51] [INFO ] Computed 1026 place invariants in 126 ms
[2021-05-17 07:19:51] [INFO ] Dead Transitions using invariants and state equation in 480 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1316/1337 places, 294/296 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4213 reset in 219 ms.
Product exploration explored 100000 steps with 4213 reset in 235 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1316 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA QuasiCertifProtocol-PT-18-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-18-15 finished in 5113 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1125745913207979590
[2021-05-17 07:19:52] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2021-05-17 07:19:52] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:19:52] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2021-05-17 07:19:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:19:52] [INFO ] Applying decomposition
[2021-05-17 07:19:52] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2021-05-17 07:19:52] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:19:52] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1125745913207979590
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/ltsmin1125745913207979590]
[2021-05-17 07:19:52] [INFO ] Flatten gal took : 57 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/graph11874963373561193572.txt, -o, /tmp/graph11874963373561193572.bin, -w, /tmp/graph11874963373561193572.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/graph11874963373561193572.bin, -l, -1, -v, -w, /tmp/graph11874963373561193572.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:19:52] [INFO ] Decomposing Gal with order
[2021-05-17 07:19:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:19:52] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-17 07:19:53] [INFO ] Flatten gal took : 152 ms
[2021-05-17 07:19:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 46 ms.
[2021-05-17 07:19:53] [INFO ] Time to serialize gal into /tmp/LTLFireability4900717730060562231.gal : 20 ms
[2021-05-17 07:19:53] [INFO ] Time to serialize properties into /tmp/LTLFireability17385354337316480082.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/LTLFireability4900717730060562231.gal, -t, CGAL, -LTL, /tmp/LTLFireability17385354337316480082.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/LTLFireability4900717730060562231.gal -t CGAL -LTL /tmp/LTLFireability17385354337316480082.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(("(i15.i1.u45.a5>=1)")U(X("((((((((((((((((((((u0.malicious_reservoir>=1)&&(i26.i0.u89.Sstart_5>=1))||((u0.malicious_reservoir>=1)&&(i33.i1.u90.Sstart_6>=1)))||((u0.malicious_reservoir>=1)&&(i15.i1.u40.Sstart_7>=1)))||((u0.malicious_reservoir>=1)&&(i30.i0.u88.Sstart_16>=1)))||((u0.malicious_reservoir>=1)&&(i23.u44.Sstart_17>=1)))||((u0.malicious_reservoir>=1)&&(i38.i0.u97.Sstart_0>=1)))||((u0.malicious_reservoir>=1)&&(i29.i1.u94.Sstart_1>=1)))||((u0.malicious_reservoir>=1)&&(i37.i1.u43.Sstart_2>=1)))||((u0.malicious_reservoir>=1)&&(i34.i1.u42.Sstart_3>=1)))||((u0.malicious_reservoir>=1)&&(i25.i1.u41.Sstart_4>=1)))||((u0.malicious_reservoir>=1)&&(i21.i1.u85.Sstart_11>=1)))||((u0.malicious_reservoir>=1)&&(i28.u48.Sstart_8>=1)))||((u0.malicious_reservoir>=1)&&(i19.i1.u47.Sstart_9>=1)))||((u0.malicious_reservoir>=1)&&(i32.i1.u86.Sstart_18>=1)))||((u0.malicious_reservoir>=1)&&(i35.i1.u52.Sstart_14>=1)))||((u0.malicious_reservoir>=1)&&(i36.u51.Sstart_15>=1)))||((u0.malicious_reservoir>=1)&&(i22.u84.Sstart_12>=1)))||((u0.malicious_reservoir>=1)&&(i27.i0.u50.Sstart_13>=1)))||((u0.malicious_reservoir>=1)&&(i24.i0.u49.Sstart_10>=1)))")))))
Formula 0 simplified : !X("(i15.i1.u45.a5>=1)" U X"((((((((((((((((((((u0.malicious_reservoir>=1)&&(i26.i0.u89.Sstart_5>=1))||((u0.malicious_reservoir>=1)&&(i33.i1.u90.Sstart_6>=1)))||((u0.malicious_reservoir>=1)&&(i15.i1.u40.Sstart_7>=1)))||((u0.malicious_reservoir>=1)&&(i30.i0.u88.Sstart_16>=1)))||((u0.malicious_reservoir>=1)&&(i23.u44.Sstart_17>=1)))||((u0.malicious_reservoir>=1)&&(i38.i0.u97.Sstart_0>=1)))||((u0.malicious_reservoir>=1)&&(i29.i1.u94.Sstart_1>=1)))||((u0.malicious_reservoir>=1)&&(i37.i1.u43.Sstart_2>=1)))||((u0.malicious_reservoir>=1)&&(i34.i1.u42.Sstart_3>=1)))||((u0.malicious_reservoir>=1)&&(i25.i1.u41.Sstart_4>=1)))||((u0.malicious_reservoir>=1)&&(i21.i1.u85.Sstart_11>=1)))||((u0.malicious_reservoir>=1)&&(i28.u48.Sstart_8>=1)))||((u0.malicious_reservoir>=1)&&(i19.i1.u47.Sstart_9>=1)))||((u0.malicious_reservoir>=1)&&(i32.i1.u86.Sstart_18>=1)))||((u0.malicious_reservoir>=1)&&(i35.i1.u52.Sstart_14>=1)))||((u0.malicious_reservoir>=1)&&(i36.u51.Sstart_15>=1)))||((u0.malicious_reservoir>=1)&&(i22.u84.Sstart_12>=1)))||((u0.malicious_reservoir>=1)&&(i27.i0.u50.Sstart_13>=1)))||((u0.malicious_reservoir>=1)&&(i24.i0.u49.Sstart_10>=1)))")
Compilation finished in 3584 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1125745913207979590]
Link finished in 79 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/ltsmin1125745913207979590]
LTSmin run took 4194 ms.
FORMULA QuasiCertifProtocol-PT-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/ltsmin1125745913207979590]
LTSmin run took 1923 ms.
FORMULA QuasiCertifProtocol-PT-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/ltsmin1125745913207979590]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.414: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.414: LTL layer: formula: ([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true))))
pins2lts-mc-linux64( 0/ 8), 0.497: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.504: "([](((LTLAPp4==true)||<>((LTLAPp5==true))))||X([]((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.557: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.555: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.559: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.559: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.576: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.565: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.581: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.590: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.673: DFS-FIFO for weak LTL, using special progress label 303
pins2lts-mc-linux64( 0/ 8), 1.673: There are 304 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.673: State length is 1338, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 1.673: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.673: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.673: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.673: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 3.086: ~1 levels ~960 states ~22480 transitions
pins2lts-mc-linux64( 1/ 8), 3.174: ~1 levels ~1920 states ~40992 transitions
pins2lts-mc-linux64( 2/ 8), 3.428: ~1 levels ~3840 states ~90936 transitions
pins2lts-mc-linux64( 4/ 8), 3.671: ~1 levels ~7680 states ~144080 transitions
pins2lts-mc-linux64( 4/ 8), 4.226: ~1 levels ~15360 states ~284304 transitions
pins2lts-mc-linux64( 2/ 8), 5.720: ~1 levels ~30720 states ~860592 transitions
pins2lts-mc-linux64( 2/ 8), 8.067: ~1 levels ~61440 states ~1796064 transitions
pins2lts-mc-linux64( 3/ 8), 13.668: ~1 levels ~122880 states ~3393960 transitions
pins2lts-mc-linux64( 3/ 8), 23.543: ~1 levels ~245760 states ~7099944 transitions
pins2lts-mc-linux64( 1/ 8), 40.792: ~1 levels ~491520 states ~14403824 transitions
pins2lts-mc-linux64( 1/ 8), 81.411: ~1 levels ~983040 states ~29674736 transitions
pins2lts-mc-linux64( 4/ 8), 156.408: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 156.637:
pins2lts-mc-linux64( 0/ 8), 156.637: mean standard work distribution: 6.1% (states) 5.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 156.637:
pins2lts-mc-linux64( 0/ 8), 156.637: Explored 1701846 states 51379055 transitions, fanout: 30.190
pins2lts-mc-linux64( 0/ 8), 156.637: Total exploration time 154.890 sec (154.700 sec minimum, 154.806 sec on average)
pins2lts-mc-linux64( 0/ 8), 156.637: States per second: 10987, Transitions per second: 331713
pins2lts-mc-linux64( 0/ 8), 156.637:
pins2lts-mc-linux64( 0/ 8), 156.637: Progress states detected: 11721718
pins2lts-mc-linux64( 0/ 8), 156.637: Redundant explorations: -85.4814
pins2lts-mc-linux64( 0/ 8), 156.637:
pins2lts-mc-linux64( 0/ 8), 156.637: Queue width: 8B, total height: 14094413, memory: 107.53MB
pins2lts-mc-linux64( 0/ 8), 156.637: Tree memory: 345.4MB, 30.9 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 156.637: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 156.637: Stored 304 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 156.637: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 156.637: Est. total memory use: 453.0MB (~1131.5MB 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/ltsmin1125745913207979590]
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/ltsmin1125745913207979590]
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 07:40:54] [INFO ] Flatten gal took : 333 ms
[2021-05-17 07:40:55] [INFO ] Time to serialize gal into /tmp/LTLFireability10681016315259743712.gal : 47 ms
[2021-05-17 07:40:55] [INFO ] Time to serialize properties into /tmp/LTLFireability8553699820514864014.ltl : 11 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/LTLFireability10681016315259743712.gal, -t, CGAL, -LTL, /tmp/LTLFireability8553699820514864014.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/LTLFireability10681016315259743712.gal -t CGAL -LTL /tmp/LTLFireability8553699820514864014.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("(a2<1)")||(F("((((((((((((((((((((s3_4>=1)&&(n5_4>=1))||((s3_5>=1)&&(n5_5>=1)))||((s3_18>=1)&&(n5_18>=1)))||((s3_12>=1)&&(n5_12>=1)))||((s3_14>=1)&&(n5_14>=1)))||((s3_8>=1)&&(n5_8>=1)))||((s3_3>=1)&&(n5_3>=1)))||((s3_10>=1)&&(n5_10>=1)))||((s3_6>=1)&&(n5_6>=1)))||((s3_16>=1)&&(n5_16>=1)))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))||((s3_2>=1)&&(n5_2>=1)))||((s3_9>=1)&&(n5_9>=1)))||((s3_13>=1)&&(n5_13>=1)))||((s3_17>=1)&&(n5_17>=1)))||((s3_15>=1)&&(n5_15>=1)))||((s3_11>=1)&&(n5_11>=1)))||((s3_7>=1)&&(n5_7>=1)))"))))||(X(G("(a2<1)")))))
Formula 0 simplified : !(G("(a2<1)" | F"((((((((((((((((((((s3_4>=1)&&(n5_4>=1))||((s3_5>=1)&&(n5_5>=1)))||((s3_18>=1)&&(n5_18>=1)))||((s3_12>=1)&&(n5_12>=1)))||((s3_14>=1)&&(n5_14>=1)))||((s3_8>=1)&&(n5_8>=1)))||((s3_3>=1)&&(n5_3>=1)))||((s3_10>=1)&&(n5_10>=1)))||((s3_6>=1)&&(n5_6>=1)))||((s3_16>=1)&&(n5_16>=1)))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))||((s3_2>=1)&&(n5_2>=1)))||((s3_9>=1)&&(n5_9>=1)))||((s3_13>=1)&&(n5_13>=1)))||((s3_17>=1)&&(n5_17>=1)))||((s3_15>=1)&&(n5_15>=1)))||((s3_11>=1)&&(n5_11>=1)))||((s3_7>=1)&&(n5_7>=1)))") | XG"(a2<1)")
Detected timeout of ITS tools.
[2021-05-17 08:01:56] [INFO ] Flatten gal took : 295 ms
[2021-05-17 08:01:58] [INFO ] Input system was already deterministic with 296 transitions.
[2021-05-17 08:01:58] [INFO ] Transformed 1337 places.
[2021-05-17 08:01:58] [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 08:01:58] [INFO ] Time to serialize gal into /tmp/LTLFireability11288917196026958849.gal : 16 ms
[2021-05-17 08:01:58] [INFO ] Time to serialize properties into /tmp/LTLFireability9910620297556218413.ltl : 2 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/LTLFireability11288917196026958849.gal, -t, CGAL, -LTL, /tmp/LTLFireability9910620297556218413.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/LTLFireability11288917196026958849.gal -t CGAL -LTL /tmp/LTLFireability9910620297556218413.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<1)")||(F("((((((((((((((((((((s3_4>=1)&&(n5_4>=1))||((s3_5>=1)&&(n5_5>=1)))||((s3_18>=1)&&(n5_18>=1)))||((s3_12>=1)&&(n5_12>=1)))||((s3_14>=1)&&(n5_14>=1)))||((s3_8>=1)&&(n5_8>=1)))||((s3_3>=1)&&(n5_3>=1)))||((s3_10>=1)&&(n5_10>=1)))||((s3_6>=1)&&(n5_6>=1)))||((s3_16>=1)&&(n5_16>=1)))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))||((s3_2>=1)&&(n5_2>=1)))||((s3_9>=1)&&(n5_9>=1)))||((s3_13>=1)&&(n5_13>=1)))||((s3_17>=1)&&(n5_17>=1)))||((s3_15>=1)&&(n5_15>=1)))||((s3_11>=1)&&(n5_11>=1)))||((s3_7>=1)&&(n5_7>=1)))"))))||(X(G("(a2<1)")))))
Formula 0 simplified : !(G("(a2<1)" | F"((((((((((((((((((((s3_4>=1)&&(n5_4>=1))||((s3_5>=1)&&(n5_5>=1)))||((s3_18>=1)&&(n5_18>=1)))||((s3_12>=1)&&(n5_12>=1)))||((s3_14>=1)&&(n5_14>=1)))||((s3_8>=1)&&(n5_8>=1)))||((s3_3>=1)&&(n5_3>=1)))||((s3_10>=1)&&(n5_10>=1)))||((s3_6>=1)&&(n5_6>=1)))||((s3_16>=1)&&(n5_16>=1)))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))||((s3_2>=1)&&(n5_2>=1)))||((s3_9>=1)&&(n5_9>=1)))||((s3_13>=1)&&(n5_13>=1)))||((s3_17>=1)&&(n5_17>=1)))||((s3_15>=1)&&(n5_15>=1)))||((s3_11>=1)&&(n5_11>=1)))||((s3_7>=1)&&(n5_7>=1)))") | XG"(a2<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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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-PT-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-PT-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-162089415200093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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