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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.7M
-rw-r--r-- 1 mcc users 863K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.0M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 507K 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 24K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Mar 27 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Mar 27 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K 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 1.8M 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-32-00
FORMULA_NAME QuasiCertifProtocol-PT-32-01
FORMULA_NAME QuasiCertifProtocol-PT-32-02
FORMULA_NAME QuasiCertifProtocol-PT-32-03
FORMULA_NAME QuasiCertifProtocol-PT-32-04
FORMULA_NAME QuasiCertifProtocol-PT-32-05
FORMULA_NAME QuasiCertifProtocol-PT-32-06
FORMULA_NAME QuasiCertifProtocol-PT-32-07
FORMULA_NAME QuasiCertifProtocol-PT-32-08
FORMULA_NAME QuasiCertifProtocol-PT-32-09
FORMULA_NAME QuasiCertifProtocol-PT-32-10
FORMULA_NAME QuasiCertifProtocol-PT-32-11
FORMULA_NAME QuasiCertifProtocol-PT-32-12
FORMULA_NAME QuasiCertifProtocol-PT-32-13
FORMULA_NAME QuasiCertifProtocol-PT-32-14
FORMULA_NAME QuasiCertifProtocol-PT-32-15

=== Now, execution of the tool begins

BK_START 1621236662978

Running Version 0
[2021-05-17 07:31:05] [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:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:31:05] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2021-05-17 07:31:05] [INFO ] Transformed 3806 places.
[2021-05-17 07:31:05] [INFO ] Transformed 506 transitions.
[2021-05-17 07:31:05] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 07:31:05] [INFO ] Initial state test concluded for 2 properties.
Support contains 1493 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 259 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2021-05-17 07:31:05] [INFO ] Computed 3232 place invariants in 194 ms
[2021-05-17 07:31:08] [INFO ] Implicit Places using invariants in 2588 ms returned []
// Phase 1: matrix 506 rows 3736 cols
[2021-05-17 07:31:08] [INFO ] Computed 3232 place invariants in 154 ms
[2021-05-17 07:31:15] [INFO ] Implicit Places using invariants and state equation in 6659 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 9281 ms to find 32 implicit places.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:31:15] [INFO ] Computed 3200 place invariants in 106 ms
[2021-05-17 07:31:16] [INFO ] Dead Transitions using invariants and state equation in 1336 ms returned []
Starting structural reductions, iteration 1 : 3704/3806 places, 506/506 transitions.
Applied a total of 0 rules in 156 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:31:16] [INFO ] Computed 3200 place invariants in 95 ms
[2021-05-17 07:31:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:31:17] [INFO ] Dead Transitions using invariants and state equation in 1029 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3704/3806 places, 506/506 transitions.
[2021-05-17 07:31:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 07:31:18] [INFO ] Flatten gal took : 321 ms
FORMULA QuasiCertifProtocol-PT-32-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 07:31:18] [INFO ] Flatten gal took : 150 ms
[2021-05-17 07:31:18] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 100000 steps, including 2678 resets, run finished after 1567 ms. (steps per millisecond=63 ) properties (out of 26) seen :8
Running SMT prover for 18 properties.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:31:20] [INFO ] Computed 3200 place invariants in 92 ms
[2021-05-17 07:31:21] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 899 ms returned sat
[2021-05-17 07:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:22] [INFO ] [Real]Absence check using state equation in 1084 ms returned sat
[2021-05-17 07:31:23] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 132 ms.
[2021-05-17 07:31:24] [INFO ] Added : 33 causal constraints over 7 iterations in 1196 ms. Result :sat
[2021-05-17 07:31:25] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 731 ms returned sat
[2021-05-17 07:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:26] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2021-05-17 07:31:26] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 76 ms.
[2021-05-17 07:31:28] [INFO ] Added : 67 causal constraints over 14 iterations in 1868 ms. Result :sat
[2021-05-17 07:31:30] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 911 ms returned sat
[2021-05-17 07:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:31] [INFO ] [Real]Absence check using state equation in 1609 ms returned unsat
[2021-05-17 07:31:32] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 799 ms returned sat
[2021-05-17 07:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:34] [INFO ] [Real]Absence check using state equation in 1172 ms returned unsat
[2021-05-17 07:31:34] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 582 ms returned sat
[2021-05-17 07:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:35] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2021-05-17 07:31:36] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2021-05-17 07:31:37] [INFO ] Added : 68 causal constraints over 14 iterations in 1899 ms. Result :sat
[2021-05-17 07:31:39] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 728 ms returned sat
[2021-05-17 07:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:40] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2021-05-17 07:31:40] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 40 ms.
[2021-05-17 07:31:41] [INFO ] Added : 33 causal constraints over 7 iterations in 996 ms. Result :sat
[2021-05-17 07:31:42] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 813 ms returned sat
[2021-05-17 07:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:43] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2021-05-17 07:31:44] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 47 ms.
[2021-05-17 07:31:46] [INFO ] Added : 101 causal constraints over 21 iterations in 2768 ms. Result :sat
[2021-05-17 07:31:48] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 816 ms returned sat
[2021-05-17 07:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:49] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2021-05-17 07:31:49] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2021-05-17 07:31:51] [INFO ] Added : 67 causal constraints over 14 iterations in 1977 ms. Result :sat
[2021-05-17 07:31:53] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 821 ms returned sat
[2021-05-17 07:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:54] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2021-05-17 07:31:54] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 79 ms.
[2021-05-17 07:31:56] [INFO ] Added : 68 causal constraints over 14 iterations in 2087 ms. Result :sat
[2021-05-17 07:31:57] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 854 ms returned sat
[2021-05-17 07:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:59] [INFO ] [Real]Absence check using state equation in 1209 ms returned sat
[2021-05-17 07:31:59] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 30 ms.
[2021-05-17 07:32:01] [INFO ] Added : 69 causal constraints over 14 iterations in 2026 ms. Result :sat
[2021-05-17 07:32:02] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 768 ms returned sat
[2021-05-17 07:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:03] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2021-05-17 07:32:03] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2021-05-17 07:32:07] [INFO ] Added : 134 causal constraints over 27 iterations in 4031 ms. Result :sat
[2021-05-17 07:32:09] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 713 ms returned sat
[2021-05-17 07:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:10] [INFO ] [Real]Absence check using state equation in 968 ms returned unsat
[2021-05-17 07:32:11] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 801 ms returned sat
[2021-05-17 07:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:12] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2021-05-17 07:32:12] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 40 ms.
[2021-05-17 07:32:14] [INFO ] Added : 69 causal constraints over 14 iterations in 1657 ms. Result :sat
[2021-05-17 07:32:15] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 762 ms returned sat
[2021-05-17 07:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:16] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2021-05-17 07:32:17] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 30 ms.
[2021-05-17 07:32:18] [INFO ] Added : 34 causal constraints over 7 iterations in 979 ms. Result :sat
[2021-05-17 07:32:19] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 804 ms returned sat
[2021-05-17 07:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:20] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2021-05-17 07:32:20] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2021-05-17 07:32:22] [INFO ] Added : 68 causal constraints over 14 iterations in 1889 ms. Result :sat
[2021-05-17 07:32:23] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 744 ms returned sat
[2021-05-17 07:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:24] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2021-05-17 07:32:25] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2021-05-17 07:32:29] [INFO ] Added : 135 causal constraints over 27 iterations in 4430 ms. Result :sat
[2021-05-17 07:32:30] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 860 ms returned sat
[2021-05-17 07:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:31] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2021-05-17 07:32:32] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 33 ms.
[2021-05-17 07:32:36] [INFO ] Added : 135 causal constraints over 27 iterations in 4052 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2021-05-17 07:32:36] [INFO ] Initial state test concluded for 1 properties.
FORMULA QuasiCertifProtocol-PT-32-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 66 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3702 transition count 504
Applied a total of 4 rules in 888 ms. Remains 3702 /3704 variables (removed 2) and now considering 504/506 (removed 2) transitions.
// Phase 1: matrix 504 rows 3702 cols
[2021-05-17 07:32:37] [INFO ] Computed 3200 place invariants in 87 ms
[2021-05-17 07:32:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:32:40] [INFO ] Implicit Places using invariants in 3151 ms returned []
// Phase 1: matrix 504 rows 3702 cols
[2021-05-17 07:32:40] [INFO ] Computed 3200 place invariants in 91 ms
[2021-05-17 07:32:51] [INFO ] Implicit Places using invariants and state equation in 10768 ms returned [2285]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13929 ms to find 1 implicit places.
[2021-05-17 07:32:51] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 504 rows 3701 cols
[2021-05-17 07:32:52] [INFO ] Computed 3200 place invariants in 712 ms
[2021-05-17 07:32:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:32:52] [INFO ] Dead Transitions using invariants and state equation in 1595 ms returned []
Starting structural reductions, iteration 1 : 3701/3704 places, 504/506 transitions.
Applied a total of 0 rules in 462 ms. Remains 3701 /3701 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2021-05-17 07:32:53] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 504 rows 3701 cols
[2021-05-17 07:32:54] [INFO ] Computed 3200 place invariants in 740 ms
[2021-05-17 07:32:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:32:55] [INFO ] Dead Transitions using invariants and state equation in 1618 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3701/3704 places, 504/506 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s209 1) (LT s3695 1)) (OR (LT s204 1) (LT s3690 1)) (OR (LT s221 1) (LT s3674 1)) (OR (LT s214 1) (LT s3700 1)) (OR (LT s232 1) (LT s3686 1)) (OR (LT s227 1) (LT s3684 1)) (OR (LT s222 1) (LT s3679 1)) (OR (LT s217 1) (LT s3312 1)) (OR (LT s203 1) (LT s3689 1)) (OR (LT s188 1) (LT s3314 1)) (OR (LT s213 1) (LT s3699 1)) (OR (LT s205 1) (LT s3691 1)) (OR (LT s231 1) (LT s3687 1)) (OR (LT s210 1) (LT s3696 1)) (OR (LT s226 1) (LT s3683 1)) (OR (LT s223 1) (LT s3680 1)) (OR (LT s216 1) (LT s3311 1)) (OR (LT s187 1) (LT s3315 1)) (OR (LT s230 1) (LT s3688 1)) (OR (LT s229 1) (LT s3682 1)) (OR (LT s224 1) (LT s3677 1)) (OR (LT s190 1) (LT s3316 1)) (OR (LT s206 1) (LT s3692 1)) (OR (LT s212 1) (LT s3698 1)) (OR (LT s211 1) (LT s3697 1)) (OR (LT s207 1) (LT s3693 1)) (OR (LT s233 1) (LT s3685 1)) (OR (LT s189 1) (LT s3317 1)) (OR (LT s225 1) (LT s3678 1)) (OR (LT s228 1) (LT s3681 1)) (OR (LT s208 1) (LT s3694 1)) (OR (LT s215 1) (LT s3310 1)) (OR (LT s218 1) (LT s3313 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 2675 reset in 796 ms.
Product exploration explored 100000 steps with 2674 reset in 534 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3701 transition count 504
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-PT-32-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-32-00 finished in 21295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1 U G(p2))))], workingDir=/home/mcc/execution]
Support contains 68 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 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 3703 transition count 505
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 3703 transition count 505
Applied a total of 3 rules in 964 ms. Remains 3703 /3704 variables (removed 1) and now considering 505/506 (removed 1) transitions.
// Phase 1: matrix 505 rows 3703 cols
[2021-05-17 07:32:58] [INFO ] Computed 3200 place invariants in 85 ms
[2021-05-17 07:32:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:33:01] [INFO ] Implicit Places using invariants in 2965 ms returned []
// Phase 1: matrix 505 rows 3703 cols
[2021-05-17 07:33:01] [INFO ] Computed 3200 place invariants in 38 ms
[2021-05-17 07:33:11] [INFO ] Implicit Places using invariants and state equation in 9715 ms returned [2286]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12711 ms to find 1 implicit places.
[2021-05-17 07:33:11] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 505 rows 3702 cols
[2021-05-17 07:33:12] [INFO ] Computed 3200 place invariants in 1058 ms
[2021-05-17 07:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:33:13] [INFO ] Dead Transitions using invariants and state equation in 1831 ms returned []
Starting structural reductions, iteration 1 : 3702/3704 places, 505/506 transitions.
Applied a total of 0 rules in 345 ms. Remains 3702 /3702 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2021-05-17 07:33:13] [INFO ] Redundant transitions in 115 ms returned []
// Phase 1: matrix 505 rows 3702 cols
[2021-05-17 07:33:14] [INFO ] Computed 3200 place invariants in 709 ms
[2021-05-17 07:33:15] [INFO ] Dead Transitions using invariants and state equation in 2158 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3702/3704 places, 505/506 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-01 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s219 1) (LT s3574 1) (LT s3575 1) (LT s3576 1) (LT s3577 1) (LT s3582 1) (LT s3583 1) (LT s3584 1) (LT s3585 1) (LT s3586 1) (LT s3587 1) (LT s3588 1) (LT s3589 1) (LT s3590 1) (LT s3591 1) (LT s3592 1) (LT s3593 1) (LT s3594 1) (LT s3595 1) (LT s3596 1) (LT s3597 1) (LT s3598 1) (LT s3599 1) (LT s3600 1) (LT s3601 1) (LT s3602 1) (LT s3603 1) (LT s3604 1) (LT s3605 1) (LT s3608 1) (LT s3610 1) (LT s3611 1) (LT s3612 1) (LT s3613 1)), p0:(GEQ s246 1), p1:(AND (GEQ s246 1) (GEQ s3644 1) (GEQ s3645 1) (GEQ s3646 1) (GEQ s3647 1) (GEQ s3648 1) (GEQ s3649 1) (GEQ s3650 1) (GEQ s3651 1) (GEQ s3652 1) (GEQ s3653 1) (GEQ s3654 1) (GEQ s3655 1) (GEQ s3656 1) (GEQ s3657 1) (GEQ s3658 1) (GEQ s3659 1) (GEQ s3660 1) (GEQ s3661 1) (GEQ s3662 1) (GEQ s3663 1) (GEQ s3664 1) (GEQ s3665 1) (GEQ s3666 1) (GEQ s3667 1) (GEQ s3668 1) (GEQ s3669 1) (GEQ s3670 1) (GEQ s3671 1) (GEQ s3672 1) (GEQ s3673 1) (GEQ s3674 1) (GEQ s3676 1) (GEQ s3677 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2679 reset in 310 ms.
Product exploration explored 100000 steps with 2675 reset in 294 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3702 transition count 505
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 p2)), (F (G (NOT p0))), (F (G (NOT p1))), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2678 reset in 294 ms.
Product exploration explored 100000 steps with 2678 reset in 306 ms.
[2021-05-17 07:33:18] [INFO ] Flatten gal took : 115 ms
[2021-05-17 07:33:18] [INFO ] Flatten gal took : 112 ms
[2021-05-17 07:33:18] [INFO ] Time to serialize gal into /tmp/LTL7594875393744425286.gal : 60 ms
[2021-05-17 07:33:18] [INFO ] Time to serialize properties into /tmp/LTL1178596735403967125.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/LTL7594875393744425286.gal, -t, CGAL, -LTL, /tmp/LTL1178596735403967125.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/LTL7594875393744425286.gal -t CGAL -LTL /tmp/LTL1178596735403967125.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(a1>=1)")U(("((((((((((((((((((((((((((((((((((a1>=1)&&(n2_32>=1))&&(n2_31>=1))&&(n2_30>=1))&&(n2_29>=1))&&(n2_28>=1))&&(n2_27>=1))&&(n2_26>=1))&&(n2_25>=1))&&(n2_24>=1))&&(n2_23>=1))&&(n2_21>=1))&&(n2_22>=1))&&(n2_19>=1))&&(n2_20>=1))&&(n2_17>=1))&&(n2_18>=1))&&(n2_15>=1))&&(n2_16>=1))&&(n2_13>=1))&&(n2_14>=1))&&(n2_11>=1))&&(n2_12>=1))&&(n2_9>=1))&&(n2_10>=1))&&(n2_7>=1))&&(n2_8>=1))&&(n2_4>=1))&&(n2_3>=1))&&(n2_6>=1))&&(n2_5>=1))&&(n2_0>=1))&&(n2_2>=1))&&(n2_1>=1))")U(G("((((((((((((((((((((((((((((((((((a3<1)||(n4_32<1))||(n4_31<1))||(n4_30<1))||(n4_29<1))||(n4_24<1))||(n4_23<1))||(n4_22<1))||(n4_21<1))||(n4_28<1))||(n4_27<1))||(n4_26<1))||(n4_25<1))||(n4_15<1))||(n4_16<1))||(n4_13<1))||(n4_14<1))||(n4_19<1))||(n4_20<1))||(n4_17<1))||(n4_18<1))||(n4_7<1))||(n4_8<1))||(n4_5<1))||(n4_6<1))||(n4_11<1))||(n4_12<1))||(n4_9<1))||(n4_10<1))||(n4_0<1))||(n4_2<1))||(n4_1<1))||(n4_4<1))||(n4_3<1))")))))
Formula 0 simplified : !("(a1>=1)" U ("((((((((((((((((((((((((((((((((((a1>=1)&&(n2_32>=1))&&(n2_31>=1))&&(n2_30>=1))&&(n2_29>=1))&&(n2_28>=1))&&(n2_27>=1))&&(n2_26>=1))&&(n2_25>=1))&&(n2_24>=1))&&(n2_23>=1))&&(n2_21>=1))&&(n2_22>=1))&&(n2_19>=1))&&(n2_20>=1))&&(n2_17>=1))&&(n2_18>=1))&&(n2_15>=1))&&(n2_16>=1))&&(n2_13>=1))&&(n2_14>=1))&&(n2_11>=1))&&(n2_12>=1))&&(n2_9>=1))&&(n2_10>=1))&&(n2_7>=1))&&(n2_8>=1))&&(n2_4>=1))&&(n2_3>=1))&&(n2_6>=1))&&(n2_5>=1))&&(n2_0>=1))&&(n2_2>=1))&&(n2_1>=1))" U G"((((((((((((((((((((((((((((((((((a3<1)||(n4_32<1))||(n4_31<1))||(n4_30<1))||(n4_29<1))||(n4_24<1))||(n4_23<1))||(n4_22<1))||(n4_21<1))||(n4_28<1))||(n4_27<1))||(n4_26<1))||(n4_25<1))||(n4_15<1))||(n4_16<1))||(n4_13<1))||(n4_14<1))||(n4_19<1))||(n4_20<1))||(n4_17<1))||(n4_18<1))||(n4_7<1))||(n4_8<1))||(n4_5<1))||(n4_6<1))||(n4_11<1))||(n4_12<1))||(n4_9<1))||(n4_10<1))||(n4_0<1))||(n4_2<1))||(n4_1<1))||(n4_4<1))||(n4_3<1))"))
Detected timeout of ITS tools.
[2021-05-17 07:33:33] [INFO ] Flatten gal took : 97 ms
[2021-05-17 07:33:33] [INFO ] Applying decomposition
[2021-05-17 07:33:34] [INFO ] Flatten gal took : 144 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/graph1351616136496593259.txt, -o, /tmp/graph1351616136496593259.bin, -w, /tmp/graph1351616136496593259.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/graph1351616136496593259.bin, -l, -1, -v, -w, /tmp/graph1351616136496593259.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:33:35] [INFO ] Decomposing Gal with order
[2021-05-17 07:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:33:36] [INFO ] Removed a total of 395 redundant transitions.
[2021-05-17 07:33:36] [INFO ] Flatten gal took : 964 ms
[2021-05-17 07:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 192 ms.
[2021-05-17 07:33:36] [INFO ] Time to serialize gal into /tmp/LTL8843880450446434016.gal : 77 ms
[2021-05-17 07:33:36] [INFO ] Time to serialize properties into /tmp/LTL2798446876904854641.ltl : 14 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/LTL8843880450446434016.gal, -t, CGAL, -LTL, /tmp/LTL2798446876904854641.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/LTL8843880450446434016.gal -t CGAL -LTL /tmp/LTL2798446876904854641.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("(i54.u93.a1>=1)")U(("((((((((((((((((((((((((((((((((((i54.u93.a1>=1)&&(i34.u84.n2_32>=1))&&(i62.u170.n2_31>=1))&&(i50.u85.n2_30>=1))&&(i35.u86.n2_29>=1))&&(i51.u172.n2_28>=1))&&(i36.u87.n2_27>=1))&&(i52.u173.n2_26>=1))&&(i63.u190.n2_25>=1))&&(i37.u90.n2_24>=1))&&(i53.u174.n2_23>=1))&&(i54.u175.n2_21>=1))&&(i55.u176.n2_22>=1))&&(i49.u73.n2_19>=1))&&(i25.u177.n2_20>=1))&&(i28.u71.n2_17>=1))&&(i64.u72.n2_18>=1))&&(i30.u178.n2_15>=1))&&(i27.u70.n2_16>=1))&&(i65.u75.n2_13>=1))&&(i29.u76.n2_14>=1))&&(i66.u79.n2_11>=1))&&(i56.u179.n2_12>=1))&&(i31.u78.n2_9>=1))&&(i26.u180.n2_10>=1))&&(i33.u82.n2_7>=1))&&(i57.u181.n2_8>=1))&&(i32.u182.n2_4>=1))&&(i58.u66.n2_3>=1))&&(i38.u81.n2_6>=1))&&(i59.u184.n2_5>=1))&&(i23.u65.n2_0>=1))&&(i60.u186.n2_2>=1))&&(i61.u187.n2_1>=1))")U(G("((((((((((((((((((((((((((((((((((i54.u83.a3<1)||(i34.u152.n4_32<1))||(i62.u151.n4_31<1))||(i50.u134.n4_30<1))||(i35.u162.n4_29<1))||(i37.u160.n4_24<1))||(i53.u157.n4_23<1))||(i55.u158.n4_22<1))||(i54.u139.n4_21<1))||(i51.u140.n4_28<1))||(i36.u161.n4_27<1))||(i52.u141.n4_26<1))||(i63.u159.n4_25<1))||(i30.u142.n4_15<1))||(i27.u143.n4_16<1))||(i65.u60.n4_13<1))||(i29.u163.n4_14<1))||(i49.u165.n4_19<1))||(i25.u144.n4_20<1))||(i28.u145.n4_17<1))||(i64.u164.n4_18<1))||(i33.u146.n4_7<1))||(i57.u166.n4_8<1))||(i59.u168.n4_5<1))||(i38.u147.n4_6<1))||(i66.u148.n4_11<1))||(i56.u167.n4_12<1))||(i31.u149.n4_9<1))||(i26.u150.n4_10<1))||(i23.u169.n4_0<1))||(i60.u153.n4_2<1))||(i61.u154.n4_1<1))||(i32.u155.n4_4<1))||(i58.u156.n4_3<1))")))))
Formula 0 simplified : !("(i54.u93.a1>=1)" U ("((((((((((((((((((((((((((((((((((i54.u93.a1>=1)&&(i34.u84.n2_32>=1))&&(i62.u170.n2_31>=1))&&(i50.u85.n2_30>=1))&&(i35.u86.n2_29>=1))&&(i51.u172.n2_28>=1))&&(i36.u87.n2_27>=1))&&(i52.u173.n2_26>=1))&&(i63.u190.n2_25>=1))&&(i37.u90.n2_24>=1))&&(i53.u174.n2_23>=1))&&(i54.u175.n2_21>=1))&&(i55.u176.n2_22>=1))&&(i49.u73.n2_19>=1))&&(i25.u177.n2_20>=1))&&(i28.u71.n2_17>=1))&&(i64.u72.n2_18>=1))&&(i30.u178.n2_15>=1))&&(i27.u70.n2_16>=1))&&(i65.u75.n2_13>=1))&&(i29.u76.n2_14>=1))&&(i66.u79.n2_11>=1))&&(i56.u179.n2_12>=1))&&(i31.u78.n2_9>=1))&&(i26.u180.n2_10>=1))&&(i33.u82.n2_7>=1))&&(i57.u181.n2_8>=1))&&(i32.u182.n2_4>=1))&&(i58.u66.n2_3>=1))&&(i38.u81.n2_6>=1))&&(i59.u184.n2_5>=1))&&(i23.u65.n2_0>=1))&&(i60.u186.n2_2>=1))&&(i61.u187.n2_1>=1))" U G"((((((((((((((((((((((((((((((((((i54.u83.a3<1)||(i34.u152.n4_32<1))||(i62.u151.n4_31<1))||(i50.u134.n4_30<1))||(i35.u162.n4_29<1))||(i37.u160.n4_24<1))||(i53.u157.n4_23<1))||(i55.u158.n4_22<1))||(i54.u139.n4_21<1))||(i51.u140.n4_28<1))||(i36.u161.n4_27<1))||(i52.u141.n4_26<1))||(i63.u159.n4_25<1))||(i30.u142.n4_15<1))||(i27.u143.n4_16<1))||(i65.u60.n4_13<1))||(i29.u163.n4_14<1))||(i49.u165.n4_19<1))||(i25.u144.n4_20<1))||(i28.u145.n4_17<1))||(i64.u164.n4_18<1))||(i33.u146.n4_7<1))||(i57.u166.n4_8<1))||(i59.u168.n4_5<1))||(i38.u147.n4_6<1))||(i66.u148.n4_11<1))||(i56.u167.n4_12<1))||(i31.u149.n4_9<1))||(i26.u150.n4_10<1))||(i23.u169.n4_0<1))||(i60.u153.n4_2<1))||(i61.u154.n4_1<1))||(i32.u155.n4_4<1))||(i58.u156.n4_3<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3186792154897236399
[2021-05-17 07:33:52] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3186792154897236399
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/ltsmin3186792154897236399]
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/ltsmin3186792154897236399] 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/ltsmin3186792154897236399] 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-32-01 finished in 55464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 366 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:33:53] [INFO ] Computed 3200 place invariants in 74 ms
[2021-05-17 07:33:59] [INFO ] Implicit Places using invariants in 5696 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:33:59] [INFO ] Computed 3200 place invariants in 39 ms
[2021-05-17 07:34:10] [INFO ] Implicit Places using invariants and state equation in 11413 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17128 ms to find 1 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:34:11] [INFO ] Computed 3200 place invariants in 587 ms
[2021-05-17 07:34:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:12] [INFO ] Dead Transitions using invariants and state equation in 1526 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 332 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:34:13] [INFO ] Computed 3200 place invariants in 621 ms
[2021-05-17 07:34:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:13] [INFO ] Dead Transitions using invariants and state equation in 1409 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s220 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 7 ms.
FORMULA QuasiCertifProtocol-PT-32-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-03 finished in 20915 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 344 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:34:14] [INFO ] Computed 3200 place invariants in 90 ms
[2021-05-17 07:34:19] [INFO ] Implicit Places using invariants in 5040 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:34:19] [INFO ] Computed 3200 place invariants in 42 ms
[2021-05-17 07:34:29] [INFO ] Implicit Places using invariants and state equation in 10195 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 15250 ms to find 1 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:34:30] [INFO ] Computed 3200 place invariants in 409 ms
[2021-05-17 07:34:31] [INFO ] Dead Transitions using invariants and state equation in 1677 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 296 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:34:32] [INFO ] Computed 3200 place invariants in 501 ms
[2021-05-17 07:34:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:32] [INFO ] Dead Transitions using invariants and state equation in 1249 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-04 finished in 18908 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&(F(G((p1||F(!p2)))) U !p3))))], workingDir=/home/mcc/execution]
Support contains 135 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3704 transition count 506
Applied a total of 1 rules in 504 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:34:33] [INFO ] Computed 3200 place invariants in 49 ms
[2021-05-17 07:34:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:36] [INFO ] Implicit Places using invariants in 3030 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:34:36] [INFO ] Computed 3200 place invariants in 36 ms
[2021-05-17 07:34:47] [INFO ] Implicit Places using invariants and state equation in 10694 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13740 ms to find 1 implicit places.
[2021-05-17 07:34:47] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:34:47] [INFO ] Computed 3200 place invariants in 582 ms
[2021-05-17 07:34:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:48] [INFO ] Dead Transitions using invariants and state equation in 1442 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 291 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2021-05-17 07:34:48] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:34:49] [INFO ] Computed 3200 place invariants in 584 ms
[2021-05-17 07:34:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:50] [INFO ] Dead Transitions using invariants and state equation in 1513 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) p3), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p1) p2 p3)), p3]
Running random walk in product with property : QuasiCertifProtocol-PT-32-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND p3 (NOT p1) p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1 p2) (AND p3 p1 p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND p3 (NOT p1) p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s133 1)) (AND (GEQ s0 1) (GEQ s132 1)) (AND (GEQ s0 1) (GEQ s131 1)) (AND (GEQ s0 1) (GEQ s138 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 s117 1)) (AND (GEQ s0 1) (GEQ s116 1)) (AND (GEQ s0 1) (GEQ s115 1)) (AND (GEQ s0 1) (GEQ s114 1)) (AND (GEQ s0 1) (GEQ s113 1)) (AND (GEQ s0 1) (GEQ s112 1)) (AND (GEQ s0 1) (GEQ s110 1)) (AND (GEQ s0 1) (GEQ s111 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 s100 1)) (AND (GEQ s0 1) (GEQ s101 1)) (AND (GEQ s0 1) (GEQ s99 1)) (AND (GEQ s0 1) (GEQ s108 1)) (AND (GEQ s0 1) (GEQ s109 1)) (AND (GEQ s0 1) (GEQ s106 1)) (AND (GEQ s0 1) (GEQ s107 1)) (AND (GEQ s0 1) (GEQ s104 1)) (AND (GEQ s0 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ s103 1))), p3:(AND (OR (LT s209 1) (LT s3697 1)) (OR (LT s204 1) (LT s3692 1)) (OR (LT s221 1) (LT s3676 1)) (OR (LT s214 1) (LT s3702 1)) (OR (LT s232 1) (LT s3688 1)) (OR (LT s227 1) (LT s3686 1)) (OR (LT s222 1) (LT s3681 1)) (OR (LT s217 1) (LT s3314 1)) (OR (LT s203 1) (LT s3691 1)) (OR (LT s188 1) (LT s3316 1)) (OR (LT s213 1) (LT s3701 1)) (OR (LT s205 1) (LT s3693 1)) (OR (LT s231 1) (LT s3689 1)) (OR (LT s210 1) (LT s3698 1)) (OR (LT s226 1) (LT s3685 1)) (OR (LT s223 1) (LT s3682 1)) (OR (LT s216 1) (LT s3313 1)) (OR (LT s187 1) (LT s3317 1)) (OR (LT s230 1) (LT s3690 1)) (OR (LT s229 1) (LT s3684 1)) (OR (LT s224 1) (LT s3679 1)) (OR (LT s190 1) (LT s3318 1)) (OR (LT s206 1) (LT s3694 1)) (OR (LT s212 1) (LT s3700 1)) (OR (LT s211 1) (LT s3699 1)) (OR (LT s207 1) (LT s3695 1)) (OR (LT s233 1) (LT s3687 1)) (OR (LT s189 1) (LT s3319 1)) (OR (LT s225 1) (LT s3680 1)) (OR (LT s228 1) (LT s3683 1)) (OR (LT s208 1) (LT s3696 1)) (OR (LT s215 1) (LT s3312 1)) (OR (LT s218 1) (LT s3315 1))), p1:(GEQ s248 1), p2:(OR (LT s219 1) (LT s3575 1) (LT s3576 1) (LT s3577 1) (LT s3578 1) (LT s3583 1) (LT s3584 1) (LT s3585 1) (LT s3586 1) (LT s3587 1) (LT s3588 1) (LT s3589 1) (LT s3590 1) (LT s3591 1) (LT s3592 1) (LT s3593 1) (LT s3594 1) (LT s3595 1) (LT s3596 1) (LT s3597 1) (LT s3598 1) (LT s3599 1) (LT s3600 1) (LT s3601 1) (LT s3602 1) (LT s3603 1) (LT s3604 1) (LT s3605 1) (LT s3606 1) (LT s3609 1) (LT s3611 1) (LT s3612 1) (LT s3613 1) (LT s3614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-05 finished in 17806 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(p1||X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 68 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 379 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:34:51] [INFO ] Computed 3200 place invariants in 85 ms
[2021-05-17 07:34:51] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:34:54] [INFO ] Implicit Places using invariants in 3269 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:34:54] [INFO ] Computed 3200 place invariants in 37 ms
[2021-05-17 07:35:04] [INFO ] Implicit Places using invariants and state equation in 10308 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13597 ms to find 1 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:35:05] [INFO ] Computed 3200 place invariants in 408 ms
[2021-05-17 07:35:05] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:35:06] [INFO ] Dead Transitions using invariants and state equation in 1358 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 323 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:35:07] [INFO ] Computed 3200 place invariants in 560 ms
[2021-05-17 07:35:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:35:07] [INFO ] Dead Transitions using invariants and state equation in 1437 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s3512 1), p2:(OR (AND (GEQ s127 1) (GEQ s3579 1)) (AND (GEQ s164 1) (GEQ s3543 1)) (AND (GEQ s141 1) (GEQ s3568 1)) (AND (GEQ s150 1) (GEQ s3559 1)) (AND (GEQ s165 1) (GEQ s3550 1)) (AND (GEQ s168 1) (GEQ s3555 1)) (AND (GEQ s129 1) (GEQ s3563 1)) (AND (GEQ s147 1) (GEQ s3566 1)) (AND (GEQ s128 1) (GEQ s3580 1)) (AND (GEQ s154 1) (GEQ s3571 1)) (AND (GEQ s169 1) (GEQ s3546 1)) (AND (GEQ s130 1) (GEQ s3564 1)) (AND (GEQ s156 1) (GEQ s3551 1)) (AND (GEQ s151 1) (GEQ s3562 1)) (AND (GEQ s142 1) (GEQ s3567 1)) (AND (GEQ s139 1) (GEQ s3574 1)) (AND (GEQ s153 1) (GEQ s3572 1)) (AND (GEQ s166 1) (GEQ s3549 1)) (AND (GEQ s148 1) (GEQ s3565 1)) (AND (GEQ s146 1) (GEQ s3548 1)) (AND (GEQ s157 1) (GEQ s3558 1)) (AND (GEQ s125 1) (GEQ s3581 1)) (AND (GEQ s143 1) (GEQ s3570 1)) (AND (GEQ s167 1) (GEQ s3556 1)) (AND (GEQ s170 1) (GEQ s3545 1)) (AND (GEQ s152 1) (GEQ s3561 1)) (AND (GEQ s126 1) (GEQ s3582 1)) (AND (GEQ s158 1) (GEQ s3557 1)) (AND (GEQ s140 1) (GEQ s3573 1)) (AND (GEQ s145 1) (GEQ s3547 1)) (AND (GEQ s163 1) (GEQ s3544 1)) (AND (GEQ s149 1) (GEQ s3560 1)) (AND (GEQ s144 1) (GEQ s3569 1))), p1:(AND (OR (LT s0 1) (LT s149 1)) (OR (LT s0 1) (LT s148 1)) (OR (LT s0 1) (LT s147 1)) (OR (LT s0 1) (LT s146 1)) (OR (LT s0 1) (LT s145 1)) (OR (LT s0 1) (LT s144 1)) (OR (LT s0 1) (LT s143 1)) (OR (LT s0 1) (LT s142 1)) (OR (LT s0 1) (LT s157 1)) (OR (LT s0 1) (LT s156 1)) (OR (LT s0 1) (LT s154 1)) (OR (LT s0 1) (LT s153 1)) (OR (LT s0 1) (LT s152 1)) (OR (LT s0 1) (LT s151 1)) (OR (LT s0 1) (LT s150 1)) (OR (LT s0 1) (LT s130 1)) (OR (LT s0 1) (LT s129 1)) (OR (LT s0 1) (LT s128 1)) (OR (LT s0 1) (LT s127 1)) (OR (LT s0 1) (LT s126 1)) (OR (LT s0 1) (LT s141 1)) (OR (LT s0 1) (LT s140 1)) (OR (LT s0 1) (LT s139 1)) (OR (LT s0 1) (LT s125 1)) (OR (LT s0 1) (LT s165 1)) (OR (LT s0 1) (LT s164 1)) (OR (LT s0 1) (LT s163 1)) (OR (LT s0 1) (LT s158 1)) (OR (LT s0 1) (LT s170 1)) (OR (LT s0 1) (LT s169 1)) (OR (LT s0 1) (LT s168 1)) (OR (LT s0 1) (LT s167 1)) (OR (LT s0 1) (LT s166 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, 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-32-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-06 finished in 17391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 302 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:35:08] [INFO ] Computed 3200 place invariants in 90 ms
[2021-05-17 07:35:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:35:11] [INFO ] Implicit Places using invariants in 3123 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:35:11] [INFO ] Computed 3200 place invariants in 42 ms
[2021-05-17 07:35:21] [INFO ] Implicit Places using invariants and state equation in 9857 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12984 ms to find 1 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:35:21] [INFO ] Computed 3200 place invariants in 544 ms
[2021-05-17 07:35:23] [INFO ] Dead Transitions using invariants and state equation in 1905 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 247 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:35:24] [INFO ] Computed 3200 place invariants in 552 ms
[2021-05-17 07:35:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:35:24] [INFO ] Dead Transitions using invariants and state equation in 1425 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 125 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s248 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 25000 reset in 1374 ms.
Product exploration explored 100000 steps with 25000 reset in 1234 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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)]
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 1422 ms.
Product exploration explored 100000 steps with 25000 reset in 1289 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 120 ms :[p0, p0, p0, p0, true]
Support contains 1 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3703/3703 places, 506/506 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 3703 transition count 507
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 633 ms. Remains 3703 /3703 variables (removed 0) and now considering 507/506 (removed -1) transitions.
[2021-05-17 07:35:32] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 507 rows 3703 cols
[2021-05-17 07:35:32] [INFO ] Computed 3200 place invariants in 662 ms
[2021-05-17 07:35:33] [INFO ] Dead Transitions using invariants and state equation in 1286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3703/3703 places, 507/506 transitions.
Product exploration explored 100000 steps with 25000 reset in 5950 ms.
Product exploration explored 100000 steps with 25000 reset in 5241 ms.
[2021-05-17 07:35:44] [INFO ] Flatten gal took : 85 ms
[2021-05-17 07:35:44] [INFO ] Flatten gal took : 68 ms
[2021-05-17 07:35:44] [INFO ] Time to serialize gal into /tmp/LTL2288875118626694572.gal : 7 ms
[2021-05-17 07:35:44] [INFO ] Time to serialize properties into /tmp/LTL2103517692960278847.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/LTL2288875118626694572.gal, -t, CGAL, -LTL, /tmp/LTL2103517692960278847.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/LTL2288875118626694572.gal -t CGAL -LTL /tmp/LTL2103517692960278847.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X("(a4<1)")))))
Formula 0 simplified : !XXX"(a4<1)"
Detected timeout of ITS tools.
[2021-05-17 07:36:00] [INFO ] Flatten gal took : 111 ms
[2021-05-17 07:36:00] [INFO ] Applying decomposition
[2021-05-17 07:36:00] [INFO ] Flatten gal took : 91 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/graph10134193319359631976.txt, -o, /tmp/graph10134193319359631976.bin, -w, /tmp/graph10134193319359631976.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/graph10134193319359631976.bin, -l, -1, -v, -w, /tmp/graph10134193319359631976.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:36:00] [INFO ] Decomposing Gal with order
[2021-05-17 07:36:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:36:00] [INFO ] Removed a total of 329 redundant transitions.
[2021-05-17 07:36:01] [INFO ] Flatten gal took : 308 ms
[2021-05-17 07:36:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 74 ms.
[2021-05-17 07:36:01] [INFO ] Time to serialize gal into /tmp/LTL2888708840479104236.gal : 41 ms
[2021-05-17 07:36:01] [INFO ] Time to serialize properties into /tmp/LTL17222094610447087274.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/LTL2888708840479104236.gal, -t, CGAL, -LTL, /tmp/LTL17222094610447087274.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/LTL2888708840479104236.gal -t CGAL -LTL /tmp/LTL17222094610447087274.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X("(i35.i1.u88.a4<1)")))))
Formula 0 simplified : !XXX"(i35.i1.u88.a4<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16833903703317499388
[2021-05-17 07:36:16] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16833903703317499388
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/ltsmin16833903703317499388]
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/ltsmin16833903703317499388] 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/ltsmin16833903703317499388] 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-32-08 finished in 69185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(p0)))))], workingDir=/home/mcc/execution]
Support contains 34 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 418 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:36:17] [INFO ] Computed 3200 place invariants in 74 ms
[2021-05-17 07:36:22] [INFO ] Implicit Places using invariants in 5095 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:36:22] [INFO ] Computed 3200 place invariants in 37 ms
[2021-05-17 07:36:34] [INFO ] Implicit Places using invariants and state equation in 11275 ms returned []
Implicit Place search using SMT with State Equation took 16376 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:36:34] [INFO ] Computed 3200 place invariants in 67 ms
[2021-05-17 07:36:35] [INFO ] Dead Transitions using invariants and state equation in 1453 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3704/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1809 1) (LT s1810 1) (LT s1811 1) (LT s1812 1) (LT s1817 1) (LT s1818 1) (LT s1819 1) (LT s1820 1) (LT s1821 1) (LT s1822 1) (LT s1823 1) (LT s1824 1) (LT s1825 1) (LT s1826 1) (LT s1827 1) (LT s1828 1) (LT s1829 1) (LT s1830 1) (LT s1831 1) (LT s1832 1) (LT s1833 1) (LT s1834 1) (LT s1835 1) (LT s1836 1) (LT s1837 1) (LT s1838 1) (LT s1839 1) (LT s1840 1) (LT s1841 1) (LT s1842 1) (LT s1843 1) (LT s1844 1) (LT s1848 1) (LT s2287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1559 ms.
Product exploration explored 100000 steps with 33333 reset in 1799 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA QuasiCertifProtocol-PT-32-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-32-09 finished in 22287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 34 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3702 transition count 504
Applied a total of 4 rules in 657 ms. Remains 3702 /3704 variables (removed 2) and now considering 504/506 (removed 2) transitions.
// Phase 1: matrix 504 rows 3702 cols
[2021-05-17 07:36:40] [INFO ] Computed 3200 place invariants in 72 ms
[2021-05-17 07:36:45] [INFO ] Implicit Places using invariants in 5608 ms returned []
// Phase 1: matrix 504 rows 3702 cols
[2021-05-17 07:36:45] [INFO ] Computed 3200 place invariants in 38 ms
[2021-05-17 07:36:57] [INFO ] Implicit Places using invariants and state equation in 11471 ms returned [2285]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17091 ms to find 1 implicit places.
[2021-05-17 07:36:57] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 504 rows 3701 cols
[2021-05-17 07:36:57] [INFO ] Computed 3200 place invariants in 461 ms
[2021-05-17 07:36:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:36:58] [INFO ] Dead Transitions using invariants and state equation in 1338 ms returned []
Starting structural reductions, iteration 1 : 3701/3704 places, 504/506 transitions.
Applied a total of 0 rules in 300 ms. Remains 3701 /3701 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2021-05-17 07:36:59] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 504 rows 3701 cols
[2021-05-17 07:36:59] [INFO ] Computed 3200 place invariants in 670 ms
[2021-05-17 07:37:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:00] [INFO ] Dead Transitions using invariants and state equation in 1559 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3701/3704 places, 504/506 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s246 1) (GEQ s3643 1) (GEQ s3644 1) (GEQ s3645 1) (GEQ s3646 1) (GEQ s3647 1) (GEQ s3648 1) (GEQ s3649 1) (GEQ s3650 1) (GEQ s3651 1) (GEQ s3652 1) (GEQ s3653 1) (GEQ s3654 1) (GEQ s3655 1) (GEQ s3656 1) (GEQ s3657 1) (GEQ s3658 1) (GEQ s3659 1) (GEQ s3660 1) (GEQ s3661 1) (GEQ s3662 1) (GEQ s3663 1) (GEQ s3664 1) (GEQ s3665 1) (GEQ s3666 1) (GEQ s3667 1) (GEQ s3668 1) (GEQ s3669 1) (GEQ s3670 1) (GEQ s3671 1) (GEQ s3672 1) (GEQ s3673 1) (GEQ s3675 1) (GEQ s3676 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 38 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-10 finished in 21108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(p0) U ((p1&&X(p0)&&(!p0 U (p2||G(!p0))))||X(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 276 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:01] [INFO ] Computed 3200 place invariants in 81 ms
[2021-05-17 07:37:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:04] [INFO ] Implicit Places using invariants in 3109 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:04] [INFO ] Computed 3200 place invariants in 70 ms
[2021-05-17 07:37:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:07] [INFO ] Implicit Places using invariants and state equation in 3285 ms returned []
Implicit Place search using SMT with State Equation took 6409 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:07] [INFO ] Computed 3200 place invariants in 38 ms
[2021-05-17 07:37:08] [INFO ] Dead Transitions using invariants and state equation in 1322 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3704/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 502 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2 p0), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (GEQ s168 1) (GEQ s3556 1)), p1:(LT s219 1), p2:(AND (LT s248 1) (OR (LT s168 1) (LT s3556 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-12 finished in 8548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)&&G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 331 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:09] [INFO ] Computed 3200 place invariants in 85 ms
[2021-05-17 07:37:14] [INFO ] Implicit Places using invariants in 5249 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:14] [INFO ] Computed 3200 place invariants in 38 ms
[2021-05-17 07:37:25] [INFO ] Implicit Places using invariants and state equation in 10980 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 16235 ms to find 1 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:37:26] [INFO ] Computed 3200 place invariants in 651 ms
[2021-05-17 07:37:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:27] [INFO ] Dead Transitions using invariants and state equation in 1594 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 327 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:37:28] [INFO ] Computed 3200 place invariants in 612 ms
[2021-05-17 07:37:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:29] [INFO ] Dead Transitions using invariants and state equation in 1475 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 1098 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s66 1)), p0:(AND (GEQ s213 1) (GEQ s3701 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-13 finished in 21085 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G((F(p1)&&(G(p0)||p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 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 3701 transition count 503
Applied a total of 4 rules in 626 ms. Remains 3701 /3704 variables (removed 3) and now considering 503/506 (removed 3) transitions.
// Phase 1: matrix 503 rows 3701 cols
[2021-05-17 07:37:31] [INFO ] Computed 3200 place invariants in 96 ms
[2021-05-17 07:37:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:34] [INFO ] Implicit Places using invariants in 3243 ms returned []
// Phase 1: matrix 503 rows 3701 cols
[2021-05-17 07:37:34] [INFO ] Computed 3200 place invariants in 41 ms
[2021-05-17 07:37:45] [INFO ] Implicit Places using invariants and state equation in 11557 ms returned [2285, 3311, 3312, 3313, 3314, 3315, 3316, 3317, 3318, 3674, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699, 3700]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 14805 ms to find 34 implicit places.
[2021-05-17 07:37:45] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 503 rows 3667 cols
[2021-05-17 07:37:47] [INFO ] Computed 3168 place invariants in 1454 ms
[2021-05-17 07:37:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:48] [INFO ] Dead Transitions using invariants and state equation in 2404 ms returned []
Starting structural reductions, iteration 1 : 3667/3704 places, 503/506 transitions.
Applied a total of 0 rules in 300 ms. Remains 3667 /3667 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2021-05-17 07:37:48] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 503 rows 3667 cols
[2021-05-17 07:37:49] [INFO ] Computed 3168 place invariants in 1280 ms
[2021-05-17 07:37:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:50] [INFO ] Dead Transitions using invariants and state equation in 2058 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3667/3704 places, 503/506 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR p0 p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s53 1), p1:(OR (LT s0 1) (LT s186 1)), p2:(OR (LT s0 1) (LT s186 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2579 reset in 518 ms.
Product exploration explored 100000 steps with 2587 reset in 422 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3667 transition count 503
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), (F (G p2)), p0, p1, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (G p0))
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA QuasiCertifProtocol-PT-32-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property QuasiCertifProtocol-PT-32-14 finished in 22307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (G(p1) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3704/3704 places, 506/506 transitions.
Applied a total of 0 rules in 319 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:53] [INFO ] Computed 3200 place invariants in 96 ms
[2021-05-17 07:37:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:37:56] [INFO ] Implicit Places using invariants in 3134 ms returned []
// Phase 1: matrix 506 rows 3704 cols
[2021-05-17 07:37:56] [INFO ] Computed 3200 place invariants in 89 ms
[2021-05-17 07:38:06] [INFO ] Implicit Places using invariants and state equation in 10459 ms returned [2287]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13627 ms to find 1 implicit places.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:38:07] [INFO ] Computed 3200 place invariants in 613 ms
[2021-05-17 07:38:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:38:08] [INFO ] Dead Transitions using invariants and state equation in 1518 ms returned []
Starting structural reductions, iteration 1 : 3703/3704 places, 506/506 transitions.
Applied a total of 0 rules in 289 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2021-05-17 07:38:08] [INFO ] Computed 3200 place invariants in 561 ms
[2021-05-17 07:38:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 07:38:09] [INFO ] Dead Transitions using invariants and state equation in 1477 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3703/3704 places, 506/506 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2)), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-15 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(GEQ s246 1), p1:(OR (GEQ s246 1) (AND (GEQ s0 1) (GEQ s194 1))), p0:(AND (GEQ s0 1) (GEQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-15 finished in 17507 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15728533010659117534
[2021-05-17 07:38:10] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2021-05-17 07:38:10] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:38:10] [INFO ] Applying decomposition
[2021-05-17 07:38:10] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2021-05-17 07:38:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:38:10] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2021-05-17 07:38:10] [INFO ] Flatten gal took : 120 ms
[2021-05-17 07:38:10] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 07:38:10] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15728533010659117534
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/ltsmin15728533010659117534]
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/graph8706869482675155696.txt, -o, /tmp/graph8706869482675155696.bin, -w, /tmp/graph8706869482675155696.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/graph8706869482675155696.bin, -l, -1, -v, -w, /tmp/graph8706869482675155696.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 07:38:10] [INFO ] Decomposing Gal with order
[2021-05-17 07:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 07:38:10] [INFO ] Removed a total of 327 redundant transitions.
[2021-05-17 07:38:10] [INFO ] Flatten gal took : 273 ms
[2021-05-17 07:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 130 ms.
[2021-05-17 07:38:11] [INFO ] Time to serialize gal into /tmp/LTLFireability13815356158880167497.gal : 20 ms
[2021-05-17 07:38:11] [INFO ] Time to serialize properties into /tmp/LTLFireability6773281323676410276.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/LTLFireability13815356158880167497.gal, -t, CGAL, -LTL, /tmp/LTLFireability6773281323676410276.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/LTLFireability13815356158880167497.gal -t CGAL -LTL /tmp/LTLFireability6773281323676410276.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((("(i20.i1.u98.a1>=1)")U(("((((((((((((((((((((((((((((((((((i20.i1.u98.a1>=1)&&(i62.i1.u170.n2_32>=1))&&(i47.u89.n2_31>=1))&&(i48.i0.u171.n2_30>=1))&&(i36.i1.u172.n2_29>=1))&&(i34.i1.u92.n2_28>=1))&&(i49.i0.u174.n2_27>=1))&&(i52.i0.u175.n2_26>=1))&&(i41.u95.n2_25>=1))&&(i54.u176.n2_24>=1))&&(i53.i1.u177.n2_23>=1))&&(i60.u178.n2_21>=1))&&(i27.i1.u96.n2_22>=1))&&(i63.i1.u180.n2_19>=1))&&(i55.i0.u97.n2_20>=1))&&(i39.i1.u80.n2_17>=1))&&(i64.u182.n2_18>=1))&&(i58.i0.u183.n2_15>=1))&&(i42.i1.u79.n2_16>=1))&&(i43.u82.n2_13>=1))&&(i59.i0.u184.n2_14>=1))&&(i45.i0.u85.n2_11>=1))&&(i66.u185.n2_12>=1))&&(i25.i1.u186.n2_9>=1))&&(i44.i0.u84.n2_10>=1))&&(i56.i0.u87.n2_7>=1))&&(i61.u187.n2_8>=1))&&(i37.i0.u188.n2_4>=1))&&(i20.i1.u74.n2_3>=1))&&(i46.u189.n2_6>=1))&&(i51.u190.n2_5>=1))&&(i65.i1.u191.n2_0>=1))&&(i38.i1.u192.n2_2>=1))&&(i40.i1.u73.n2_1>=1))")U(G("((((((((((((((((((((((((((((((((((i20.i1.u99.a3<1)||(i62.i1.u152.n4_32<1))||(i47.u150.n4_31<1))||(i48.i0.u136.n4_30<1))||(i36.i1.u137.n4_29<1))||(i54.u157.n4_24<1))||(i53.i1.u156.n4_23<1))||(i27.i1.u140.n4_22<1))||(i60.u162.n4_21<1))||(i34.i1.u158.n4_28<1))||(i49.i0.u77.n4_27<1))||(i52.i0.u141.n4_26<1))||(i41.u142.n4_25<1))||(i58.i0.u143.n4_15<1))||(i42.i1.u159.n4_16<1))||(i43.u144.n4_13<1))||(i59.i0.u145.n4_14<1))||(i63.i1.u161.n4_19<1))||(i55.i0.u146.n4_20<1))||(i39.i1.u160.n4_17<1))||(i64.u147.n4_18<1))||(i56.i0.u148.n4_7<1))||(i61.u163.n4_8<1))||(i51.u168.n4_5<1))||(i46.u149.n4_6<1))||(i45.i0.u166.n4_11<1))||(i66.u167.n4_12<1))||(i25.i1.u164.n4_9<1))||(i44.i0.u165.n4_10<1))||(i65.i1.u151.n4_0<1))||(i38.i1.u153.n4_2<1))||(i40.i1.u154.n4_1<1))||(i37.i0.u169.n4_4<1))||(i20.i1.u155.n4_3<1))")))))
Formula 0 simplified : !("(i20.i1.u98.a1>=1)" U ("((((((((((((((((((((((((((((((((((i20.i1.u98.a1>=1)&&(i62.i1.u170.n2_32>=1))&&(i47.u89.n2_31>=1))&&(i48.i0.u171.n2_30>=1))&&(i36.i1.u172.n2_29>=1))&&(i34.i1.u92.n2_28>=1))&&(i49.i0.u174.n2_27>=1))&&(i52.i0.u175.n2_26>=1))&&(i41.u95.n2_25>=1))&&(i54.u176.n2_24>=1))&&(i53.i1.u177.n2_23>=1))&&(i60.u178.n2_21>=1))&&(i27.i1.u96.n2_22>=1))&&(i63.i1.u180.n2_19>=1))&&(i55.i0.u97.n2_20>=1))&&(i39.i1.u80.n2_17>=1))&&(i64.u182.n2_18>=1))&&(i58.i0.u183.n2_15>=1))&&(i42.i1.u79.n2_16>=1))&&(i43.u82.n2_13>=1))&&(i59.i0.u184.n2_14>=1))&&(i45.i0.u85.n2_11>=1))&&(i66.u185.n2_12>=1))&&(i25.i1.u186.n2_9>=1))&&(i44.i0.u84.n2_10>=1))&&(i56.i0.u87.n2_7>=1))&&(i61.u187.n2_8>=1))&&(i37.i0.u188.n2_4>=1))&&(i20.i1.u74.n2_3>=1))&&(i46.u189.n2_6>=1))&&(i51.u190.n2_5>=1))&&(i65.i1.u191.n2_0>=1))&&(i38.i1.u192.n2_2>=1))&&(i40.i1.u73.n2_1>=1))" U G"((((((((((((((((((((((((((((((((((i20.i1.u99.a3<1)||(i62.i1.u152.n4_32<1))||(i47.u150.n4_31<1))||(i48.i0.u136.n4_30<1))||(i36.i1.u137.n4_29<1))||(i54.u157.n4_24<1))||(i53.i1.u156.n4_23<1))||(i27.i1.u140.n4_22<1))||(i60.u162.n4_21<1))||(i34.i1.u158.n4_28<1))||(i49.i0.u77.n4_27<1))||(i52.i0.u141.n4_26<1))||(i41.u142.n4_25<1))||(i58.i0.u143.n4_15<1))||(i42.i1.u159.n4_16<1))||(i43.u144.n4_13<1))||(i59.i0.u145.n4_14<1))||(i63.i1.u161.n4_19<1))||(i55.i0.u146.n4_20<1))||(i39.i1.u160.n4_17<1))||(i64.u147.n4_18<1))||(i56.i0.u148.n4_7<1))||(i61.u163.n4_8<1))||(i51.u168.n4_5<1))||(i46.u149.n4_6<1))||(i45.i0.u166.n4_11<1))||(i66.u167.n4_12<1))||(i25.i1.u164.n4_9<1))||(i44.i0.u165.n4_10<1))||(i65.i1.u151.n4_0<1))||(i38.i1.u153.n4_2<1))||(i40.i1.u154.n4_1<1))||(i37.i0.u169.n4_4<1))||(i20.i1.u155.n4_3<1))"))
Compilation finished in 10538 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15728533010659117534]
Link finished in 71 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, -p, --pins-guards, --when, --ltl, ((LTLAPp0==true) U ((LTLAPp1==true) U []((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15728533010659117534]
WARNING : LTSmin timed out (>240 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp0==true) U ((LTLAPp1==true) U []((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15728533010659117534]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(!(LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15728533010659117534]
LTSmin run took 3590 ms.
FORMULA QuasiCertifProtocol-PT-32-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 1920 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp0==true) U ((LTLAPp1==true) U []((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15728533010659117534]
Detected timeout of ITS tools.
[2021-05-17 08:00:33] [INFO ] Flatten gal took : 168 ms
[2021-05-17 08:00:33] [INFO ] Time to serialize gal into /tmp/LTLFireability6274100810120981412.gal : 15 ms
[2021-05-17 08:00:33] [INFO ] Time to serialize properties into /tmp/LTLFireability4966047316456847162.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/LTLFireability6274100810120981412.gal, -t, CGAL, -LTL, /tmp/LTLFireability4966047316456847162.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/LTLFireability6274100810120981412.gal -t CGAL -LTL /tmp/LTLFireability4966047316456847162.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(a1>=1)")U(("((((((((((((((((((((((((((((((((((a1>=1)&&(n2_32>=1))&&(n2_31>=1))&&(n2_30>=1))&&(n2_29>=1))&&(n2_28>=1))&&(n2_27>=1))&&(n2_26>=1))&&(n2_25>=1))&&(n2_24>=1))&&(n2_23>=1))&&(n2_21>=1))&&(n2_22>=1))&&(n2_19>=1))&&(n2_20>=1))&&(n2_17>=1))&&(n2_18>=1))&&(n2_15>=1))&&(n2_16>=1))&&(n2_13>=1))&&(n2_14>=1))&&(n2_11>=1))&&(n2_12>=1))&&(n2_9>=1))&&(n2_10>=1))&&(n2_7>=1))&&(n2_8>=1))&&(n2_4>=1))&&(n2_3>=1))&&(n2_6>=1))&&(n2_5>=1))&&(n2_0>=1))&&(n2_2>=1))&&(n2_1>=1))")U(G("((((((((((((((((((((((((((((((((((a3<1)||(n4_32<1))||(n4_31<1))||(n4_30<1))||(n4_29<1))||(n4_24<1))||(n4_23<1))||(n4_22<1))||(n4_21<1))||(n4_28<1))||(n4_27<1))||(n4_26<1))||(n4_25<1))||(n4_15<1))||(n4_16<1))||(n4_13<1))||(n4_14<1))||(n4_19<1))||(n4_20<1))||(n4_17<1))||(n4_18<1))||(n4_7<1))||(n4_8<1))||(n4_5<1))||(n4_6<1))||(n4_11<1))||(n4_12<1))||(n4_9<1))||(n4_10<1))||(n4_0<1))||(n4_2<1))||(n4_1<1))||(n4_4<1))||(n4_3<1))")))))
Formula 0 simplified : !("(a1>=1)" U ("((((((((((((((((((((((((((((((((((a1>=1)&&(n2_32>=1))&&(n2_31>=1))&&(n2_30>=1))&&(n2_29>=1))&&(n2_28>=1))&&(n2_27>=1))&&(n2_26>=1))&&(n2_25>=1))&&(n2_24>=1))&&(n2_23>=1))&&(n2_21>=1))&&(n2_22>=1))&&(n2_19>=1))&&(n2_20>=1))&&(n2_17>=1))&&(n2_18>=1))&&(n2_15>=1))&&(n2_16>=1))&&(n2_13>=1))&&(n2_14>=1))&&(n2_11>=1))&&(n2_12>=1))&&(n2_9>=1))&&(n2_10>=1))&&(n2_7>=1))&&(n2_8>=1))&&(n2_4>=1))&&(n2_3>=1))&&(n2_6>=1))&&(n2_5>=1))&&(n2_0>=1))&&(n2_2>=1))&&(n2_1>=1))" U G"((((((((((((((((((((((((((((((((((a3<1)||(n4_32<1))||(n4_31<1))||(n4_30<1))||(n4_29<1))||(n4_24<1))||(n4_23<1))||(n4_22<1))||(n4_21<1))||(n4_28<1))||(n4_27<1))||(n4_26<1))||(n4_25<1))||(n4_15<1))||(n4_16<1))||(n4_13<1))||(n4_14<1))||(n4_19<1))||(n4_20<1))||(n4_17<1))||(n4_18<1))||(n4_7<1))||(n4_8<1))||(n4_5<1))||(n4_6<1))||(n4_11<1))||(n4_12<1))||(n4_9<1))||(n4_10<1))||(n4_0<1))||(n4_2<1))||(n4_1<1))||(n4_4<1))||(n4_3<1))"))
WARNING : LTSmin timed out (>1920 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp0==true) U ((LTLAPp1==true) U []((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15728533010659117534]
Detected timeout of ITS tools.
[2021-05-17 08:22:54] [INFO ] Flatten gal took : 126 ms
[2021-05-17 08:22:54] [INFO ] Input system was already deterministic with 506 transitions.
[2021-05-17 08:22:54] [INFO ] Transformed 3704 places.
[2021-05-17 08:22:54] [INFO ] Transformed 506 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:22:55] [INFO ] Time to serialize gal into /tmp/LTLFireability8541068336418992492.gal : 15 ms
[2021-05-17 08:22:55] [INFO ] Time to serialize properties into /tmp/LTLFireability5095489497114530742.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/LTLFireability8541068336418992492.gal, -t, CGAL, -LTL, /tmp/LTLFireability5095489497114530742.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/LTLFireability8541068336418992492.gal -t CGAL -LTL /tmp/LTLFireability5095489497114530742.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 : !((("(a1>=1)")U(("((((((((((((((((((((((((((((((((((a1>=1)&&(n2_32>=1))&&(n2_31>=1))&&(n2_30>=1))&&(n2_29>=1))&&(n2_28>=1))&&(n2_27>=1))&&(n2_26>=1))&&(n2_25>=1))&&(n2_24>=1))&&(n2_23>=1))&&(n2_21>=1))&&(n2_22>=1))&&(n2_19>=1))&&(n2_20>=1))&&(n2_17>=1))&&(n2_18>=1))&&(n2_15>=1))&&(n2_16>=1))&&(n2_13>=1))&&(n2_14>=1))&&(n2_11>=1))&&(n2_12>=1))&&(n2_9>=1))&&(n2_10>=1))&&(n2_7>=1))&&(n2_8>=1))&&(n2_4>=1))&&(n2_3>=1))&&(n2_6>=1))&&(n2_5>=1))&&(n2_0>=1))&&(n2_2>=1))&&(n2_1>=1))")U(G("((((((((((((((((((((((((((((((((((a3<1)||(n4_32<1))||(n4_31<1))||(n4_30<1))||(n4_29<1))||(n4_24<1))||(n4_23<1))||(n4_22<1))||(n4_21<1))||(n4_28<1))||(n4_27<1))||(n4_26<1))||(n4_25<1))||(n4_15<1))||(n4_16<1))||(n4_13<1))||(n4_14<1))||(n4_19<1))||(n4_20<1))||(n4_17<1))||(n4_18<1))||(n4_7<1))||(n4_8<1))||(n4_5<1))||(n4_6<1))||(n4_11<1))||(n4_12<1))||(n4_9<1))||(n4_10<1))||(n4_0<1))||(n4_2<1))||(n4_1<1))||(n4_4<1))||(n4_3<1))")))))
Formula 0 simplified : !("(a1>=1)" U ("((((((((((((((((((((((((((((((((((a1>=1)&&(n2_32>=1))&&(n2_31>=1))&&(n2_30>=1))&&(n2_29>=1))&&(n2_28>=1))&&(n2_27>=1))&&(n2_26>=1))&&(n2_25>=1))&&(n2_24>=1))&&(n2_23>=1))&&(n2_21>=1))&&(n2_22>=1))&&(n2_19>=1))&&(n2_20>=1))&&(n2_17>=1))&&(n2_18>=1))&&(n2_15>=1))&&(n2_16>=1))&&(n2_13>=1))&&(n2_14>=1))&&(n2_11>=1))&&(n2_12>=1))&&(n2_9>=1))&&(n2_10>=1))&&(n2_7>=1))&&(n2_8>=1))&&(n2_4>=1))&&(n2_3>=1))&&(n2_6>=1))&&(n2_5>=1))&&(n2_0>=1))&&(n2_2>=1))&&(n2_1>=1))" U G"((((((((((((((((((((((((((((((((((a3<1)||(n4_32<1))||(n4_31<1))||(n4_30<1))||(n4_29<1))||(n4_24<1))||(n4_23<1))||(n4_22<1))||(n4_21<1))||(n4_28<1))||(n4_27<1))||(n4_26<1))||(n4_25<1))||(n4_15<1))||(n4_16<1))||(n4_13<1))||(n4_14<1))||(n4_19<1))||(n4_20<1))||(n4_17<1))||(n4_18<1))||(n4_7<1))||(n4_8<1))||(n4_5<1))||(n4_6<1))||(n4_11<1))||(n4_12<1))||(n4_9<1))||(n4_10<1))||(n4_0<1))||(n4_2<1))||(n4_1<1))||(n4_4<1))||(n4_3<1))"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
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-32, 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-162089415300117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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