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.r121-tall-162075406800324.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 IBM319-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 37K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 184K 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 IBM319-PT-none-00
FORMULA_NAME IBM319-PT-none-01
FORMULA_NAME IBM319-PT-none-02
FORMULA_NAME IBM319-PT-none-03
FORMULA_NAME IBM319-PT-none-04
FORMULA_NAME IBM319-PT-none-05
FORMULA_NAME IBM319-PT-none-06
FORMULA_NAME IBM319-PT-none-07
FORMULA_NAME IBM319-PT-none-08
FORMULA_NAME IBM319-PT-none-09
FORMULA_NAME IBM319-PT-none-10
FORMULA_NAME IBM319-PT-none-11
FORMULA_NAME IBM319-PT-none-12
FORMULA_NAME IBM319-PT-none-13
FORMULA_NAME IBM319-PT-none-14
FORMULA_NAME IBM319-PT-none-15

=== Now, execution of the tool begins

BK_START 1620837459957

Running Version 0
[2021-05-12 16:37:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:37:41] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-12 16:37:41] [INFO ] Transformed 253 places.
[2021-05-12 16:37:41] [INFO ] Transformed 178 transitions.
[2021-05-12 16:37:41] [INFO ] Found NUPN structural information;
[2021-05-12 16:37:41] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2021-05-12 16:37:41] [INFO ] Parsed PT model containing 253 places and 178 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:37:41] [INFO ] Initial state test concluded for 2 properties.
FORMULA IBM319-PT-none-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 74 places
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 173 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 168 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 168 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 166 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 166 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 165 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 165 transition count 170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 164 transition count 169
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 164 transition count 169
Applied a total of 98 rules in 59 ms. Remains 164 /253 variables (removed 89) and now considering 169/178 (removed 9) transitions.
// Phase 1: matrix 169 rows 164 cols
[2021-05-12 16:37:41] [INFO ] Computed 7 place invariants in 11 ms
[2021-05-12 16:37:42] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 169 rows 164 cols
[2021-05-12 16:37:42] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-12 16:37:42] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 164 cols
[2021-05-12 16:37:42] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 16:37:42] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 164/253 places, 169/178 transitions.
[2021-05-12 16:37:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 16:37:42] [INFO ] Flatten gal took : 48 ms
FORMULA IBM319-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:37:42] [INFO ] Flatten gal took : 19 ms
[2021-05-12 16:37:42] [INFO ] Input system was already deterministic with 169 transitions.
Incomplete random walk after 100000 steps, including 1979 resets, run finished after 257 ms. (steps per millisecond=389 ) properties (out of 19) seen :17
Running SMT prover for 2 properties.
// Phase 1: matrix 169 rows 164 cols
[2021-05-12 16:37:42] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 16:37:42] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-12 16:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:42] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-12 16:37:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:37:42] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 16:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:42] [INFO ] [Nat]Absence check using state equation in 43 ms returned unsat
[2021-05-12 16:37:43] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-12 16:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:43] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-12 16:37:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:37:43] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-12 16:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:37:43] [INFO ] [Nat]Absence check using state equation in 44 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2021-05-12 16:37:43] [INFO ] Initial state test concluded for 1 properties.
FORMULA IBM319-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Graph (complete) has 187 edges and 164 vertex of which 162 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 159 transition count 61
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 116 rules applied. Total rules applied 224 place count 52 transition count 52
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 230 place count 46 transition count 52
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 230 place count 46 transition count 36
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 264 place count 28 transition count 36
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 266 place count 27 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 268 place count 26 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 268 place count 26 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 273 place count 23 transition count 32
Performed 10 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 293 place count 13 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 296 place count 13 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 12 transition count 15
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 300 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 301 place count 11 transition count 14
Applied a total of 301 rules in 20 ms. Remains 11 /164 variables (removed 153) and now considering 14/169 (removed 155) transitions.
// Phase 1: matrix 14 rows 11 cols
[2021-05-12 16:37:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:37:43] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2021-05-12 16:37:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:37:43] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-12 16:37:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2021-05-12 16:37:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:37:43] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/164 places, 14/169 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 45578 reset in 173 ms.
Product exploration explored 100000 steps with 45644 reset in 115 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM319-PT-none-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-00 finished in 1420 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Graph (complete) has 187 edges and 164 vertex of which 162 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 160 transition count 68
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 110 rules applied. Total rules applied 212 place count 59 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 219 place count 53 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 52 transition count 58
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 220 place count 52 transition count 43
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 252 place count 35 transition count 43
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 34 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 257 place count 33 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 258 place count 32 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 258 place count 32 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 261 place count 30 transition count 39
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 283 place count 19 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 286 place count 19 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 288 place count 18 transition count 22
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 8 with 2 rules applied. Total rules applied 290 place count 17 transition count 22
Applied a total of 290 rules in 14 ms. Remains 17 /164 variables (removed 147) and now considering 22/169 (removed 147) transitions.
// Phase 1: matrix 22 rows 17 cols
[2021-05-12 16:37:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:37:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 17 cols
[2021-05-12 16:37:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:37:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-12 16:37:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 17 cols
[2021-05-12 16:37:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:37:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/164 places, 22/169 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s14 0) (EQ s12 1)), p0:(OR (EQ s13 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 24045 reset in 100 ms.
Product exploration explored 100000 steps with 23996 reset in 87 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), p1, p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24094 reset in 97 ms.
Product exploration explored 100000 steps with 23970 reset in 74 ms.
[2021-05-12 16:37:45] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:37:45] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:37:45] [INFO ] Time to serialize gal into /tmp/LTL15318702478447165818.gal : 1 ms
[2021-05-12 16:37:45] [INFO ] Time to serialize properties into /tmp/LTL5832634086148480099.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/LTL15318702478447165818.gal, -t, CGAL, -LTL, /tmp/LTL5832634086148480099.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/LTL15318702478447165818.gal -t CGAL -LTL /tmp/LTL5832634086148480099.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G("((callToTask_s00002929_output_s00001054==0)||(callToTask_s00002960_input_s00001066==1))")))U(G("((callToTask_s00002963_output_s00001077==0)||(callToTask_s00002952_output_s00001054==1))"))))
Formula 0 simplified : !(FG"((callToTask_s00002929_output_s00001054==0)||(callToTask_s00002960_input_s00001066==1))" U G"((callToTask_s00002963_output_s00001077==0)||(callToTask_s00002952_output_s00001054==1))")
Reverse transition relation is NOT exact ! Due to transitions t81.t30.t112.t142.t76.t22.t114.t144.t156.t165.t154.t163, t82.t37.t115.t145.t90.t58.t156.t165.t154.t163, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :3/17/2/22
Computing Next relation with stutter on 8 deadlock states
12 unique states visited
0 strongly connected components in search stack
29 transitions explored
10 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.029487,17444,1,0,64,1156,81,62,523,1676,184
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IBM319-PT-none-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property IBM319-PT-none-01 finished in 822 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Graph (complete) has 187 edges and 164 vertex of which 162 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 159 transition count 69
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 105 rules applied. Total rules applied 205 place count 60 transition count 63
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 211 place count 56 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 213 place count 54 transition count 61
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 213 place count 54 transition count 45
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 247 place count 36 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 249 place count 35 transition count 44
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 252 place count 34 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 33 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 253 place count 33 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 258 place count 30 transition count 40
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 282 place count 18 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 286 place count 18 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 288 place count 17 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 8 with 2 rules applied. Total rules applied 290 place count 16 transition count 20
Applied a total of 290 rules in 11 ms. Remains 16 /164 variables (removed 148) and now considering 20/169 (removed 149) transitions.
// Phase 1: matrix 20 rows 16 cols
[2021-05-12 16:37:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:37:45] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 16 cols
[2021-05-12 16:37:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:37:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-12 16:37:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 16 cols
[2021-05-12 16:37:45] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-12 16:37:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/164 places, 20/169 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM319-PT-none-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s13 0) (EQ s5 1)), p0:(OR (EQ s3 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-02 finished in 130 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 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 159 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 152 transition count 162
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 152 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 152 transition count 161
Applied a total of 20 rules in 15 ms. Remains 152 /164 variables (removed 12) and now considering 161/169 (removed 8) transitions.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:45] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 16:37:45] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:45] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/164 places, 161/169 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-08 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 s84 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 IBM319-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-08 finished in 294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((F((G(p2)&&p1))&&p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 159 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 152 transition count 162
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 152 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 152 transition count 161
Applied a total of 20 rules in 7 ms. Remains 152 /164 variables (removed 12) and now considering 161/169 (removed 8) transitions.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:45] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 16:37:45] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:45] [INFO ] Computed 3 place invariants in 12 ms
[2021-05-12 16:37:46] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:46] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:46] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/164 places, 161/169 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : IBM319-PT-none-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s139 0) (EQ s145 1)), p1:(AND (NEQ s65 0) (NEQ s140 1)), p2:(AND (NEQ s65 0) (NEQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-10 finished in 421 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 159 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 152 transition count 162
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 152 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 152 transition count 161
Applied a total of 20 rules in 6 ms. Remains 152 /164 variables (removed 12) and now considering 161/169 (removed 8) transitions.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:46] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:46] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:46] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 16:37:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 152 cols
[2021-05-12 16:37:46] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:46] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 152/164 places, 161/169 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : IBM319-PT-none-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s88 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 234 ms.
Product exploration explored 100000 steps with 33333 reset in 225 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 152 transition count 161
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 152 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 152/152 places, 161/161 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 152 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 152 transition count 160
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 66 place count 152 transition count 179
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 101 place count 152 transition count 179
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 146 place count 107 transition count 134
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 191 place count 107 transition count 134
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 209 place count 107 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 214 place count 107 transition count 129
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 242 place count 79 transition count 101
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 3 with 28 rules applied. Total rules applied 270 place count 79 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 79 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 276 place count 75 transition count 97
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 280 place count 75 transition count 97
Performed 12 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 292 place count 75 transition count 177
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 323 place count 75 transition count 146
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 349 place count 49 transition count 90
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 26 rules applied. Total rules applied 375 place count 49 transition count 90
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 375 rules in 25 ms. Remains 49 /152 variables (removed 103) and now considering 90/161 (removed 71) transitions.
[2021-05-12 16:37:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 49 cols
[2021-05-12 16:37:50] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-12 16:37:50] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/152 places, 90/161 transitions.
Product exploration explored 100000 steps with 33333 reset in 435 ms.
Product exploration explored 100000 steps with 33333 reset in 330 ms.
[2021-05-12 16:37:51] [INFO ] Flatten gal took : 8 ms
[2021-05-12 16:37:51] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:37:51] [INFO ] Time to serialize gal into /tmp/LTL13420844863764822186.gal : 4 ms
[2021-05-12 16:37:51] [INFO ] Time to serialize properties into /tmp/LTL14374587074549585170.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/LTL13420844863764822186.gal, -t, CGAL, -LTL, /tmp/LTL14374587074549585170.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/LTL13420844863764822186.gal -t CGAL -LTL /tmp/LTL14374587074549585170.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X("((callToTask_s00002951_output_s00001054==0)||(callToTask_s00002930_input_s00001066==1))"))))
Formula 0 simplified : !XX"((callToTask_s00002951_output_s00001054==0)||(callToTask_s00002930_input_s00001066==1))"
Reverse transition relation is NOT exact ! Due to transitions t44, t150, t163, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :8/150/3/161
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.201493,23484,1,0,172,22075,334,143,3858,17557,328
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA IBM319-PT-none-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property IBM319-PT-none-12 finished in 5564 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 159 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 11 place count 153 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 153 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 153 transition count 162
Applied a total of 18 rules in 6 ms. Remains 153 /164 variables (removed 11) and now considering 162/169 (removed 7) transitions.
// Phase 1: matrix 162 rows 153 cols
[2021-05-12 16:37:51] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 16:37:51] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 162 rows 153 cols
[2021-05-12 16:37:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:51] [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 162 rows 153 cols
[2021-05-12 16:37:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:52] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/164 places, 162/169 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s79 0) (NEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-13 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(G(p0))&&((p0 U p1)||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 159 transition count 169
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 155 transition count 165
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 155 transition count 165
Applied a total of 13 rules in 5 ms. Remains 155 /164 variables (removed 9) and now considering 165/169 (removed 4) transitions.
// Phase 1: matrix 165 rows 155 cols
[2021-05-12 16:37:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:37:52] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 165 rows 155 cols
[2021-05-12 16:37:52] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 16:37:52] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 155 cols
[2021-05-12 16:37:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:52] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/164 places, 165/169 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IBM319-PT-none-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s59 0) (EQ s0 1)), p0:(OR (EQ s15 0) (EQ s149 1)), p2:(OR (EQ s79 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1997 reset in 73 ms.
Product exploration explored 100000 steps with 1982 reset in 84 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 165
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), (F (G p2)), p1, p0, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (G p1))
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA IBM319-PT-none-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property IBM319-PT-none-14 finished in 718 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p1))&&X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 169/169 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 159 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 154 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 154 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 154 transition count 163
Applied a total of 16 rules in 6 ms. Remains 154 /164 variables (removed 10) and now considering 163/169 (removed 6) transitions.
// Phase 1: matrix 163 rows 154 cols
[2021-05-12 16:37:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:52] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 163 rows 154 cols
[2021-05-12 16:37:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 16:37:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 163 rows 154 cols
[2021-05-12 16:37:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 16:37:53] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/164 places, 163/169 transitions.
Stuttering acceptance computed with spot in 1856 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : IBM319-PT-none-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s9 1), p1:(AND (NEQ s15 0) (NEQ s148 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-15 finished in 2067 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620837476359

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM319-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IBM319-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406800324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;