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.r083-tall-162048875100245.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 DiscoveryGPU-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 46K 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 DiscoveryGPU-PT-06b-00
FORMULA_NAME DiscoveryGPU-PT-06b-01
FORMULA_NAME DiscoveryGPU-PT-06b-02
FORMULA_NAME DiscoveryGPU-PT-06b-03
FORMULA_NAME DiscoveryGPU-PT-06b-04
FORMULA_NAME DiscoveryGPU-PT-06b-05
FORMULA_NAME DiscoveryGPU-PT-06b-06
FORMULA_NAME DiscoveryGPU-PT-06b-07
FORMULA_NAME DiscoveryGPU-PT-06b-08
FORMULA_NAME DiscoveryGPU-PT-06b-09
FORMULA_NAME DiscoveryGPU-PT-06b-10
FORMULA_NAME DiscoveryGPU-PT-06b-11
FORMULA_NAME DiscoveryGPU-PT-06b-12
FORMULA_NAME DiscoveryGPU-PT-06b-13
FORMULA_NAME DiscoveryGPU-PT-06b-14
FORMULA_NAME DiscoveryGPU-PT-06b-15

=== Now, execution of the tool begins

BK_START 1620571819038

Running Version 0
[2021-05-09 14:50:20] [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-09 14:50:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:50:20] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-09 14:50:20] [INFO ] Transformed 184 places.
[2021-05-09 14:50:20] [INFO ] Transformed 194 transitions.
[2021-05-09 14:50:20] [INFO ] Found NUPN structural information;
[2021-05-09 14:50:20] [INFO ] Parsed PT model containing 184 places and 194 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:50:20] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-06b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 184 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 36 place count 148 transition count 170
Iterating global reduction 1 with 24 rules applied. Total rules applied 60 place count 148 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 141 transition count 163
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 141 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 136 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 136 transition count 158
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 133 transition count 155
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 133 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 132 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 132 transition count 153
Applied a total of 92 rules in 57 ms. Remains 132 /184 variables (removed 52) and now considering 153/194 (removed 41) transitions.
// Phase 1: matrix 153 rows 132 cols
[2021-05-09 14:50:20] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 14:50:21] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 153 rows 132 cols
[2021-05-09 14:50:21] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 14:50:21] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 132 cols
[2021-05-09 14:50:21] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 14:50:21] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 132/184 places, 153/194 transitions.
[2021-05-09 14:50:21] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 14:50:21] [INFO ] Flatten gal took : 42 ms
FORMULA DiscoveryGPU-PT-06b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:50:21] [INFO ] Flatten gal took : 14 ms
[2021-05-09 14:50:21] [INFO ] Input system was already deterministic with 153 transitions.
Finished random walk after 971 steps, including 4 resets, run visited all 31 properties in 12 ms. (steps per millisecond=80 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0)) U (p1||X((G(p3)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 119 transition count 139
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 119 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 113 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 109 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 106 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 105 transition count 122
Applied a total of 54 rules in 19 ms. Remains 105 /132 variables (removed 27) and now considering 122/153 (removed 31) transitions.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:21] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:21] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 14:50:21] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:21] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/132 places, 122/153 transitions.
Stuttering acceptance computed with spot in 392 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(NOT p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 5}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s49 1) (EQ s101 1)), p2:(AND (EQ s49 1) (EQ s101 1)), p3:(EQ s51 1), p0:(NEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25060 reset in 256 ms.
Product exploration explored 100000 steps with 24957 reset in 164 ms.
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Knowledge obtained : [(NOT p1), (NOT p2), (NOT p3), p0]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Product exploration explored 100000 steps with 25054 reset in 143 ms.
Product exploration explored 100000 steps with 24923 reset in 118 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Support contains 4 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 122/122 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 105 transition count 122
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 11 place count 105 transition count 130
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 32 place count 105 transition count 130
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 47 place count 105 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 104 transition count 134
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 104 transition count 134
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 104 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 99 transition count 150
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 99 transition count 150
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 86 place count 84 transition count 125
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 101 place count 84 transition count 125
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 72 transition count 106
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 72 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 69 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 69 transition count 100
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 137 place count 63 transition count 91
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 143 place count 63 transition count 91
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 155 place count 51 transition count 73
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 167 place count 51 transition count 73
Deduced a syphon composed of 27 places in 1 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 171 place count 51 transition count 69
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 171 rules in 35 ms. Remains 51 /105 variables (removed 54) and now considering 69/122 (removed 53) transitions.
[2021-05-09 14:50:23] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:50:23] [INFO ] Flow matrix only has 67 transitions (discarded 2 similar events)
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:50:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/105 places, 69/122 transitions.
Product exploration explored 100000 steps with 25063 reset in 368 ms.
Product exploration explored 100000 steps with 24998 reset in 267 ms.
[2021-05-09 14:50:24] [INFO ] Flatten gal took : 8 ms
[2021-05-09 14:50:24] [INFO ] Flatten gal took : 6 ms
[2021-05-09 14:50:24] [INFO ] Time to serialize gal into /tmp/LTL5897620127592575426.gal : 11 ms
[2021-05-09 14:50:24] [INFO ] Time to serialize properties into /tmp/LTL714098768660466557.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/LTL5897620127592575426.gal, -t, CGAL, -LTL, /tmp/LTL714098768660466557.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/LTL5897620127592575426.gal -t CGAL -LTL /tmp/LTL714098768660466557.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X("(p106!=1)")))U((X(("((p80==1)&&(p175==1))")&&(G("(p82==1)"))))||("((p80==1)&&(p175==1))"))))
Formula 0 simplified : !(XX"(p106!=1)" U ("((p80==1)&&(p175==1))" | X("((p80==1)&&(p175==1))" & G"(p82==1)")))
Detected timeout of ITS tools.
[2021-05-09 14:50:39] [INFO ] Flatten gal took : 6 ms
[2021-05-09 14:50:39] [INFO ] Applying decomposition
[2021-05-09 14:50:39] [INFO ] Flatten gal took : 6 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/graph11843446423028076030.txt, -o, /tmp/graph11843446423028076030.bin, -w, /tmp/graph11843446423028076030.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/graph11843446423028076030.bin, -l, -1, -v, -w, /tmp/graph11843446423028076030.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:50:39] [INFO ] Decomposing Gal with order
[2021-05-09 14:50:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:50:39] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-09 14:50:39] [INFO ] Flatten gal took : 33 ms
[2021-05-09 14:50:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 3 ms.
[2021-05-09 14:50:39] [INFO ] Time to serialize gal into /tmp/LTL6650846403740559650.gal : 5 ms
[2021-05-09 14:50:39] [INFO ] Time to serialize properties into /tmp/LTL8962254125924311802.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/LTL6650846403740559650.gal, -t, CGAL, -LTL, /tmp/LTL8962254125924311802.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/LTL6650846403740559650.gal -t CGAL -LTL /tmp/LTL8962254125924311802.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(X("(i3.u21.p106!=1)")))U((X(("((i7.u19.p80==1)&&(u35.p175==1))")&&(G("(i7.u19.p82==1)"))))||("((i7.u19.p80==1)&&(u35.p175==1))"))))
Formula 0 simplified : !(XX"(i3.u21.p106!=1)" U ("((i7.u19.p80==1)&&(u35.p175==1))" | X("((i7.u19.p80==1)&&(u35.p175==1))" & G"(i7.u19.p82==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8880822569176396473
[2021-05-09 14:50:54] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8880822569176396473
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/ltsmin8880822569176396473]
Compilation finished in 543 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8880822569176396473]
Link finished in 42 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))) U (X(([]((LTLAPp2==true))&&(LTLAPp1==true)))||(LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin8880822569176396473]
LTSmin run took 232 ms.
FORMULA DiscoveryGPU-PT-06b-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-00 finished in 33888 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (X(G(p1))||(F(p2)&&G((p3||F(p4)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 122 transition count 142
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 122 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 117 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 117 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 111 transition count 129
Applied a total of 42 rules in 9 ms. Remains 111 /132 variables (removed 21) and now considering 129/153 (removed 24) transitions.
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:50:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:55] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:50:55] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 14:50:55] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:50:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:50:55] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/132 places, 129/153 transitions.
Stuttering acceptance computed with spot in 515 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p4) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)), (AND (NOT p0) p1 (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p4) (NOT p0) (NOT p3) p1), (AND (NOT p2) (NOT p4) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p4) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p3 (NOT p4) (NOT p1)), acceptance={1} source=3 dest: 7}, { cond=(AND p3 (NOT p4) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=3 dest: 8}, { cond=(AND p3 (NOT p4) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p4) (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND (NOT p3) (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 13}], [{ cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p4) p1), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p4) (NOT p1)), acceptance={1} source=7 dest: 7}, { cond=(AND p3 (NOT p4) p1), acceptance={} source=7 dest: 7}, { cond=(AND p3 (NOT p4) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p4) p1), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 12}, { cond=(AND p3 (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 15}], [{ cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p3) (NOT p4) (NOT p0) p1), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p0) p1), acceptance={} source=14 dest: 12}, { cond=(AND p3 (NOT p4) (NOT p0) p1), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p0)), acceptance={0, 1} source=15 dest: 15}]], initial=0, aps=[p2:(EQ s56 1), p3:(AND (EQ s12 1) (EQ s110 1)), p4:(EQ s74 1), p0:(EQ s70 1), p1:(EQ s78 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2210 reset in 134 ms.
Stack based approach found an accepted trace after 235 steps with 5 reset with depth 34 and stack size 34 in 0 ms.
FORMULA DiscoveryGPU-PT-06b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-01 finished in 846 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 131 transition count 127
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 106 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 106 transition count 113
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 92 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 87 transition count 107
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 87 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 88 place count 87 transition count 106
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 90 place count 86 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 83 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 83 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 81 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 81 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 80 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 80 transition count 98
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 166 place count 48 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 170 place count 44 transition count 58
Iterating global reduction 2 with 4 rules applied. Total rules applied 174 place count 44 transition count 58
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 178 place count 40 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 36 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 36 transition count 46
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 194 place count 32 transition count 41
Iterating global reduction 2 with 4 rules applied. Total rules applied 198 place count 32 transition count 41
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 201 place count 29 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 204 place count 29 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 207 place count 26 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 211 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 25 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 25 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 25 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 24 transition count 29
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 223 place count 22 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 228 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 228 place count 17 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 16 transition count 23
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 240 place count 11 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 244 place count 9 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 9 transition count 17
Applied a total of 246 rules in 27 ms. Remains 9 /132 variables (removed 123) and now considering 17/153 (removed 136) transitions.
[2021-05-09 14:50:56] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 9 cols
[2021-05-09 14:50:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:50:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 14:50:56] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 9 cols
[2021-05-09 14:50:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:50:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:50:56] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 14:50:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:50:56] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 9 cols
[2021-05-09 14:50:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:50:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/132 places, 17/153 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s7 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-03 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 119 transition count 139
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 119 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 113 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 109 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 106 transition count 123
Applied a total of 52 rules in 22 ms. Remains 106 /132 variables (removed 26) and now considering 123/153 (removed 30) transitions.
// Phase 1: matrix 123 rows 106 cols
[2021-05-09 14:50:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:56] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 123 rows 106 cols
[2021-05-09 14:50:56] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:50:56] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 106 cols
[2021-05-09 14:50:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:56] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 106/132 places, 123/153 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06b-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s64 1) (EQ s105 1)), p1:(EQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1124 reset in 151 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 0 ms.
FORMULA DiscoveryGPU-PT-06b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-04 finished in 603 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G((p0 U p1)))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 121 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 121 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 117 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 117 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 111 transition count 129
Applied a total of 42 rules in 17 ms. Remains 111 /132 variables (removed 21) and now considering 129/153 (removed 24) transitions.
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:50:57] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:50:57] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:50:57] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 14:50:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:50:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:57] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/132 places, 129/153 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-05 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(AND (EQ s68 1) (EQ s110 1)), p1:(EQ s9 1), p0:(AND (EQ s76 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-05 finished in 323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(G((p1||X(G(p2)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 119 transition count 139
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 119 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 113 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 109 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 106 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 105 transition count 122
Applied a total of 54 rules in 11 ms. Remains 105 /132 variables (removed 27) and now considering 122/153 (removed 31) transitions.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:57] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:57] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 14:50:57] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:57] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/132 places, 122/153 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-06 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(NEQ s38 1), p0:(OR (NEQ s97 0) (NEQ s30 1)), p1:(NEQ s30 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 503 reset in 157 ms.
Product exploration explored 100000 steps with 504 reset in 184 ms.
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 509 reset in 145 ms.
Product exploration explored 100000 steps with 508 reset in 146 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Support contains 3 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 122/122 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 105 transition count 122
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 12 place count 105 transition count 179
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 34 place count 105 transition count 179
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 105 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 104 transition count 178
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 104 transition count 178
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 62 place count 104 transition count 234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 100 transition count 218
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 100 transition count 218
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 88 transition count 186
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 88 transition count 186
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 76 transition count 158
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 76 transition count 158
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 72 transition count 150
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 72 transition count 150
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 64 transition count 130
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 64 transition count 130
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 158 place count 48 transition count 90
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 174 place count 48 transition count 90
Deduced a syphon composed of 27 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 184 place count 48 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 47 transition count 78
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 47 transition count 78
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 186 rules in 24 ms. Remains 47 /105 variables (removed 58) and now considering 78/122 (removed 44) transitions.
[2021-05-09 14:50:58] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:50:58] [INFO ] Flow matrix only has 76 transitions (discarded 2 similar events)
// Phase 1: matrix 76 rows 47 cols
[2021-05-09 14:50:58] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:50:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 47/105 places, 78/122 transitions.
Product exploration explored 100000 steps with 560 reset in 248 ms.
Product exploration explored 100000 steps with 567 reset in 260 ms.
[2021-05-09 14:50:59] [INFO ] Flatten gal took : 7 ms
[2021-05-09 14:50:59] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:50:59] [INFO ] Time to serialize gal into /tmp/LTL5692050993981864823.gal : 4 ms
[2021-05-09 14:50:59] [INFO ] Time to serialize properties into /tmp/LTL2341843582914582320.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/LTL5692050993981864823.gal, -t, CGAL, -LTL, /tmp/LTL2341843582914582320.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/LTL5692050993981864823.gal -t CGAL -LTL /tmp/LTL2341843582914582320.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("((p168!=0)||(p45!=1))")||(X(G(("(p45!=0)")||(X(G("(p56!=1)")))))))))
Formula 0 simplified : !G("((p168!=0)||(p45!=1))" | XG("(p45!=0)" | XG"(p56!=1)"))
Detected timeout of ITS tools.
[2021-05-09 14:51:14] [INFO ] Flatten gal took : 15 ms
[2021-05-09 14:51:14] [INFO ] Applying decomposition
[2021-05-09 14:51:14] [INFO ] Flatten gal took : 6 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/graph14447861938978329723.txt, -o, /tmp/graph14447861938978329723.bin, -w, /tmp/graph14447861938978329723.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/graph14447861938978329723.bin, -l, -1, -v, -w, /tmp/graph14447861938978329723.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:51:14] [INFO ] Decomposing Gal with order
[2021-05-09 14:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:51:14] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-09 14:51:14] [INFO ] Flatten gal took : 18 ms
[2021-05-09 14:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-09 14:51:14] [INFO ] Time to serialize gal into /tmp/LTL11040063947947438559.gal : 5 ms
[2021-05-09 14:51:14] [INFO ] Time to serialize properties into /tmp/LTL9469968994154357645.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/LTL11040063947947438559.gal, -t, CGAL, -LTL, /tmp/LTL9469968994154357645.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/LTL11040063947947438559.gal -t CGAL -LTL /tmp/LTL9469968994154357645.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.u0.p168!=0)||(i3.u10.p45!=1))")||(X(G(("(i3.u10.p45!=0)")||(X(G("(i6.u13.p56!=1)")))))))))
Formula 0 simplified : !G("((i1.u0.p168!=0)||(i3.u10.p45!=1))" | XG("(i3.u10.p45!=0)" | XG"(i6.u13.p56!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14515410104673134362
[2021-05-09 14:51:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14515410104673134362
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/ltsmin14515410104673134362]
Compilation finished in 481 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14515410104673134362]
Link finished in 34 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([](((LTLAPp1==true)||X([]((LTLAPp2==true))))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14515410104673134362]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DiscoveryGPU-PT-06b-06 finished in 47123 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||F(G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 131 transition count 129
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 108 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 106 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 106 transition count 113
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 92 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 88 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 88 transition count 108
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 85 transition count 104
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 85 transition count 104
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 83 transition count 101
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 83 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 82 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 82 transition count 100
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 164 place count 49 transition count 67
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 169 place count 44 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 174 place count 44 transition count 57
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 179 place count 39 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 184 place count 39 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 35 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 35 transition count 44
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 31 transition count 39
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 31 transition count 39
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 28 transition count 34
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 28 transition count 34
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 209 place count 25 transition count 30
Iterating global reduction 3 with 3 rules applied. Total rules applied 212 place count 25 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 213 place count 24 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 24 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 24 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 23 transition count 27
Reduce places removed 1 places and 0 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 3 with 2 rules applied. Total rules applied 218 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 21 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 219 place count 21 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 225 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 17 transition count 22
Applied a total of 226 rules in 20 ms. Remains 17 /132 variables (removed 115) and now considering 22/153 (removed 131) transitions.
[2021-05-09 14:51:44] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 17 cols
[2021-05-09 14:51:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:51:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-09 14:51:44] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 17 cols
[2021-05-09 14:51:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:51:44] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-09 14:51:44] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:51:44] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 17 cols
[2021-05-09 14:51:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:51:44] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/132 places, 22/153 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s11 1), p0:(EQ s12 1), p2:(AND (NEQ s8 1) (NEQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-07 finished in 170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 119 transition count 139
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 119 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 113 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 109 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 106 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 105 transition count 122
Applied a total of 54 rules in 4 ms. Remains 105 /132 variables (removed 27) and now considering 122/153 (removed 31) transitions.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:51:44] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:51:44] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:51:44] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 14:51:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:51:44] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:51:44] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/132 places, 122/153 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s90 0), p0:(NEQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 122/122 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 105 transition count 122
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 12 place count 105 transition count 179
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 34 place count 105 transition count 179
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 105 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 104 transition count 178
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 104 transition count 178
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 64 place count 104 transition count 240
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 99 transition count 220
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 99 transition count 220
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 89 place count 84 transition count 180
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 104 place count 84 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 117 place count 71 transition count 151
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 130 place count 71 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 134 place count 67 transition count 143
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 138 place count 67 transition count 143
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 146 place count 59 transition count 123
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 154 place count 59 transition count 123
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 170 place count 43 transition count 83
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 186 place count 43 transition count 83
Deduced a syphon composed of 26 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 199 place count 43 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 201 place count 41 transition count 66
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 203 place count 41 transition count 66
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 203 rules in 15 ms. Remains 41 /105 variables (removed 64) and now considering 66/122 (removed 56) transitions.
[2021-05-09 14:51:45] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:51:45] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
// Phase 1: matrix 62 rows 41 cols
[2021-05-09 14:51:45] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:51:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/105 places, 66/122 transitions.
Product exploration explored 100000 steps with 25000 reset in 195 ms.
Product exploration explored 100000 steps with 25000 reset in 193 ms.
[2021-05-09 14:51:46] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:51:46] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:51:46] [INFO ] Time to serialize gal into /tmp/LTL14307691711418842436.gal : 1 ms
[2021-05-09 14:51:46] [INFO ] Time to serialize properties into /tmp/LTL5719132098919439848.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/LTL14307691711418842436.gal, -t, CGAL, -LTL, /tmp/LTL5719132098919439848.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/LTL14307691711418842436.gal -t CGAL -LTL /tmp/LTL5719132098919439848.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(p160!=1)")||(G("(p160==0)"))))))))
Formula 0 simplified : !XXXF("(p160!=1)" | G"(p160==0)")
Detected timeout of ITS tools.
[2021-05-09 14:52:01] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:52:01] [INFO ] Applying decomposition
[2021-05-09 14:52:01] [INFO ] Flatten gal took : 5 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/graph1735008945694835161.txt, -o, /tmp/graph1735008945694835161.bin, -w, /tmp/graph1735008945694835161.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/graph1735008945694835161.bin, -l, -1, -v, -w, /tmp/graph1735008945694835161.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:52:01] [INFO ] Decomposing Gal with order
[2021-05-09 14:52:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:52:01] [INFO ] Removed a total of 46 redundant transitions.
[2021-05-09 14:52:01] [INFO ] Flatten gal took : 18 ms
[2021-05-09 14:52:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2021-05-09 14:52:01] [INFO ] Time to serialize gal into /tmp/LTL3736126633480389697.gal : 1 ms
[2021-05-09 14:52:01] [INFO ] Time to serialize properties into /tmp/LTL16841627475787856314.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/LTL3736126633480389697.gal, -t, CGAL, -LTL, /tmp/LTL16841627475787856314.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/LTL3736126633480389697.gal -t CGAL -LTL /tmp/LTL16841627475787856314.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(i8.u34.p160!=1)")||(G("(i8.u34.p160==0)"))))))))
Formula 0 simplified : !XXXF("(i8.u34.p160!=1)" | G"(i8.u34.p160==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4631972183287925035
[2021-05-09 14:52:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4631972183287925035
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/ltsmin4631972183287925035]
Compilation finished in 466 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4631972183287925035]
Link finished in 35 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(X(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4631972183287925035]
LTSmin run took 121 ms.
FORMULA DiscoveryGPU-PT-06b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-09 finished in 32256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 131 transition count 126
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 105 transition count 126
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 105 transition count 113
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 92 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 88 transition count 108
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 88 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 88 transition count 107
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 88 place count 87 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 84 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 84 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 82 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 82 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 81 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 81 transition count 99
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 166 place count 48 transition count 66
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 45 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 45 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 42 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 42 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 181 place count 39 transition count 51
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 39 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 187 place count 36 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 190 place count 36 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 193 place count 33 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 196 place count 33 transition count 42
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 199 place count 30 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 202 place count 30 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 204 place count 29 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 205 place count 28 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 28 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 209 place count 26 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 210 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 211 place count 25 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 213 place count 24 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 215 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 217 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 21 transition count 27
Reduce places removed 1 places and 0 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 2 with 3 rules applied. Total rules applied 222 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 224 place count 18 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 234 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 12 transition count 19
Applied a total of 235 rules in 14 ms. Remains 12 /132 variables (removed 120) and now considering 19/153 (removed 134) transitions.
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2021-05-09 14:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2021-05-09 14:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 14:52:17] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2021-05-09 14:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/132 places, 19/153 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-10 finished in 92 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||X(p1)))&&X(F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 119 transition count 139
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 119 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 113 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 109 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 106 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 105 transition count 122
Applied a total of 54 rules in 5 ms. Remains 105 /132 variables (removed 27) and now considering 122/153 (removed 31) transitions.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:52:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:52:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:52:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:52:17] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/132 places, 122/153 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, true, (NOT p1), p1, (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s23 1), p0:(OR (EQ s90 1) (EQ s23 1))], nbAcceptance=0, 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 11 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-11 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 131 transition count 126
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 105 transition count 126
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 105 transition count 112
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 91 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 86 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 86 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 83 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 83 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 81 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 81 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 80 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 80 transition count 98
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 170 place count 46 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 175 place count 41 transition count 54
Iterating global reduction 2 with 5 rules applied. Total rules applied 180 place count 41 transition count 54
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 185 place count 36 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 190 place count 36 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 31 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 31 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 26 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 26 transition count 33
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 21 transition count 24
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 21 transition count 24
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 224 place count 17 transition count 19
Iterating global reduction 2 with 4 rules applied. Total rules applied 228 place count 17 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 229 place count 16 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 16 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 16 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 15 transition count 16
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 234 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 235 place count 13 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 235 place count 13 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 11 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 10 transition count 12
Applied a total of 240 rules in 9 ms. Remains 10 /132 variables (removed 122) and now considering 12/153 (removed 141) transitions.
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2021-05-09 14:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2021-05-09 14:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 14:52:17] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2021-05-09 14:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/132 places, 12/153 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s9 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]]
Product exploration explored 100000 steps with 26290 reset in 63 ms.
Stack based approach found an accepted trace after 23 steps with 6 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DiscoveryGPU-PT-06b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-12 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (F(G(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 131 transition count 127
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 106 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 105 transition count 126
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 52 place count 105 transition count 112
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 91 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 87 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 87 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 87 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 86 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 84 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 83 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 83 transition count 102
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 162 place count 50 transition count 69
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 47 transition count 63
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 47 transition count 63
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 171 place count 44 transition count 59
Iterating global reduction 3 with 3 rules applied. Total rules applied 174 place count 44 transition count 59
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 42 transition count 56
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 42 transition count 56
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 40 transition count 53
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 40 transition count 53
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 38 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 38 transition count 50
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 36 transition count 47
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 36 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 35 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 35 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 35 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 35 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 34 transition count 44
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 9 rules applied. Total rules applied 204 place count 32 transition count 37
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 211 place count 25 transition count 37
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 235 place count 13 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 13 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 12 transition count 22
Applied a total of 238 rules in 21 ms. Remains 12 /132 variables (removed 120) and now considering 22/153 (removed 131) transitions.
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 14:52:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 14:52:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-09 14:52:17] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:52:17] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 14:52:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/132 places, 22/153 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-14 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s9 1), p0:(EQ s4 1), p1:(OR (EQ s9 1) (AND (EQ s5 1) (EQ s4 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-14 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(p0 U !p1)||G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 153/153 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 120 transition count 140
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 115 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 112 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 112 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 109 transition count 127
Applied a total of 46 rules in 4 ms. Remains 109 /132 variables (removed 23) and now considering 127/153 (removed 26) transitions.
// Phase 1: matrix 127 rows 109 cols
[2021-05-09 14:52:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 127 rows 109 cols
[2021-05-09 14:52:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:52:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 109 cols
[2021-05-09 14:52:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:52:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 109/132 places, 127/153 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s54 1) (EQ s105 1)), p1:(NEQ s62 1), p2:(EQ s86 1)], 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]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-15 finished in 297 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4649844760495256484
[2021-05-09 14:52:18] [INFO ] Applying decomposition
[2021-05-09 14:52:18] [INFO ] Computing symmetric may disable matrix : 153 transitions.
[2021-05-09 14:52:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:52:18] [INFO ] Computing symmetric may enable matrix : 153 transitions.
[2021-05-09 14:52:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:52:18] [INFO ] Flatten gal took : 6 ms
[2021-05-09 14:52:18] [INFO ] Computing Do-Not-Accords matrix : 153 transitions.
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/graph18010846999492481619.txt, -o, /tmp/graph18010846999492481619.bin, -w, /tmp/graph18010846999492481619.weights], workingDir=null]
[2021-05-09 14:52:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18010846999492481619.bin, -l, -1, -v, -w, /tmp/graph18010846999492481619.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:52:18] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4649844760495256484
[2021-05-09 14:52:18] [INFO ] Decomposing Gal with order
[2021-05-09 14:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin4649844760495256484]
[2021-05-09 14:52:18] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-09 14:52:18] [INFO ] Flatten gal took : 14 ms
[2021-05-09 14:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 14:52:18] [INFO ] Time to serialize gal into /tmp/LTLFireability1905468299860606614.gal : 1 ms
[2021-05-09 14:52:18] [INFO ] Time to serialize properties into /tmp/LTLFireability17873594354645216590.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/LTLFireability1905468299860606614.gal, -t, CGAL, -LTL, /tmp/LTLFireability17873594354645216590.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/LTLFireability1905468299860606614.gal -t CGAL -LTL /tmp/LTLFireability17873594354645216590.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((!("((i0.i0.u0.p168==0)&&(i4.u12.p45==1))"))||(X(G(("(i4.u12.p45!=0)")||(X(G("(i5.u15.p56!=1)")))))))))
Formula 0 simplified : !G(!"((i0.i0.u0.p168==0)&&(i4.u12.p45==1))" | XG("(i4.u12.p45!=0)" | XG"(i5.u15.p56!=1)"))
Compilation finished in 674 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4649844760495256484]
Link finished in 36 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([](((LTLAPp1==true)||X([]((LTLAPp2==true))))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4649844760495256484]
Reverse transition relation is NOT exact ! Due to transitions t133, t138, u45.t7, u45.t10, u45.t12, u45.t14, i1.u3.t126, i2.u6.t124, i3.t96, i3.t77, i3.t58, i3.t39, i3.u7.t114, i3.u7.t189, i4.u12.t106, i5.u15.t108, i6.u17.t90, i7.u21.t88, i8.u24.t70, i9.u27.t68, i10.u33.t50, i11.u36.t52, i12.t143, i12.t142, i12.t123, i12.t121, i12.t85, i12.t29, i12.t26, i12.u18.t84, i12.u25.t64, i12.u25.t66, i12.u25.t102, i12.u25.t104, i12.u46.t2, i13.u40.t30, i14.u42.t182, i15.u37.t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/115/38/153
Computing Next relation with stutter on 1 deadlock states
WARNING : LTSmin timed out (>276 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([](((LTLAPp1==true)||X([]((LTLAPp2==true))))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4649844760495256484]
Retrying LTSmin with larger timeout 2208 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([](((LTLAPp1==true)||X([]((LTLAPp2==true))))))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4649844760495256484]
159 unique states visited
0 strongly connected components in search stack
206 transitions explored
53 items max in DFS search stack
28004 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,280.055,2389948,1,0,2.82785e+06,27127,2123,1.76692e+07,308,285777,2463891
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06b-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620572628664

--------------------
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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r083-tall-162048875100245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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