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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.2M 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 EnergyBus-PT-none-00
FORMULA_NAME EnergyBus-PT-none-01
FORMULA_NAME EnergyBus-PT-none-02
FORMULA_NAME EnergyBus-PT-none-03
FORMULA_NAME EnergyBus-PT-none-04
FORMULA_NAME EnergyBus-PT-none-05
FORMULA_NAME EnergyBus-PT-none-06
FORMULA_NAME EnergyBus-PT-none-07
FORMULA_NAME EnergyBus-PT-none-08
FORMULA_NAME EnergyBus-PT-none-09
FORMULA_NAME EnergyBus-PT-none-10
FORMULA_NAME EnergyBus-PT-none-11
FORMULA_NAME EnergyBus-PT-none-12
FORMULA_NAME EnergyBus-PT-none-13
FORMULA_NAME EnergyBus-PT-none-14
FORMULA_NAME EnergyBus-PT-none-15

=== Now, execution of the tool begins

BK_START 1620658957973

Running Version 0
[2021-05-10 15:02:50] [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-10 15:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:02:51] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2021-05-10 15:02:51] [INFO ] Transformed 157 places.
[2021-05-10 15:02:51] [INFO ] Transformed 4430 transitions.
[2021-05-10 15:02:51] [INFO ] Found NUPN structural information;
[2021-05-10 15:02:51] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:02:51] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 4 places in 23 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 129 transition count 1286
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 129 transition count 1286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 129 transition count 1284
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 129 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 128 transition count 1275
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 128 transition count 1275
Applied a total of 60 rules in 112 ms. Remains 128 /153 variables (removed 25) and now considering 1275/1913 (removed 638) transitions.
[2021-05-10 15:02:51] [INFO ] Flow matrix only has 461 transitions (discarded 814 similar events)
// Phase 1: matrix 461 rows 128 cols
[2021-05-10 15:02:51] [INFO ] Computed 23 place invariants in 21 ms
[2021-05-10 15:02:52] [INFO ] Implicit Places using invariants in 375 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 417 ms to find 1 implicit places.
[2021-05-10 15:02:52] [INFO ] Flow matrix only has 461 transitions (discarded 814 similar events)
// Phase 1: matrix 461 rows 127 cols
[2021-05-10 15:02:52] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-10 15:02:52] [INFO ] Dead Transitions using invariants and state equation in 548 ms returned []
Starting structural reductions, iteration 1 : 127/153 places, 1275/1913 transitions.
Applied a total of 0 rules in 20 ms. Remains 127 /127 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2021-05-10 15:02:52] [INFO ] Flow matrix only has 461 transitions (discarded 814 similar events)
// Phase 1: matrix 461 rows 127 cols
[2021-05-10 15:02:52] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:02:53] [INFO ] Dead Transitions using invariants and state equation in 453 ms returned []
Finished structural reductions, in 2 iterations. Remains : 127/153 places, 1275/1913 transitions.
[2021-05-10 15:02:53] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-10 15:02:53] [INFO ] Flatten gal took : 279 ms
FORMULA EnergyBus-PT-none-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:02:53] [INFO ] Flatten gal took : 152 ms
[2021-05-10 15:02:54] [INFO ] Input system was already deterministic with 1275 transitions.
Finished random walk after 65181 steps, including 1 resets, run visited all 9 properties in 806 ms. (steps per millisecond=80 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(p0)||(p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1275/1275 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 1129
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 1129
Applied a total of 6 rules in 17 ms. Remains 124 /127 variables (removed 3) and now considering 1129/1275 (removed 146) transitions.
[2021-05-10 15:02:54] [INFO ] Flow matrix only has 423 transitions (discarded 706 similar events)
// Phase 1: matrix 423 rows 124 cols
[2021-05-10 15:02:54] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-10 15:02:55] [INFO ] Implicit Places using invariants in 210 ms returned []
[2021-05-10 15:02:55] [INFO ] Flow matrix only has 423 transitions (discarded 706 similar events)
// Phase 1: matrix 423 rows 124 cols
[2021-05-10 15:02:55] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-10 15:02:55] [INFO ] State equation strengthened by 277 read => feed constraints.
[2021-05-10 15:02:55] [INFO ] Implicit Places using invariants and state equation in 656 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 871 ms to find 2 implicit places.
[2021-05-10 15:02:55] [INFO ] Flow matrix only has 423 transitions (discarded 706 similar events)
// Phase 1: matrix 423 rows 122 cols
[2021-05-10 15:02:55] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:02:56] [INFO ] Dead Transitions using invariants and state equation in 437 ms returned []
Starting structural reductions, iteration 1 : 122/127 places, 1129/1275 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 1129/1129 (removed 0) transitions.
[2021-05-10 15:02:56] [INFO ] Flow matrix only has 423 transitions (discarded 706 similar events)
// Phase 1: matrix 423 rows 122 cols
[2021-05-10 15:02:56] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:02:56] [INFO ] Dead Transitions using invariants and state equation in 391 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 1129/1275 transitions.
Stuttering acceptance computed with spot in 11011 ms :[(NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), true]
Running random walk in product with property : EnergyBus-PT-none-03 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(AND (NEQ s105 1) (OR (NEQ s45 0) (NEQ s15 1))), p1:(OR (NEQ s45 0) (NEQ s15 1)), p0:(EQ s105 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67693 steps with 0 reset in 658 ms.
FORMULA EnergyBus-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-03 finished in 13447 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p1 U X(G(p2)))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1275/1275 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 123 transition count 1189
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 123 transition count 1189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 123 transition count 1188
Applied a total of 9 rules in 14 ms. Remains 123 /127 variables (removed 4) and now considering 1188/1275 (removed 87) transitions.
[2021-05-10 15:03:08] [INFO ] Flow matrix only has 434 transitions (discarded 754 similar events)
// Phase 1: matrix 434 rows 123 cols
[2021-05-10 15:03:08] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:03:08] [INFO ] Implicit Places using invariants in 175 ms returned []
[2021-05-10 15:03:08] [INFO ] Flow matrix only has 434 transitions (discarded 754 similar events)
// Phase 1: matrix 434 rows 123 cols
[2021-05-10 15:03:08] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:03:08] [INFO ] State equation strengthened by 293 read => feed constraints.
[2021-05-10 15:03:09] [INFO ] Implicit Places using invariants and state equation in 558 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 738 ms to find 2 implicit places.
[2021-05-10 15:03:09] [INFO ] Flow matrix only has 434 transitions (discarded 754 similar events)
// Phase 1: matrix 434 rows 121 cols
[2021-05-10 15:03:09] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:09] [INFO ] Dead Transitions using invariants and state equation in 497 ms returned []
Starting structural reductions, iteration 1 : 121/127 places, 1188/1275 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2021-05-10 15:03:09] [INFO ] Flow matrix only has 434 transitions (discarded 754 similar events)
// Phase 1: matrix 434 rows 121 cols
[2021-05-10 15:03:09] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:03:10] [INFO ] Dead Transitions using invariants and state equation in 471 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/127 places, 1188/1275 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : EnergyBus-PT-none-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s106 1)), p1:(EQ s103 0), p2:(AND (NEQ s55 0) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-04 finished in 1864 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1275/1275 transitions.
Graph (trivial) has 102 edges and 127 vertex of which 15 / 127 are part of one of the 6 SCC in 3 ms
Free SCC test removed 9 places
Ensure Unique test removed 683 transitions
Reduce isomorphic transitions removed 683 transitions.
Reduce places removed 1 places and 1 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 0 with 4 rules applied. Total rules applied 5 place count 117 transition count 587
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 113 transition count 587
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 113 transition count 583
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 109 transition count 583
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 105 transition count 526
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 105 transition count 526
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 55 place count 105 transition count 496
Performed 12 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 82 place count 90 transition count 460
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 65 edges and 90 vertex of which 4 / 90 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 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 8 rules applied. Total rules applied 90 place count 88 transition count 453
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 95 place count 87 transition count 449
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 95 place count 87 transition count 448
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 86 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 105 place count 81 transition count 445
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 60 edges and 81 vertex of which 2 / 81 are part of one of the 1 SCC in 0 ms
Free SCC test 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 5 with 33 rules applied. Total rules applied 138 place count 80 transition count 413
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 143 place count 78 transition count 410
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 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 146 place count 76 transition count 409
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 147 place count 76 transition count 408
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 149 place count 75 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 150 place count 74 transition count 407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 154 place count 72 transition count 405
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 160 place count 69 transition count 405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 162 place count 69 transition count 403
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 11 with 14 rules applied. Total rules applied 176 place count 69 transition count 389
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 176 place count 69 transition count 383
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 190 place count 61 transition count 383
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 2 rules applied. Total rules applied 192 place count 61 transition count 381
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 196 place count 59 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 2 Pre rules applied. Total rules applied 196 place count 59 transition count 377
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 202 place count 55 transition count 377
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 206 place count 53 transition count 375
Graph (trivial) has 35 edges and 53 vertex of which 2 / 53 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 208 place count 51 transition count 375
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 13 with 156 rules applied. Total rules applied 364 place count 51 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 365 place count 50 transition count 218
Applied a total of 365 rules in 171 ms. Remains 50 /127 variables (removed 77) and now considering 218/1275 (removed 1057) transitions.
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 147 transitions (discarded 71 similar events)
// Phase 1: matrix 147 rows 50 cols
[2021-05-10 15:03:10] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-10 15:03:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 147 transitions (discarded 71 similar events)
// Phase 1: matrix 147 rows 50 cols
[2021-05-10 15:03:10] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-10 15:03:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-10 15:03:10] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [7, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 114 ms to find 2 implicit places.
[2021-05-10 15:03:10] [INFO ] Redundant transitions in 36 ms returned [33]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[33]
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 146 transitions (discarded 71 similar events)
// Phase 1: matrix 146 rows 48 cols
[2021-05-10 15:03:10] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-10 15:03:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Starting structural reductions, iteration 1 : 48/127 places, 217/1275 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 46 transition count 216
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 46 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 45 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 45 transition count 212
Applied a total of 7 rules in 12 ms. Remains 45 /48 variables (removed 3) and now considering 212/217 (removed 5) transitions.
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 141 transitions (discarded 71 similar events)
// Phase 1: matrix 141 rows 45 cols
[2021-05-10 15:03:10] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-10 15:03:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 141 transitions (discarded 71 similar events)
// Phase 1: matrix 141 rows 45 cols
[2021-05-10 15:03:10] [INFO ] Computed 7 place invariants in 8 ms
[2021-05-10 15:03:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2021-05-10 15:03:10] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/127 places, 212/1275 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s39 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-08 finished in 576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X((p1 U (!p0||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1275/1275 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 1125
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 1125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 122 transition count 1124
Applied a total of 11 rules in 11 ms. Remains 122 /127 variables (removed 5) and now considering 1124/1275 (removed 151) transitions.
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 122 cols
[2021-05-10 15:03:10] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:03:10] [INFO ] Implicit Places using invariants in 145 ms returned []
[2021-05-10 15:03:10] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 122 cols
[2021-05-10 15:03:10] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:11] [INFO ] State equation strengthened by 277 read => feed constraints.
[2021-05-10 15:03:11] [INFO ] Implicit Places using invariants and state equation in 521 ms returned [20, 94]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 669 ms to find 2 implicit places.
[2021-05-10 15:03:11] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 120 cols
[2021-05-10 15:03:11] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:11] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Starting structural reductions, iteration 1 : 120/127 places, 1124/1275 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 1124/1124 (removed 0) transitions.
[2021-05-10 15:03:11] [INFO ] Flow matrix only has 418 transitions (discarded 706 similar events)
// Phase 1: matrix 418 rows 120 cols
[2021-05-10 15:03:11] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:12] [INFO ] Dead Transitions using invariants and state equation in 403 ms returned []
Finished structural reductions, in 2 iterations. Remains : 120/127 places, 1124/1275 transitions.
Stuttering acceptance computed with spot in 404 ms :[true, false, (AND p0 (NOT p1)), (NOT p0), false, false]
Running random walk in product with property : EnergyBus-PT-none-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s13 0) (EQ s78 1)), p1:(NEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4263 ms.
Product exploration explored 100000 steps with 33333 reset in 4263 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 131 ms :[true, false, (AND p0 (NOT p1)), (NOT p0), false, false]
Product exploration explored 100000 steps with 33333 reset in 4239 ms.
Product exploration explored 100000 steps with 33333 reset in 4230 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, false, (AND p0 (NOT p1)), (NOT p0), false, false]
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, 1124/1124 transitions.
Graph (trivial) has 96 edges and 120 vertex of which 14 / 120 are part of one of the 6 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 590 transitions
Reduce isomorphic transitions removed 590 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 112 transition count 534
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 112 transition count 631
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 112 transition count 631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 111 transition count 630
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 111 transition count 630
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 70 place count 111 transition count 570
Performed 12 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 111 transition count 549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 111 transition count 547
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 110 transition count 546
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 110 transition count 546
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 92 place count 110 transition count 572
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 98 place count 110 transition count 566
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 107 transition count 560
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 107 transition count 560
Deduced a syphon composed of 21 places in 1 ms
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 124 place count 107 transition count 540
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 107 transition count 540
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 128 place count 104 transition count 537
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 131 place count 104 transition count 537
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 136 place count 104 transition count 537
Deduced a syphon composed of 24 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 104 transition count 535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 103 transition count 535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 102 transition count 534
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 102 transition count 534
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 141 rules in 105 ms. Remains 102 /120 variables (removed 18) and now considering 534/1124 (removed 590) transitions.
[2021-05-10 15:03:35] [INFO ] Redundant transitions in 623 ms returned [261]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[261]
[2021-05-10 15:03:35] [INFO ] Flow matrix only has 292 transitions (discarded 241 similar events)
// Phase 1: matrix 292 rows 102 cols
[2021-05-10 15:03:35] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-10 15:03:35] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Starting structural reductions, iteration 1 : 102/120 places, 533/1124 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 533
Deduced a syphon composed of 24 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 101 transition count 529
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 101 transition count 529
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 5 rules in 25 ms. Remains 101 /102 variables (removed 1) and now considering 529/533 (removed 4) transitions.
Finished structural reductions, in 2 iterations. Remains : 101/120 places, 529/1124 transitions.
Product exploration explored 100000 steps with 33333 reset in 6513 ms.
Product exploration explored 100000 steps with 33333 reset in 4777 ms.
[2021-05-10 15:03:47] [INFO ] Flatten gal took : 144 ms
[2021-05-10 15:03:47] [INFO ] Flatten gal took : 106 ms
[2021-05-10 15:03:47] [INFO ] Time to serialize gal into /tmp/LTL8779393852934777230.gal : 41 ms
[2021-05-10 15:03:47] [INFO ] Time to serialize properties into /tmp/LTL6531965980349532766.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/LTL8779393852934777230.gal, -t, CGAL, -LTL, /tmp/LTL6531965980349532766.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/LTL8779393852934777230.gal -t CGAL -LTL /tmp/LTL6531965980349532766.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((p16==0)||(p101==1))"))||(X(("(p101!=1)")U(("((p16!=0)&&(p101!=1))")||(G("(p101!=1)"))))))))
Formula 0 simplified : !X(G"((p16==0)||(p101==1))" | X("(p101!=1)" U ("((p16!=0)&&(p101!=1))" | G"(p101!=1)")))
Detected timeout of ITS tools.
[2021-05-10 15:04:13] [INFO ] Flatten gal took : 100 ms
[2021-05-10 15:04:13] [INFO ] Applying decomposition
[2021-05-10 15:04:13] [INFO ] Flatten gal took : 104 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/graph12900926993292714990.txt, -o, /tmp/graph12900926993292714990.bin, -w, /tmp/graph12900926993292714990.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/graph12900926993292714990.bin, -l, -1, -v, -w, /tmp/graph12900926993292714990.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 15:04:17] [INFO ] Decomposing Gal with order
[2021-05-10 15:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 15:04:17] [INFO ] Removed a total of 5010 redundant transitions.
[2021-05-10 15:04:18] [INFO ] Flatten gal took : 267 ms
[2021-05-10 15:04:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 44 ms.
[2021-05-10 15:04:18] [INFO ] Time to serialize gal into /tmp/LTL10996219298719828816.gal : 6 ms
[2021-05-10 15:04:18] [INFO ] Time to serialize properties into /tmp/LTL14734742742248246695.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/LTL10996219298719828816.gal, -t, CGAL, -LTL, /tmp/LTL14734742742248246695.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/LTL10996219298719828816.gal -t CGAL -LTL /tmp/LTL14734742742248246695.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((i7.u5.p16==0)||(i13.u6.p101==1))"))||(X(("(i13.u6.p101!=1)")U(("((i7.u5.p16!=0)&&(i13.u6.p101!=1))")||(G("(i13.u6.p101!=1)"))))))))
Formula 0 simplified : !X(G"((i7.u5.p16==0)||(i13.u6.p101==1))" | X("(i13.u6.p101!=1)" U ("((i7.u5.p16!=0)&&(i13.u6.p101!=1))" | G"(i13.u6.p101!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t21, t56, t75, t76, t78, t81, t102, t118, t124, t1229, t1246, t1247, t1250, t1255, t1259, t1260, u12.t54, u12.t90, u16.t36, u16.t96, u20.t74, i0.t66, i0.u23.t22, i1.t1248, i1.u4.t59, i1.u30.t8, i1.u30.t9, i1.u32.t2, i1.u32.t3, i4.t1274, i4.t1273, i4.t1271, i4.t1270, i7.u5.t58, i7.u5.t1238, i7.u5.t1239, i7.u31.t5, i7.u31.t6, i12.u26.t100, i13.u6.t1264, i13.u27.t15, i13.u27.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/444/42/486
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
296 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,2.98899,101612,1,0,102470,2969,6272,638155,620,14301,271988
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA EnergyBus-PT-none-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property EnergyBus-PT-none-12 finished in 70681 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659062331

--------------------
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="EnergyBus-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 EnergyBus-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 r083-tall-162048875700676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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