Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900476.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 PermAdmissibility-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-05-00
FORMULA_NAME PermAdmissibility-COL-05-01
FORMULA_NAME PermAdmissibility-COL-05-02
FORMULA_NAME PermAdmissibility-COL-05-03
FORMULA_NAME PermAdmissibility-COL-05-04
FORMULA_NAME PermAdmissibility-COL-05-05
FORMULA_NAME PermAdmissibility-COL-05-06
FORMULA_NAME PermAdmissibility-COL-05-07
FORMULA_NAME PermAdmissibility-COL-05-08
FORMULA_NAME PermAdmissibility-COL-05-09
FORMULA_NAME PermAdmissibility-COL-05-10
FORMULA_NAME PermAdmissibility-COL-05-11
FORMULA_NAME PermAdmissibility-COL-05-12
FORMULA_NAME PermAdmissibility-COL-05-13
FORMULA_NAME PermAdmissibility-COL-05-14
FORMULA_NAME PermAdmissibility-COL-05-15

=== Now, execution of the tool begins

BK_START 1620987848139

Running Version 0
[2021-05-14 10:24:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-14 10:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 10:24:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 10:24:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 10:24:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2021-05-14 10:24:10] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-05-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 10:24:10] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 4 ms.
[2021-05-14 10:24:10] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_16502015823325971558.dot
[2021-05-14 10:24:10] [INFO ] Initial state test concluded for 5 properties.
FORMULA PermAdmissibility-COL-05-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100001 steps, including 1030 resets, run finished after 130 ms. (steps per millisecond=769 ) properties (out of 24) seen :23
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 10:24:10] [INFO ] Computed 24 place invariants in 10 ms
[2021-05-14 10:24:10] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-14 10:24:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 10:24:10] [INFO ] Flatten gal took : 21 ms
FORMULA PermAdmissibility-COL-05-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 10:24:10] [INFO ] Flatten gal took : 5 ms
[2021-05-14 10:24:10] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 11 ms.
[2021-05-14 10:24:10] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_4655303002805772996.dot
[2021-05-14 10:24:10] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 432 transitions.
Support contains 116 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 152 transition count 592
Applied a total of 16 rules in 20 ms. Remains 152 /168 variables (removed 16) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 10:24:10] [INFO ] Computed 23 place invariants in 29 ms
[2021-05-14 10:24:10] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 10:24:10] [INFO ] Computed 23 place invariants in 22 ms
[2021-05-14 10:24:11] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 152 cols
[2021-05-14 10:24:11] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-14 10:24:11] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/168 places, 592/592 transitions.
[2021-05-14 10:24:11] [INFO ] Flatten gal took : 74 ms
[2021-05-14 10:24:11] [INFO ] Flatten gal took : 65 ms
[2021-05-14 10:24:11] [INFO ] Input system was already deterministic with 592 transitions.
Finished random walk after 96 steps, including 0 resets, run visited all 21 properties in 2 ms. (steps per millisecond=48 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (F(G(p0))||(G(p1)&&(p0||F(G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 76 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 104 place count 76 transition count 340
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 125 place count 55 transition count 102
Iterating global reduction 1 with 21 rules applied. Total rules applied 146 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 52 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 52 transition count 78
Applied a total of 152 rules in 25 ms. Remains 52 /152 variables (removed 100) and now considering 78/592 (removed 514) transitions.
// Phase 1: matrix 78 rows 52 cols
[2021-05-14 10:24:11] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 10:24:11] [INFO ] Implicit Places using invariants in 67 ms returned [12, 13, 14, 31, 44, 45, 47, 48]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 70 ms to find 8 implicit places.
// Phase 1: matrix 78 rows 44 cols
[2021-05-14 10:24:11] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-14 10:24:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 44/152 places, 78/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 44 cols
[2021-05-14 10:24:11] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-14 10:24:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 44/152 places, 78/592 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s0 (ADD s4 s5 s6 s7 s8 s9 s10 s11)), p1:(GT s42 (ADD s24 s25 s26 s27))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-05-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-00 finished in 514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 8 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Graph (complete) has 1455 edges and 152 vertex of which 112 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Discarding 40 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 91 transition count 354
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 57 place count 77 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 77 transition count 228
Applied a total of 71 rules in 35 ms. Remains 77 /152 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 10:24:12] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 10:24:12] [INFO ] Implicit Places using invariants in 70 ms returned [4, 13, 54, 55, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
[2021-05-14 10:24:12] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 10:24:12] [INFO ] Computed 12 place invariants in 13 ms
[2021-05-14 10:24:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 72/152 places, 228/592 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 70 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 70 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 69 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 20 ms. Remains 68 /72 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 10:24:12] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:12] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 10:24:12] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 10:24:12] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/152 places, 224/592 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 (ADD s60 s61 s62 s63 s64 s65 s66 s67))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-01 finished in 439 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1 U X(p2))))], workingDir=/home/mcc/execution]
Support contains 34 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 120 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 106 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 106 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 92 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 88 place count 92 transition count 242
Applied a total of 88 rules in 9 ms. Remains 92 /152 variables (removed 60) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 92 cols
[2021-05-14 10:24:12] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-14 10:24:12] [INFO ] Implicit Places using invariants in 65 ms returned [4, 13, 62, 72]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
// Phase 1: matrix 242 rows 88 cols
[2021-05-14 10:24:12] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 10:24:12] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 88/152 places, 242/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 88 cols
[2021-05-14 10:24:12] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 10:24:12] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 2 iterations. Remains : 88/152 places, 242/592 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s36 s37 s38 s39)), p0:(LEQ (ADD s72 s73 s74 s75 s76 s77 s78 s79) (ADD s45 s46 s47 s48)), p2:(LEQ (ADD s28 s29) (ADD s80 s81 s82 s83 s84 s85 s86 s87))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 254 steps with 5 reset in 4 ms.
FORMULA PermAdmissibility-COL-05-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-03 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (p1&&F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 24 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Graph (complete) has 1455 edges and 152 vertex of which 112 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 98 transition count 368
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 84 transition count 242
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 84 transition count 242
Applied a total of 57 rules in 18 ms. Remains 84 /152 variables (removed 68) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2021-05-14 10:24:13] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 10:24:13] [INFO ] Implicit Places using invariants in 61 ms returned [4, 13, 62, 72]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
[2021-05-14 10:24:13] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 242 rows 80 cols
[2021-05-14 10:24:13] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 10:24:13] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 80/152 places, 242/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 80 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 79 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 79 transition count 240
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 78 transition count 240
Applied a total of 4 rules in 12 ms. Remains 78 /80 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 78 cols
[2021-05-14 10:24:13] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 10:24:13] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 240 rows 78 cols
[2021-05-14 10:24:13] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 10:24:13] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 78/152 places, 240/592 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Running random walk in product with property : PermAdmissibility-COL-05-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 (ADD s59 s60 s61 s62 s63 s64 s65 s66)), p0:(GT (ADD s10 s11 s12 s13 s14 s15 s16 s17) (ADD s70 s71 s72 s73 s74 s75 s76 s77))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7141 steps with 237 reset in 66 ms.
FORMULA PermAdmissibility-COL-05-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-05 finished in 543 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 16 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Graph (complete) has 1455 edges and 152 vertex of which 112 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 91 transition count 354
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 57 place count 77 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 77 transition count 228
Applied a total of 71 rules in 17 ms. Remains 77 /152 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 10:24:13] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 10:24:13] [INFO ] Implicit Places using invariants in 63 ms returned [12, 21, 54, 64, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 65 ms to find 5 implicit places.
[2021-05-14 10:24:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 10:24:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:13] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 72/152 places, 228/592 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 70 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 70 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 69 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 12 ms. Remains 68 /72 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 10:24:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:13] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 10:24:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/152 places, 224/592 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s51 s52 s53 s54 s55 s56 s57 s58)), p1:(GT 2 (ADD s60 s61 s62 s63 s64 s65 s66 s67))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-07 finished in 443 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 76 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 104 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 132 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 160 place count 48 transition count 88
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 172 place count 36 transition count 28
Iterating global reduction 1 with 12 rules applied. Total rules applied 184 place count 36 transition count 28
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 187 place count 33 transition count 18
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 191 place count 32 transition count 18
Applied a total of 191 rules in 9 ms. Remains 32 /152 variables (removed 120) and now considering 18/592 (removed 574) transitions.
// Phase 1: matrix 18 rows 32 cols
[2021-05-14 10:24:14] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 10:24:14] [INFO ] Implicit Places using invariants in 28 ms returned [4, 5, 6, 7, 12, 15, 16, 17, 18, 20, 24, 25, 27, 28]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 29 ms to find 14 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2021-05-14 10:24:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:24:14] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 18/152 places, 18/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2021-05-14 10:24:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:24:14] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/152 places, 18/592 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2839 reset in 215 ms.
Product exploration explored 100000 steps with 2849 reset in 165 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
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 (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2834 reset in 118 ms.
Product exploration explored 100000 steps with 2851 reset in 155 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 18/18 places, 18/18 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 18 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 9 place count 18 transition count 18
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 18 transition count 18
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 22 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 7 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 7 transition count 7
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 7 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 6 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 6 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 38 rules in 2 ms. Remains 6 /18 variables (removed 12) and now considering 7/18 (removed 11) transitions.
[2021-05-14 10:24:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-14 10:24:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:24:15] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/18 places, 7/18 transitions.
Product exploration explored 100000 steps with 8333 reset in 257 ms.
Product exploration explored 100000 steps with 8333 reset in 255 ms.
[2021-05-14 10:24:15] [INFO ] Flatten gal took : 1 ms
[2021-05-14 10:24:15] [INFO ] Flatten gal took : 1 ms
[2021-05-14 10:24:15] [INFO ] Time to serialize gal into /tmp/LTL1104271505959942017.gal : 0 ms
[2021-05-14 10:24:15] [INFO ] Time to serialize properties into /tmp/LTL12281496569732890226.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/LTL1104271505959942017.gal, -t, CGAL, -LTL, /tmp/LTL12281496569732890226.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/LTL1104271505959942017.gal -t CGAL -LTL /tmp/LTL12281496569732890226.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((in2_2+in2_3)<1)"))))
Formula 0 simplified : !XF"((in2_2+in2_3)<1)"
Reverse transition relation is NOT exact ! Due to transitions t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
28 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.309681,24096,1,0,350,50493,60,224,533,55988,715
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-05-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-05-08 finished in 2204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 11 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 112 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 61 place count 91 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 96 place count 77 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 110 place count 77 transition count 228
Applied a total of 110 rules in 17 ms. Remains 77 /152 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 10:24:16] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 10:24:16] [INFO ] Implicit Places using invariants in 68 ms returned [4, 13, 54, 55, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 10:24:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:16] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 72/152 places, 228/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 10:24:16] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-14 10:24:16] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/152 places, 228/592 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s26 s27) s63), p0:(LEQ 1 (ADD s64 s65 s66 s67 s68 s69 s70 s71))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2629 reset in 407 ms.
Product exploration explored 100000 steps with 2650 reset in 422 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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 (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2651 reset in 406 ms.
Product exploration explored 100000 steps with 2660 reset in 442 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 11 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 72/72 places, 228/228 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 72 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 71 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 71 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 5 rules in 13 ms. Remains 71 /72 variables (removed 1) and now considering 227/228 (removed 1) transitions.
[2021-05-14 10:24:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 227 rows 71 cols
[2021-05-14 10:24:18] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:18] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/72 places, 227/228 transitions.
Product exploration explored 100000 steps with 3017 reset in 475 ms.
Product exploration explored 100000 steps with 3004 reset in 487 ms.
[2021-05-14 10:24:19] [INFO ] Flatten gal took : 18 ms
[2021-05-14 10:24:19] [INFO ] Flatten gal took : 19 ms
[2021-05-14 10:24:19] [INFO ] Time to serialize gal into /tmp/LTL4169205082996280079.gal : 3 ms
[2021-05-14 10:24:19] [INFO ] Time to serialize properties into /tmp/LTL5482926192132903123.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/LTL4169205082996280079.gal, -t, CGAL, -LTL, /tmp/LTL5482926192132903123.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/LTL4169205082996280079.gal -t CGAL -LTL /tmp/LTL5482926192132903123.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("((((((((out3_0+out3_1)+out3_2)+out3_3)+out3_4)+out3_5)+out3_6)+out3_7)>=1)")))&&(F("((in3_4+in3_5)<=c19_0)")))))
Formula 0 simplified : !X(XF"((((((((out3_0+out3_1)+out3_2)+out3_3)+out3_4)+out3_5)+out3_6)+out3_7)>=1)" & F"((in3_4+in3_5)<=c19_0)")
Detected timeout of ITS tools.
[2021-05-14 10:24:35] [INFO ] Flatten gal took : 19 ms
[2021-05-14 10:24:35] [INFO ] Applying decomposition
[2021-05-14 10:24:35] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11476079632806928505.txt, -o, /tmp/graph11476079632806928505.bin, -w, /tmp/graph11476079632806928505.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/graph11476079632806928505.bin, -l, -1, -v, -w, /tmp/graph11476079632806928505.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:24:35] [INFO ] Decomposing Gal with order
[2021-05-14 10:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:24:35] [INFO ] Removed a total of 38 redundant transitions.
[2021-05-14 10:24:35] [INFO ] Flatten gal took : 63 ms
[2021-05-14 10:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2021-05-14 10:24:35] [INFO ] Time to serialize gal into /tmp/LTL4360526526357119712.gal : 74 ms
[2021-05-14 10:24:35] [INFO ] Time to serialize properties into /tmp/LTL914123794845589726.ltl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4360526526357119712.gal, -t, CGAL, -LTL, /tmp/LTL914123794845589726.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/LTL4360526526357119712.gal -t CGAL -LTL /tmp/LTL914123794845589726.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("((((((((gu5.out3_0+gu5.out3_1)+gu5.out3_2)+gu5.out3_3)+gu5.out3_4)+gu5.out3_5)+gu5.out3_6)+gu5.out3_7)>=1)")))&&(F("((gu2.in3_4+gu2.in3_5)<=gu2.c19_0)")))))
Formula 0 simplified : !X(XF"((((((((gu5.out3_0+gu5.out3_1)+gu5.out3_2)+gu5.out3_3)+gu5.out3_4)+gu5.out3_5)+gu5.out3_6)+gu5.out3_7)>=1)" & F"((gu2.in3_4+gu2.in3_5)<=gu2.c19_0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12224028429160801896
[2021-05-14 10:24:50] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12224028429160801896
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/ltsmin12224028429160801896]
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/ltsmin12224028429160801896] 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/ltsmin12224028429160801896] 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 PermAdmissibility-COL-05-09 finished in 35170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&X(X(p2))))], workingDir=/home/mcc/execution]
Support contains 12 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 69 place count 83 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 90 place count 83 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 104 place count 69 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 69 transition count 228
Applied a total of 118 rules in 5 ms. Remains 69 /152 variables (removed 83) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 69 cols
[2021-05-14 10:24:51] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 10:24:51] [INFO ] Implicit Places using invariants in 81 ms returned [4, 13, 54, 55, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 81 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 10:24:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 10:24:51] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Starting structural reductions, iteration 1 : 64/152 places, 228/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 10:24:51] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 10:24:51] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/152 places, 228/592 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s23), p0:(GT (ADD s26 s27) s49), p2:(LEQ 3 (ADD s53 s54 s55 s56 s57 s58 s59 s60))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-10 finished in 451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 11 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 112 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 61 place count 91 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 96 place count 77 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 110 place count 77 transition count 228
Applied a total of 110 rules in 5 ms. Remains 77 /152 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 10:24:51] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-14 10:24:52] [INFO ] Implicit Places using invariants in 69 ms returned [12, 21, 54, 55, 57]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 10:24:52] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 10:24:52] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 72/152 places, 228/592 transitions.
Applied a total of 0 rules in 7 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 10:24:52] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-14 10:24:52] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/152 places, 228/592 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s2), p1:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71) (ADD s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-13 finished in 361 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(X(F(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 8 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 592/592 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 76 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 104 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 132 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 160 place count 48 transition count 88
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 39 transition count 34
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 39 transition count 34
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 38 transition count 30
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 38 transition count 30
Applied a total of 180 rules in 4 ms. Remains 38 /152 variables (removed 114) and now considering 30/592 (removed 562) transitions.
// Phase 1: matrix 30 rows 38 cols
[2021-05-14 10:24:52] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 10:24:52] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5, 6, 7, 16, 19, 24, 26, 30, 31, 33, 34]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 34 ms to find 12 implicit places.
// Phase 1: matrix 30 rows 26 cols
[2021-05-14 10:24:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 10:24:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 26/152 places, 30/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 26 cols
[2021-05-14 10:24:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:24:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 26/152 places, 30/592 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-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 p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s12 s13) s22), p0:(GT 3 s6), p1:(LEQ 1 (ADD s14 s15 s16 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2083 reset in 178 ms.
Product exploration explored 100000 steps with 2086 reset in 209 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 30
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 (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (NOT p2), p0, (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2120 reset in 155 ms.
Product exploration explored 100000 steps with 2141 reset in 168 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 26/26 places, 30/30 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 26 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 26 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 26 transition count 30
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 24 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 24 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 24 transition count 28
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 21 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 21 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 18 rules in 2 ms. Remains 21 /26 variables (removed 5) and now considering 25/30 (removed 5) transitions.
[2021-05-14 10:24:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 21 cols
[2021-05-14 10:24:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 10:24:53] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/26 places, 25/30 transitions.
Product exploration explored 100000 steps with 2146 reset in 171 ms.
Product exploration explored 100000 steps with 2098 reset in 182 ms.
[2021-05-14 10:24:54] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:24:54] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:24:54] [INFO ] Time to serialize gal into /tmp/LTL2157141943633134414.gal : 1 ms
[2021-05-14 10:24:54] [INFO ] Time to serialize properties into /tmp/LTL6720480178702312542.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/LTL2157141943633134414.gal, -t, CGAL, -LTL, /tmp/LTL6720480178702312542.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/LTL2157141943633134414.gal -t CGAL -LTL /tmp/LTL6720480178702312542.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(c6_0<3)")||(X(X(F("((((aux6_0+aux6_1)+aux6_4)+aux6_5)>=1)")))))U(G("((in4_6+in4_7)<=c17_0)"))))
Formula 0 simplified : !(("(c6_0<3)" | XXF"((((aux6_0+aux6_1)+aux6_4)+aux6_5)>=1)") U G"((in4_6+in4_7)<=c17_0)")
Reverse transition relation is NOT exact ! Due to transitions t256, t257, t258, t259, t288, t289, t290, t291, t320, t324, t328, t332, t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/13/30
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-14 10:25:09] [INFO ] Flatten gal took : 1 ms
[2021-05-14 10:25:09] [INFO ] Applying decomposition
[2021-05-14 10:25:09] [INFO ] Flatten gal took : 2 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/graph8373077984725796111.txt, -o, /tmp/graph8373077984725796111.bin, -w, /tmp/graph8373077984725796111.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/graph8373077984725796111.bin, -l, -1, -v, -w, /tmp/graph8373077984725796111.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:25:09] [INFO ] Decomposing Gal with order
[2021-05-14 10:25:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:25:09] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-14 10:25:09] [INFO ] Flatten gal took : 4 ms
[2021-05-14 10:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2021-05-14 10:25:09] [INFO ] Time to serialize gal into /tmp/LTL12596815810148381254.gal : 0 ms
[2021-05-14 10:25:09] [INFO ] Time to serialize properties into /tmp/LTL14068093146643838135.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/LTL12596815810148381254.gal, -t, CGAL, -LTL, /tmp/LTL14068093146643838135.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/LTL12596815810148381254.gal -t CGAL -LTL /tmp/LTL14068093146643838135.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(gi2.gu1.c6_0<3)")||(X(X(F("((((gu3.aux6_0+gu3.aux6_1)+gu3.aux6_4)+gu3.aux6_5)>=1)")))))U(G("((gu2.in4_6+gu2.in4_7)<=gu2.c17_0)"))))
Formula 0 simplified : !(("(gi2.gu1.c6_0<3)" | XXF"((((gu3.aux6_0+gu3.aux6_1)+gu3.aux6_4)+gu3.aux6_5)>=1)") U G"((gu2.in4_6+gu2.in4_7)<=gu2.c17_0)")
Reverse transition relation is NOT exact ! Due to transitions gu6.t400, gi2.gu1.t256, gi2.gu1.t257, gi2.gu1.t258, gi2.gu1.t259, t324, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/6/21
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8073315313616932954
[2021-05-14 10:25:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8073315313616932954
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/ltsmin8073315313616932954]
Compilation finished in 189 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8073315313616932954]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true)||X(X(<>((LTLAPp1==true))))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin8073315313616932954]
LTSmin run took 7128 ms.
FORMULA PermAdmissibility-COL-05-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-15 finished in 39321 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7453889292557176551
[2021-05-14 10:25:31] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2021-05-14 10:25:31] [INFO ] Applying decomposition
[2021-05-14 10:25:31] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 10:25:31] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2021-05-14 10:25:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 10:25:31] [INFO ] Flatten gal took : 51 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/graph4668427718334198206.txt, -o, /tmp/graph4668427718334198206.bin, -w, /tmp/graph4668427718334198206.weights], workingDir=null]
[2021-05-14 10:25:31] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4668427718334198206.bin, -l, -1, -v, -w, /tmp/graph4668427718334198206.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:25:31] [INFO ] Decomposing Gal with order
[2021-05-14 10:25:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:25:31] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 10:25:31] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7453889292557176551
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/ltsmin7453889292557176551]
[2021-05-14 10:25:31] [INFO ] Removed a total of 715 redundant transitions.
[2021-05-14 10:25:31] [INFO ] Flatten gal took : 162 ms
[2021-05-14 10:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 8 ms.
[2021-05-14 10:25:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality4670179329950986944.gal : 5 ms
[2021-05-14 10:25:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality10898475107140987569.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/LTLCardinality4670179329950986944.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10898475107140987569.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/LTLCardinality4670179329950986944.gal -t CGAL -LTL /tmp/LTLCardinality10898475107140987569.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("((((((((gu4.out3_0+gu4.out3_1)+gu4.out3_2)+gu4.out3_3)+gu4.out3_4)+gu4.out3_5)+gu4.out3_6)+gu4.out3_7)>=1)")))&&(F("((gu2.in3_4+gu2.in3_5)<=gu2.c19_0)")))))
Formula 0 simplified : !X(XF"((((((((gu4.out3_0+gu4.out3_1)+gu4.out3_2)+gu4.out3_3)+gu4.out3_4)+gu4.out3_5)+gu4.out3_6)+gu4.out3_7)>=1)" & F"((gu2.in3_4+gu2.in3_5)<=gu2.c19_0)")
Compilation finished in 4051 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7453889292557176551]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7453889292557176551]
WARNING : LTSmin timed out (>360 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, --when, --ltl, X((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7453889292557176551]
Retrying LTSmin with larger timeout 2880 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, --when, --ltl, X((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7453889292557176551]
Detected timeout of ITS tools.
[2021-05-14 10:45:59] [INFO ] Applying decomposition
[2021-05-14 10:45:59] [INFO ] Flatten gal took : 100 ms
[2021-05-14 10:45:59] [INFO ] Decomposing Gal with order
[2021-05-14 10:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:46:03] [INFO ] Removed a total of 1969 redundant transitions.
[2021-05-14 10:46:03] [INFO ] Flatten gal took : 3415 ms
[2021-05-14 10:46:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 45 ms.
[2021-05-14 10:46:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality975327822011953873.gal : 13 ms
[2021-05-14 10:46:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality12714324811745311972.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/LTLCardinality975327822011953873.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12714324811745311972.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/LTLCardinality975327822011953873.gal -t CGAL -LTL /tmp/LTLCardinality12714324811745311972.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("((((((((ginput0.out3_0+ginput1.out3_1)+ginput2.out3_2)+ginput3.out3_3)+ginput4.out3_4)+ginput5.out3_5)+ginput6.out3_6)+ginput7.out3_7)>=1)")))&&(F("((ginput4.in3_4+ginput5.in3_5)<=gc19.c19_0)")))))
Formula 0 simplified : !X(XF"((((((((ginput0.out3_0+ginput1.out3_1)+ginput2.out3_2)+ginput3.out3_3)+ginput4.out3_4)+ginput5.out3_5)+ginput6.out3_6)+ginput7.out3_7)>=1)" & F"((ginput4.in3_4+ginput5.in3_5)<=gc19.c19_0)")
Detected timeout of ITS tools.
[2021-05-14 11:06:31] [INFO ] Flatten gal took : 134 ms
[2021-05-14 11:06:31] [INFO ] Input system was already deterministic with 592 transitions.
[2021-05-14 11:06:31] [INFO ] Transformed 152 places.
[2021-05-14 11:06:31] [INFO ] Transformed 592 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-14 11:07:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality1299730574134918953.gal : 16 ms
[2021-05-14 11:07:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality3898787025364258348.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/LTLCardinality1299730574134918953.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3898787025364258348.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/LTLCardinality1299730574134918953.gal -t CGAL -LTL /tmp/LTLCardinality3898787025364258348.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(F("((((((((out3_0+out3_1)+out3_2)+out3_3)+out3_4)+out3_5)+out3_6)+out3_7)>=1)")))&&(F("((in3_4+in3_5)<=c19_0)")))))
Formula 0 simplified : !X(XF"((((((((out3_0+out3_1)+out3_2)+out3_3)+out3_4)+out3_5)+out3_6)+out3_7)>=1)" & F"((in3_4+in3_5)<=c19_0)")
WARNING : LTSmin timed out (>2880 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, --when, --ltl, X((X(<>((LTLAPp0==true)))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7453889292557176551]

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="PermAdmissibility-COL-05"
export BK_EXAMINATION="LTLCardinality"
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 PermAdmissibility-COL-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127900476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-05.tgz
mv PermAdmissibility-COL-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;