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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.0K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 54K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-07b-00
FORMULA_NAME DiscoveryGPU-PT-07b-01
FORMULA_NAME DiscoveryGPU-PT-07b-02
FORMULA_NAME DiscoveryGPU-PT-07b-03
FORMULA_NAME DiscoveryGPU-PT-07b-04
FORMULA_NAME DiscoveryGPU-PT-07b-05
FORMULA_NAME DiscoveryGPU-PT-07b-06
FORMULA_NAME DiscoveryGPU-PT-07b-07
FORMULA_NAME DiscoveryGPU-PT-07b-08
FORMULA_NAME DiscoveryGPU-PT-07b-09
FORMULA_NAME DiscoveryGPU-PT-07b-10
FORMULA_NAME DiscoveryGPU-PT-07b-11
FORMULA_NAME DiscoveryGPU-PT-07b-12
FORMULA_NAME DiscoveryGPU-PT-07b-13
FORMULA_NAME DiscoveryGPU-PT-07b-14
FORMULA_NAME DiscoveryGPU-PT-07b-15

=== Now, execution of the tool begins

BK_START 1620572746218

Running Version 0
[2021-05-09 15:05:58] [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 15:05:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:05:58] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-09 15:05:58] [INFO ] Transformed 212 places.
[2021-05-09 15:05:58] [INFO ] Transformed 224 transitions.
[2021-05-09 15:05:58] [INFO ] Found NUPN structural information;
[2021-05-09 15:05:58] [INFO ] Parsed PT model containing 212 places and 224 transitions in 95 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:05:58] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-07b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 224
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 47 place count 165 transition count 191
Iterating global reduction 1 with 33 rules applied. Total rules applied 80 place count 165 transition count 191
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 159 transition count 185
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 159 transition count 185
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 153 transition count 179
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 153 transition count 179
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 149 transition count 175
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 149 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 148 transition count 173
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 148 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 147 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 147 transition count 172
Applied a total of 116 rules in 77 ms. Remains 147 /212 variables (removed 65) and now considering 172/224 (removed 52) transitions.
// Phase 1: matrix 172 rows 147 cols
[2021-05-09 15:05:58] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 15:05:59] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 172 rows 147 cols
[2021-05-09 15:05:59] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 15:05:59] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 147 cols
[2021-05-09 15:05:59] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-09 15:05:59] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/212 places, 172/224 transitions.
[2021-05-09 15:05:59] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 15:05:59] [INFO ] Flatten gal took : 39 ms
FORMULA DiscoveryGPU-PT-07b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:05:59] [INFO ] Flatten gal took : 15 ms
[2021-05-09 15:05:59] [INFO ] Input system was already deterministic with 172 transitions.
Incomplete random walk after 100000 steps, including 441 resets, run finished after 332 ms. (steps per millisecond=301 ) properties (out of 30) seen :27
Running SMT prover for 3 properties.
// Phase 1: matrix 172 rows 147 cols
[2021-05-09 15:05:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:05:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 15:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:06:00] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2021-05-09 15:06:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:06:00] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-09 15:06:00] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 3 ms to minimize.
[2021-05-09 15:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2021-05-09 15:06:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:06:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:06:00] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-09 15:06:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2021-05-09 15:06:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-09 15:06:00] [INFO ] Computed and/alt/rep : 168/314/168 causal constraints (skipped 3 transitions) in 12 ms.
[2021-05-09 15:06:00] [INFO ] Added : 132 causal constraints over 27 iterations in 356 ms. Result :sat
[2021-05-09 15:06:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&(p1 U p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 15 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:00] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:00] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:06:00] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:00] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s28 1), p1:(AND (EQ s68 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-00 finished in 503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G((p1||(p2 U (p3 U (p4||G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 138 transition count 160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 138 transition count 160
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 131 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 131 transition count 153
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 126 transition count 146
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 126 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 124 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Applied a total of 50 rules in 13 ms. Remains 122 /147 variables (removed 25) and now considering 142/172 (removed 30) transitions.
// Phase 1: matrix 142 rows 122 cols
[2021-05-09 15:06:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:01] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 142 rows 122 cols
[2021-05-09 15:06:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:01] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 122 cols
[2021-05-09 15:06:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:01] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/147 places, 142/172 transitions.
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p1) (NOT p3) (NOT p4)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p4)), true, (AND (NOT p4) (NOT p3)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND p0 (NOT p1) (NOT p3) (NOT p4)), (AND p0 (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : DiscoveryGPU-PT-07b-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p4 p3 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p4 p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={0, 1} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={1} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(OR (AND p1 (NOT p0)) (AND p4 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p4) p2 (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={1} source=4 dest: 4}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p4) p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={1} source=4 dest: 6}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=4 dest: 11}, { cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND p1 (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(OR (AND p1 (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=(OR (AND p1 (NOT p4) p3) (AND (NOT p4) p3 p2)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p1 (NOT p4) p3) (AND (NOT p4) p3 p2)), acceptance={} source=6 dest: 12}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p4) p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2) p0), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2) p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND p1 p0) (AND p4 p0) (AND p3 p0) (AND p2 p0)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p4) p2 p0), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={0, 1} source=10 dest: 10}, { cond=(AND (NOT p4) p3 p2), acceptance={1} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p4) p2 (NOT p0)), acceptance={} source=11 dest: 13}, { cond=(AND p1 (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2) (NOT p0)), acceptance={} source=12 dest: 8}, { cond=(OR (AND p1 (NOT p4) (NOT p3) (NOT p0)) (AND (NOT p4) (NOT p3) p2 (NOT p0))), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p1) (NOT p4) p2 (NOT p0)), acceptance={} source=12 dest: 10}, { cond=(OR (AND p1 (NOT p4) p3 (NOT p0)) (AND (NOT p4) p3 p2 (NOT p0))), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2) p0), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2) p0), acceptance={} source=13 dest: 8}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2) p0), acceptance={} source=13 dest: 9}, { cond=(AND (NOT p1) (NOT p4) p2 p0), acceptance={} source=13 dest: 10}, { cond=(AND p1 (NOT p4) p2 p0), acceptance={} source=13 dest: 13}, { cond=(AND p1 (NOT p4) p3 (NOT p2) p0), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2) p0), acceptance={} source=14 dest: 8}, { cond=(OR (AND p1 (NOT p4) (NOT p3) p0) (AND (NOT p4) (NOT p3) p2 p0)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p1) (NOT p4) p2 p0), acceptance={} source=14 dest: 10}, { cond=(OR (AND p1 (NOT p4) p3 p0) (AND (NOT p4) p3 p2 p0)), acceptance={} source=14 dest: 14}]], initial=0, aps=[p1:(EQ s47 1), p4:(AND (NEQ s47 1) (NEQ s115 1)), p3:(NEQ s115 1), p2:(EQ s2 1), p0:(OR (EQ s104 1) (EQ s2 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][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 5 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-01 finished in 763 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 12 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:06:02] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:06:02] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s101 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][false, false]]
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-02 finished in 251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((X(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 137 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 137 transition count 159
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 130 transition count 152
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 125 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 125 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 123 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 121 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 121 transition count 141
Applied a total of 52 rules in 11 ms. Remains 121 /147 variables (removed 26) and now considering 141/172 (removed 31) transitions.
// Phase 1: matrix 141 rows 121 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:02] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 141 rows 121 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 15:06:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 141 rows 121 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:02] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 121/147 places, 141/172 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s112 1) (EQ s117 1) (EQ s31 1)), p2:(OR (EQ s65 0) (EQ s117 0)), p1:(OR (EQ s112 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-03 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0 U (p1||G(p0)))&&F((p2&&X(p3))))||G(p4)))], workingDir=/home/mcc/execution]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 8 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:02] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:02] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:06:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 11145 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), true, (OR (NOT p3) (NOT p2)), (NOT p4), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p4)), (NOT p3), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (AND (NOT p4) (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-04 automaton TGBA [mat=[[{ cond=(AND (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p4) (NOT p2) p1) (AND (NOT p4) (NOT p2) p0)), acceptance={} source=0 dest: 2}, { cond=(AND p4 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(OR (AND p4 p2 p1) (AND p4 p2 p0)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p4) p2 p1) (AND (NOT p4) p2 p0)), acceptance={} source=0 dest: 6}, { cond=(OR (AND p4 (NOT p2) p1) (AND p4 (NOT p2) p0)), acceptance={} source=0 dest: 7}, { cond=(AND p4 (NOT p1) p0), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 6}], [{ cond=(NOT p4), acceptance={} source=3 dest: 1}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p4 p2 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p4) p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p4 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p4) p2), acceptance={} source=7 dest: 6}, { cond=(AND p4 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND p4 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=8 dest: 4}, { cond=(AND p4 (NOT p1) p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p4:(OR (NEQ s83 1) (NEQ s116 1) (AND (NEQ s45 1) (OR (NEQ s83 1) (NEQ s116 1)))), p1:(AND (NEQ s45 1) (OR (NEQ s83 1) (NEQ s116 1))), p0:(OR (NEQ s83 1) (NEQ s116 1)), p2:(OR (EQ s22 0) (EQ s116 0)), p3:(NEQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 320 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p4, p1, p0, p2, p3]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 140/140 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:14] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:14] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:14] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:06:15] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:15] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 140/140 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p2) (NOT p4))), (AND (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
[2021-05-09 15:06:15] [INFO ] Flatten gal took : 9 ms
[2021-05-09 15:06:15] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:06:15] [INFO ] Time to serialize gal into /tmp/LTL850250123120544906.gal : 8 ms
[2021-05-09 15:06:15] [INFO ] Time to serialize properties into /tmp/LTL14556613155154552429.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/LTL850250123120544906.gal, -t, CGAL, -LTL, /tmp/LTL14556613155154552429.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/LTL850250123120544906.gal -t CGAL -LTL /tmp/LTL14556613155154552429.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(((p141!=1)||(p203!=1))||((p73!=1)&&((p141!=1)||(p203!=1))))"))||((("((p141!=1)||(p203!=1))")U(("((p73!=1)&&((p141!=1)||(p203!=1)))")||(G("((p141!=1)||(p203!=1))"))))&&(F(("((p27==0)||(p203==0))")&&(X("(p73!=1)")))))))
Formula 0 simplified : !(G"(((p141!=1)||(p203!=1))||((p73!=1)&&((p141!=1)||(p203!=1))))" | (("((p141!=1)||(p203!=1))" U ("((p73!=1)&&((p141!=1)||(p203!=1)))" | G"((p141!=1)||(p203!=1))")) & F("((p27==0)||(p203==0))" & X"(p73!=1)")))
Detected timeout of ITS tools.
[2021-05-09 15:06:30] [INFO ] Flatten gal took : 11 ms
[2021-05-09 15:06:30] [INFO ] Applying decomposition
[2021-05-09 15:06:30] [INFO ] Flatten gal took : 7 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/graph5139222602619265173.txt, -o, /tmp/graph5139222602619265173.bin, -w, /tmp/graph5139222602619265173.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/graph5139222602619265173.bin, -l, -1, -v, -w, /tmp/graph5139222602619265173.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:06:30] [INFO ] Decomposing Gal with order
[2021-05-09 15:06:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:06:30] [INFO ] Removed a total of 53 redundant transitions.
[2021-05-09 15:06:30] [INFO ] Flatten gal took : 39 ms
[2021-05-09 15:06:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2021-05-09 15:06:30] [INFO ] Time to serialize gal into /tmp/LTL8217905489557299550.gal : 6 ms
[2021-05-09 15:06:30] [INFO ] Time to serialize properties into /tmp/LTL14086011241544235397.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/LTL8217905489557299550.gal, -t, CGAL, -LTL, /tmp/LTL14086011241544235397.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/LTL8217905489557299550.gal -t CGAL -LTL /tmp/LTL14086011241544235397.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(((i9.i1.u29.p141!=1)||(u40.p203!=1))||((i2.u15.p73!=1)&&((i9.i1.u29.p141!=1)||(u40.p203!=1))))"))||((("((i9.i1.u29.p141!=1)||(u40.p203!=1))")U(("((i2.u15.p73!=1)&&((i9.i1.u29.p141!=1)||(u40.p203!=1)))")||(G("((i9.i1.u29.p141!=1)||(u40.p203!=1))"))))&&(F(("((i4.u7.p27==0)||(u40.p203==0))")&&(X("(i2.u15.p73!=1)")))))))
Formula 0 simplified : !(G"(((i9.i1.u29.p141!=1)||(u40.p203!=1))||((i2.u15.p73!=1)&&((i9.i1.u29.p141!=1)||(u40.p203!=1))))" | (("((i9.i1.u29.p141!=1)||(u40.p203!=1))" U ("((i2.u15.p73!=1)&&((i9.i1.u29.p141!=1)||(u40.p203!=1)))" | G"((i9.i1.u29.p141!=1)||(u40.p203!=1))")) & F("((i4.u7.p27==0)||(u40.p203==0))" & X"(i2.u15.p73!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9232652801133723807
[2021-05-09 15:06:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9232652801133723807
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/ltsmin9232652801133723807]
Compilation finished in 642 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9232652801133723807]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))&&<>(((LTLAPp3==true)&&X((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9232652801133723807]
LTSmin run took 164 ms.
FORMULA DiscoveryGPU-PT-07b-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-04 finished in 44293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 137 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 137 transition count 159
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 130 transition count 152
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 125 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 125 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 123 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 121 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 121 transition count 141
Applied a total of 52 rules in 7 ms. Remains 121 /147 variables (removed 26) and now considering 141/172 (removed 31) transitions.
// Phase 1: matrix 141 rows 121 cols
[2021-05-09 15:06:46] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:46] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 141 rows 121 cols
[2021-05-09 15:06:46] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:47] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 141 rows 121 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:06:47] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 121/147 places, 141/172 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (EQ s111 1) (EQ s116 1)), p0:(NEQ s117 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-05 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 6 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:06:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:47] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s101 1), p1:(NEQ s7 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-07 finished in 290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 7 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:47] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:47] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s42 1), p0:(AND (EQ s74 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5658 reset in 165 ms.
Stack based approach found an accepted trace after 2285 steps with 129 reset with depth 19 and stack size 19 in 5 ms.
FORMULA DiscoveryGPU-PT-07b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-08 finished in 468 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 7 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:06:48] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:48] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:06:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:06:48] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:06:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s110 1) (NEQ s116 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Graph (complete) has 241 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 120/120 places, 140/140 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 120 transition count 140
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 14 place count 120 transition count 149
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 37 place count 120 transition count 149
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 56 place count 120 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 119 transition count 156
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 119 transition count 156
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 119 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 113 transition count 174
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 113 transition count 174
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 95 transition count 144
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 95 transition count 144
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 138 place count 77 transition count 114
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 156 place count 77 transition count 114
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 162 place count 71 transition count 102
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 168 place count 71 transition count 102
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 179 place count 60 transition count 86
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 190 place count 60 transition count 86
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 210 place count 40 transition count 56
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 230 place count 40 transition count 56
Deduced a syphon composed of 24 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 40 transition count 52
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 234 rules in 37 ms. Remains 40 /120 variables (removed 80) and now considering 52/140 (removed 88) transitions.
[2021-05-09 15:06:49] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 15:06:49] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
// Phase 1: matrix 51 rows 40 cols
[2021-05-09 15:06:49] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:06:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/120 places, 52/140 transitions.
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
[2021-05-09 15:06:49] [INFO ] Flatten gal took : 11 ms
[2021-05-09 15:06:49] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:06:49] [INFO ] Time to serialize gal into /tmp/LTL8885599466568373277.gal : 1 ms
[2021-05-09 15:06:49] [INFO ] Time to serialize properties into /tmp/LTL7828437229548409838.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/LTL8885599466568373277.gal, -t, CGAL, -LTL, /tmp/LTL7828437229548409838.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/LTL8885599466568373277.gal -t CGAL -LTL /tmp/LTL7828437229548409838.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p193!=1)||(p203!=1))"))))
Formula 0 simplified : !XF"((p193!=1)||(p203!=1))"
Detected timeout of ITS tools.
[2021-05-09 15:07:04] [INFO ] Flatten gal took : 10 ms
[2021-05-09 15:07:04] [INFO ] Applying decomposition
[2021-05-09 15:07:04] [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/graph17872734200696989291.txt, -o, /tmp/graph17872734200696989291.bin, -w, /tmp/graph17872734200696989291.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/graph17872734200696989291.bin, -l, -1, -v, -w, /tmp/graph17872734200696989291.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:07:04] [INFO ] Decomposing Gal with order
[2021-05-09 15:07:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:07:04] [INFO ] Removed a total of 53 redundant transitions.
[2021-05-09 15:07:04] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:07:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2021-05-09 15:07:04] [INFO ] Time to serialize gal into /tmp/LTL7389975431514325672.gal : 3 ms
[2021-05-09 15:07:04] [INFO ] Time to serialize properties into /tmp/LTL14955178570127033745.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/LTL7389975431514325672.gal, -t, CGAL, -LTL, /tmp/LTL14955178570127033745.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/LTL7389975431514325672.gal -t CGAL -LTL /tmp/LTL14955178570127033745.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i11.u38.p193!=1)||(u41.p203!=1))"))))
Formula 0 simplified : !XF"((i11.u38.p193!=1)||(u41.p203!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15356369866419591054
[2021-05-09 15:07:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15356369866419591054
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/ltsmin15356369866419591054]
Compilation finished in 539 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15356369866419591054]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15356369866419591054]
LTSmin run took 195 ms.
FORMULA DiscoveryGPU-PT-07b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-09 finished in 32705 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)||G(p2)||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 146 transition count 147
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 122 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 121 transition count 146
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 50 place count 121 transition count 127
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 88 place count 102 transition count 127
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 95 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 95 transition count 117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 102 place count 95 transition count 115
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 93 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 89 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 88 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 87 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 87 transition count 108
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 3 with 64 rules applied. Total rules applied 182 place count 55 transition count 76
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 187 place count 50 transition count 66
Iterating global reduction 3 with 5 rules applied. Total rules applied 192 place count 50 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 197 place count 45 transition count 61
Iterating global reduction 3 with 5 rules applied. Total rules applied 202 place count 45 transition count 61
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 207 place count 40 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 212 place count 40 transition count 51
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 217 place count 35 transition count 46
Iterating global reduction 3 with 5 rules applied. Total rules applied 222 place count 35 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 226 place count 31 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 31 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 234 place count 27 transition count 34
Iterating global reduction 3 with 4 rules applied. Total rules applied 238 place count 27 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 239 place count 27 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 27 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 26 transition count 32
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 247 place count 24 transition count 28
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 252 place count 20 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 19 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 253 place count 19 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 255 place count 18 transition count 26
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 267 place count 12 transition count 20
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 6 with 2 rules applied. Total rules applied 269 place count 11 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 11 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 10 transition count 18
Applied a total of 271 rules in 30 ms. Remains 10 /147 variables (removed 137) and now considering 18/172 (removed 154) transitions.
[2021-05-09 15:07:20] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 10 cols
[2021-05-09 15:07:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:07:20] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 15:07:20] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 10 cols
[2021-05-09 15:07:20] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:07:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:07:20] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-09 15:07:20] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:07:20] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 10 cols
[2021-05-09 15:07:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:07:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/147 places, 18/172 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07b-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s5 1), p0:(OR (EQ s3 1) (NEQ s5 0)), p2:(EQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-10 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 124 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 122 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 120 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 120 transition count 140
Applied a total of 54 rules in 25 ms. Remains 120 /147 variables (removed 27) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:07:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:07:20] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:07:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:07:21] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2021-05-09 15:07:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:07:21] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 120/147 places, 140/172 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s33 1) (EQ s116 1)), p1:(EQ s67 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-12 finished in 493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 137 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 137 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 131 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 131 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 127 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 126 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 125 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 125 transition count 146
Applied a total of 44 rules in 9 ms. Remains 125 /147 variables (removed 22) and now considering 146/172 (removed 26) transitions.
// Phase 1: matrix 146 rows 125 cols
[2021-05-09 15:07:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:07:21] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 146 rows 125 cols
[2021-05-09 15:07:21] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 15:07:21] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 146 rows 125 cols
[2021-05-09 15:07:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:07:21] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/147 places, 146/172 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-13 finished in 272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 172/172 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 146 transition count 146
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 121 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 120 transition count 145
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 52 place count 120 transition count 125
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 92 place count 100 transition count 125
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 99 place count 93 transition count 116
Iterating global reduction 3 with 7 rules applied. Total rules applied 106 place count 93 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 106 place count 93 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 91 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 87 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 87 transition count 110
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 85 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 85 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 83 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 83 transition count 104
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 188 place count 52 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 193 place count 47 transition count 63
Iterating global reduction 3 with 5 rules applied. Total rules applied 198 place count 47 transition count 63
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 203 place count 42 transition count 58
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 42 transition count 58
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 213 place count 37 transition count 48
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 37 transition count 48
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 223 place count 32 transition count 43
Iterating global reduction 3 with 5 rules applied. Total rules applied 228 place count 32 transition count 43
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 233 place count 27 transition count 33
Iterating global reduction 3 with 5 rules applied. Total rules applied 238 place count 27 transition count 33
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 243 place count 22 transition count 28
Iterating global reduction 3 with 5 rules applied. Total rules applied 248 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 21 transition count 26
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 3 with 7 rules applied. Total rules applied 257 place count 19 transition count 21
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 262 place count 14 transition count 21
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 274 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 276 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 7 transition count 12
Applied a total of 277 rules in 22 ms. Remains 7 /147 variables (removed 140) and now considering 12/172 (removed 160) transitions.
[2021-05-09 15:07:21] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 15:07:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:07:21] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 15:07:21] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 15:07:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:07:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-09 15:07:21] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:07:21] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 15:07:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:07:21] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/147 places, 12/172 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s6 1) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-15 finished in 113 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620572842535

--------------------
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-07b"
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-07b, 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-162048875200261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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