fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875700677
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2861.840 208456.00 314827.00 27856.30 TFFFFFFFFFFFFFFF normal

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

--------------------
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 1620658959326

Running Version 0
[2021-05-10 15:02:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 15:02:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:02:53] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2021-05-10 15:02:53] [INFO ] Transformed 157 places.
[2021-05-10 15:02:53] [INFO ] Transformed 4430 transitions.
[2021-05-10 15:02:53] [INFO ] Found NUPN structural information;
[2021-05-10 15:02:53] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:02:53] [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-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 132 transition count 1873
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 132 transition count 1873
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 132 transition count 1870
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 132 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 131 transition count 1861
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 131 transition count 1861
Applied a total of 55 rules in 91 ms. Remains 131 /153 variables (removed 22) and now considering 1861/1913 (removed 52) transitions.
[2021-05-10 15:02:53] [INFO ] Flow matrix only has 603 transitions (discarded 1258 similar events)
// Phase 1: matrix 603 rows 131 cols
[2021-05-10 15:02:53] [INFO ] Computed 23 place invariants in 24 ms
[2021-05-10 15:02:53] [INFO ] Implicit Places using invariants in 187 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
[2021-05-10 15:02:53] [INFO ] Flow matrix only has 603 transitions (discarded 1258 similar events)
// Phase 1: matrix 603 rows 130 cols
[2021-05-10 15:02:53] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-10 15:02:54] [INFO ] Dead Transitions using invariants and state equation in 719 ms returned []
Starting structural reductions, iteration 1 : 130/153 places, 1861/1913 transitions.
Applied a total of 0 rules in 13 ms. Remains 130 /130 variables (removed 0) and now considering 1861/1861 (removed 0) transitions.
[2021-05-10 15:02:54] [INFO ] Flow matrix only has 603 transitions (discarded 1258 similar events)
// Phase 1: matrix 603 rows 130 cols
[2021-05-10 15:02:54] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-10 15:02:55] [INFO ] Dead Transitions using invariants and state equation in 717 ms returned []
Finished structural reductions, in 2 iterations. Remains : 130/153 places, 1861/1913 transitions.
[2021-05-10 15:02:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 15:02:55] [INFO ] Flatten gal took : 394 ms
FORMULA EnergyBus-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:02:55] [INFO ] Flatten gal took : 212 ms
[2021-05-10 15:02:56] [INFO ] Input system was already deterministic with 1861 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1720 ms. (steps per millisecond=58 ) properties (out of 22) seen :4
Running SMT prover for 18 properties.
[2021-05-10 15:03:08] [INFO ] Flow matrix only has 603 transitions (discarded 1258 similar events)
// Phase 1: matrix 603 rows 130 cols
[2021-05-10 15:03:08] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-10 15:03:08] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:08] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-10 15:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:08] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-10 15:03:08] [INFO ] State equation strengthened by 461 read => feed constraints.
[2021-05-10 15:03:08] [INFO ] [Real]Added 461 Read/Feed constraints in 76 ms returned sat
[2021-05-10 15:03:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:08] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2021-05-10 15:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:08] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-10 15:03:08] [INFO ] [Nat]Added 461 Read/Feed constraints in 75 ms returned sat
[2021-05-10 15:03:09] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 4 ms to minimize.
[2021-05-10 15:03:09] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 1 ms to minimize.
[2021-05-10 15:03:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 445 ms
[2021-05-10 15:03:09] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:09] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-10 15:03:09] [INFO ] [Real]Added 461 Read/Feed constraints in 77 ms returned sat
[2021-05-10 15:03:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-10 15:03:09] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:09] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-10 15:03:09] [INFO ] [Nat]Added 461 Read/Feed constraints in 72 ms returned sat
[2021-05-10 15:03:09] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2021-05-10 15:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-10 15:03:10] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 125 ms.
[2021-05-10 15:03:10] [INFO ] Added : 95 causal constraints over 19 iterations in 967 ms. Result :sat
[2021-05-10 15:03:10] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:11] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-10 15:03:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:11] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-10 15:03:11] [INFO ] [Nat]Added 461 Read/Feed constraints in 76 ms returned sat
[2021-05-10 15:03:11] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
[2021-05-10 15:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-10 15:03:11] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 300 ms.
[2021-05-10 15:03:12] [INFO ] Added : 105 causal constraints over 21 iterations in 1249 ms. Result :sat
[2021-05-10 15:03:12] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:12] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-10 15:03:12] [INFO ] [Real]Added 461 Read/Feed constraints in 65 ms returned sat
[2021-05-10 15:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:12] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:12] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2021-05-10 15:03:13] [INFO ] [Nat]Added 461 Read/Feed constraints in 61 ms returned sat
[2021-05-10 15:03:13] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2021-05-10 15:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-10 15:03:13] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 84 ms.
[2021-05-10 15:03:14] [INFO ] Added : 108 causal constraints over 22 iterations in 934 ms. Result :sat
[2021-05-10 15:03:14] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-10 15:03:14] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:14] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-10 15:03:14] [INFO ] [Real]Added 461 Read/Feed constraints in 75 ms returned sat
[2021-05-10 15:03:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:14] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:14] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-10 15:03:14] [INFO ] [Nat]Added 461 Read/Feed constraints in 75 ms returned sat
[2021-05-10 15:03:14] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-10 15:03:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-10 15:03:14] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 92 ms.
[2021-05-10 15:03:15] [INFO ] Added : 102 causal constraints over 21 iterations in 944 ms. Result :sat
[2021-05-10 15:03:15] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:15] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:15] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-10 15:03:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:15] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-10 15:03:15] [INFO ] [Nat]Added 461 Read/Feed constraints in 73 ms returned sat
[2021-05-10 15:03:15] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2021-05-10 15:03:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-10 15:03:15] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 88 ms.
[2021-05-10 15:03:16] [INFO ] Added : 102 causal constraints over 21 iterations in 901 ms. Result :sat
[2021-05-10 15:03:16] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-10 15:03:16] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:16] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-10 15:03:16] [INFO ] [Real]Added 461 Read/Feed constraints in 74 ms returned sat
[2021-05-10 15:03:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-10 15:03:17] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2021-05-10 15:03:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:17] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-10 15:03:17] [INFO ] [Nat]Added 461 Read/Feed constraints in 75 ms returned sat
[2021-05-10 15:03:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 4 ms to minimize.
[2021-05-10 15:03:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2021-05-10 15:03:17] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 84 ms.
[2021-05-10 15:03:18] [INFO ] Added : 102 causal constraints over 21 iterations in 1003 ms. Result :sat
[2021-05-10 15:03:18] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:18] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-10 15:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:18] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-10 15:03:18] [INFO ] [Real]Added 461 Read/Feed constraints in 70 ms returned sat
[2021-05-10 15:03:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:18] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-10 15:03:18] [INFO ] [Nat]Added 461 Read/Feed constraints in 71 ms returned sat
[2021-05-10 15:03:18] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-10 15:03:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-10 15:03:18] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 84 ms.
[2021-05-10 15:03:19] [INFO ] Added : 95 causal constraints over 19 iterations in 817 ms. Result :sat
[2021-05-10 15:03:19] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-10 15:03:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:19] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-10 15:03:19] [INFO ] [Real]Added 461 Read/Feed constraints in 60 ms returned sat
[2021-05-10 15:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:19] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:19] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2021-05-10 15:03:19] [INFO ] [Nat]Added 461 Read/Feed constraints in 60 ms returned sat
[2021-05-10 15:03:20] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2021-05-10 15:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-10 15:03:20] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 80 ms.
[2021-05-10 15:03:20] [INFO ] Added : 110 causal constraints over 22 iterations in 936 ms. Result :sat
[2021-05-10 15:03:21] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:21] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:21] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-10 15:03:21] [INFO ] [Real]Added 461 Read/Feed constraints in 60 ms returned sat
[2021-05-10 15:03:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:21] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-10 15:03:21] [INFO ] [Nat]Added 461 Read/Feed constraints in 64 ms returned sat
[2021-05-10 15:03:21] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 94 ms.
[2021-05-10 15:03:22] [INFO ] Added : 109 causal constraints over 22 iterations in 833 ms. Result :sat
[2021-05-10 15:03:22] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-10 15:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:22] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-10 15:03:22] [INFO ] [Real]Added 461 Read/Feed constraints in 74 ms returned sat
[2021-05-10 15:03:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-10 15:03:22] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:22] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-10 15:03:22] [INFO ] [Nat]Added 461 Read/Feed constraints in 76 ms returned sat
[2021-05-10 15:03:22] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 1 ms to minimize.
[2021-05-10 15:03:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-10 15:03:22] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 95 ms.
[2021-05-10 15:03:23] [INFO ] Added : 95 causal constraints over 19 iterations in 796 ms. Result :sat
[2021-05-10 15:03:23] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:23] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:23] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-10 15:03:23] [INFO ] [Real]Added 461 Read/Feed constraints in 73 ms returned sat
[2021-05-10 15:03:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2021-05-10 15:03:23] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:23] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-10 15:03:23] [INFO ] [Nat]Added 461 Read/Feed constraints in 76 ms returned sat
[2021-05-10 15:03:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2021-05-10 15:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2021-05-10 15:03:24] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 85 ms.
[2021-05-10 15:03:24] [INFO ] Added : 94 causal constraints over 19 iterations in 853 ms. Result :sat
[2021-05-10 15:03:24] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-10 15:03:24] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:25] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-10 15:03:25] [INFO ] [Real]Added 461 Read/Feed constraints in 72 ms returned sat
[2021-05-10 15:03:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:25] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-10 15:03:25] [INFO ] [Nat]Added 461 Read/Feed constraints in 80 ms returned sat
[2021-05-10 15:03:25] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2021-05-10 15:03:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-10 15:03:25] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 80 ms.
[2021-05-10 15:03:26] [INFO ] Added : 95 causal constraints over 19 iterations in 836 ms. Result :sat
[2021-05-10 15:03:26] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-10 15:03:26] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:26] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-10 15:03:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:26] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:26] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-10 15:03:26] [INFO ] [Nat]Added 461 Read/Feed constraints in 73 ms returned sat
[2021-05-10 15:03:26] [INFO ] Deduced a trap composed of 5 places in 10 ms of which 0 ms to minimize.
[2021-05-10 15:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-10 15:03:26] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 98 ms.
[2021-05-10 15:03:27] [INFO ] Added : 103 causal constraints over 21 iterations in 929 ms. Result :sat
[2021-05-10 15:03:27] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:27] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:27] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-10 15:03:27] [INFO ] [Real]Added 461 Read/Feed constraints in 74 ms returned sat
[2021-05-10 15:03:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:27] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:28] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-10 15:03:28] [INFO ] [Nat]Added 461 Read/Feed constraints in 78 ms returned sat
[2021-05-10 15:03:28] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-10 15:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-10 15:03:28] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 91 ms.
[2021-05-10 15:03:29] [INFO ] Added : 96 causal constraints over 20 iterations in 868 ms. Result :sat
[2021-05-10 15:03:29] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:29] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:29] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-10 15:03:29] [INFO ] [Real]Added 461 Read/Feed constraints in 77 ms returned sat
[2021-05-10 15:03:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:29] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:29] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-10 15:03:29] [INFO ] [Nat]Added 461 Read/Feed constraints in 77 ms returned sat
[2021-05-10 15:03:29] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-10 15:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-10 15:03:29] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 81 ms.
[2021-05-10 15:03:30] [INFO ] Added : 104 causal constraints over 21 iterations in 896 ms. Result :sat
[2021-05-10 15:03:30] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:30] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-10 15:03:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-10 15:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:30] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-10 15:03:30] [INFO ] [Nat]Added 461 Read/Feed constraints in 71 ms returned sat
[2021-05-10 15:03:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2021-05-10 15:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-10 15:03:30] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 81 ms.
[2021-05-10 15:03:31] [INFO ] Added : 104 causal constraints over 21 iterations in 926 ms. Result :sat
[2021-05-10 15:03:31] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-10 15:03:31] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:31] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-10 15:03:31] [INFO ] [Real]Added 461 Read/Feed constraints in 80 ms returned sat
[2021-05-10 15:03:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:03:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-10 15:03:31] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-10 15:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:03:32] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-10 15:03:32] [INFO ] [Nat]Added 461 Read/Feed constraints in 69 ms returned sat
[2021-05-10 15:03:32] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2021-05-10 15:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-10 15:03:32] [INFO ] Computed and/alt/rep : 118/348/117 causal constraints (skipped 485 transitions) in 87 ms.
[2021-05-10 15:03:33] [INFO ] Added : 104 causal constraints over 21 iterations in 896 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Graph (trivial) has 83 edges and 130 vertex of which 10 / 130 are part of one of the 4 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 124 transition count 1845
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 120 transition count 1845
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 120 transition count 1841
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 116 transition count 1841
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 25 place count 108 transition count 1104
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 108 transition count 1104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 33 place count 108 transition count 1103
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 107 transition count 1103
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 53 place count 98 transition count 1094
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 98 transition count 1092
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 67 place count 92 transition count 1104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 71 place count 92 transition count 1100
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 84 place count 92 transition count 1087
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 92 transition count 1086
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 86 place count 91 transition count 1086
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 94 place count 87 transition count 1082
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 87 transition count 1081
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 place count 86 transition count 1081
Applied a total of 96 rules in 268 ms. Remains 86 /130 variables (removed 44) and now considering 1081/1861 (removed 780) transitions.
[2021-05-10 15:03:33] [INFO ] Flow matrix only has 269 transitions (discarded 812 similar events)
// Phase 1: matrix 269 rows 86 cols
[2021-05-10 15:03:33] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-10 15:03:33] [INFO ] Implicit Places using invariants in 122 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
[2021-05-10 15:03:34] [INFO ] Redundant transitions in 1217 ms returned [65]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[65]
[2021-05-10 15:03:34] [INFO ] Flow matrix only has 268 transitions (discarded 812 similar events)
// Phase 1: matrix 268 rows 85 cols
[2021-05-10 15:03:34] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:03:35] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Starting structural reductions, iteration 1 : 85/130 places, 1080/1861 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 1079
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 83 transition count 1075
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 83 transition count 1075
Applied a total of 6 rules in 51 ms. Remains 83 /85 variables (removed 2) and now considering 1075/1080 (removed 5) transitions.
[2021-05-10 15:03:35] [INFO ] Flow matrix only has 263 transitions (discarded 812 similar events)
// Phase 1: matrix 263 rows 83 cols
[2021-05-10 15:03:35] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:35] [INFO ] Implicit Places using invariants in 106 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 82/130 places, 1075/1861 transitions.
Applied a total of 0 rules in 19 ms. Remains 82 /82 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2021-05-10 15:03:36] [INFO ] Redundant transitions in 1326 ms returned []
[2021-05-10 15:03:36] [INFO ] Flow matrix only has 263 transitions (discarded 812 similar events)
// Phase 1: matrix 263 rows 82 cols
[2021-05-10 15:03:36] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-10 15:03:37] [INFO ] Dead Transitions using invariants and state equation in 399 ms returned []
Finished structural reductions, in 3 iterations. Remains : 82/130 places, 1075/1861 transitions.
Stuttering acceptance computed with spot in 4717 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1) (EQ s20 1) (EQ s26 1) (EQ s39 1) (EQ s54 1) (EQ s58 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA EnergyBus-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-01 finished in 8635 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 11 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 124 transition count 1316
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 124 transition count 1316
Applied a total of 12 rules in 17 ms. Remains 124 /130 variables (removed 6) and now considering 1316/1861 (removed 545) transitions.
[2021-05-10 15:03:41] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 124 cols
[2021-05-10 15:03:41] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:41] [INFO ] Implicit Places using invariants in 143 ms returned []
[2021-05-10 15:03:41] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 124 cols
[2021-05-10 15:03:41] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:03:42] [INFO ] State equation strengthened by 325 read => feed constraints.
[2021-05-10 15:03:42] [INFO ] Implicit Places using invariants and state equation in 618 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 764 ms to find 2 implicit places.
[2021-05-10 15:03:42] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 122 cols
[2021-05-10 15:03:42] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:03:43] [INFO ] Dead Transitions using invariants and state equation in 453 ms returned []
Starting structural reductions, iteration 1 : 122/130 places, 1316/1861 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
[2021-05-10 15:03:43] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 122 cols
[2021-05-10 15:03:43] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:03:43] [INFO ] Dead Transitions using invariants and state equation in 497 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/130 places, 1316/1861 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : EnergyBus-PT-none-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s73 1) (EQ s83 1) (EQ s91 1) (EQ s116 1)), p0:(OR (EQ s13 0) (EQ s15 0) (EQ s34 0) (EQ s46 0) (EQ s68 0) (EQ s87 0) (EQ s91 0) (EQ s104 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-02 finished in 1870 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&(X(X(G(p0)))||p1))))], workingDir=/home/mcc/execution]
Support contains 14 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 1236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 1236
Applied a total of 14 rules in 17 ms. Remains 123 /130 variables (removed 7) and now considering 1236/1861 (removed 625) transitions.
[2021-05-10 15:03:43] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 123 cols
[2021-05-10 15:03:43] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:43] [INFO ] Implicit Places using invariants in 79 ms returned []
[2021-05-10 15:03:43] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 123 cols
[2021-05-10 15:03:43] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:03:43] [INFO ] State equation strengthened by 305 read => feed constraints.
[2021-05-10 15:03:44] [INFO ] Implicit Places using invariants and state equation in 449 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 531 ms to find 2 implicit places.
[2021-05-10 15:03:44] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 121 cols
[2021-05-10 15:03:44] [INFO ] Computed 20 place invariants in 8 ms
[2021-05-10 15:03:44] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Starting structural reductions, iteration 1 : 121/130 places, 1236/1861 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2021-05-10 15:03:44] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 121 cols
[2021-05-10 15:03:44] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:45] [INFO ] Dead Transitions using invariants and state equation in 469 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/130 places, 1236/1861 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s75 1) (EQ s86 1) (EQ s89 1) (EQ s114 1)), p1:(OR (EQ s13 0) (EQ s15 0) (EQ s34 0) (EQ s46 0) (EQ s75 0) (EQ s86 0) (EQ s89 0) (EQ s114 0) (AND (EQ s13 1) (EQ s15 1) (EQ s48 1) (EQ s60 1) (EQ s78 1) (EQ s82 1) (EQ s90 1) (EQ s111 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-04 finished in 1619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G((p1 U (p2||X(p2))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 11 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 1236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 1236
Applied a total of 14 rules in 11 ms. Remains 123 /130 variables (removed 7) and now considering 1236/1861 (removed 625) transitions.
[2021-05-10 15:03:45] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 123 cols
[2021-05-10 15:03:45] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:45] [INFO ] Implicit Places using invariants in 119 ms returned []
[2021-05-10 15:03:45] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 123 cols
[2021-05-10 15:03:45] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:45] [INFO ] State equation strengthened by 305 read => feed constraints.
[2021-05-10 15:03:45] [INFO ] Implicit Places using invariants and state equation in 545 ms returned [20, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 667 ms to find 2 implicit places.
[2021-05-10 15:03:45] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 121 cols
[2021-05-10 15:03:45] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:46] [INFO ] Dead Transitions using invariants and state equation in 451 ms returned []
Starting structural reductions, iteration 1 : 121/130 places, 1236/1861 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2021-05-10 15:03:46] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 121 cols
[2021-05-10 15:03:46] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:46] [INFO ] Dead Transitions using invariants and state equation in 460 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/130 places, 1236/1861 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : EnergyBus-PT-none-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s63 1) (EQ s86 1) (EQ s90 1) (EQ s102 1)), p2:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s63 1) (EQ s86 1) (EQ s90 1) (EQ s102 1)), p1:(OR (EQ s13 0) (EQ s15 0) (EQ s34 0) (EQ s46 0) (EQ s74 0) (EQ s85 0) (EQ s90 0) (EQ s103 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-05 finished in 1847 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 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 1125
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 1125
Applied a total of 14 rules in 11 ms. Remains 123 /130 variables (removed 7) and now considering 1125/1861 (removed 736) transitions.
[2021-05-10 15:03:47] [INFO ] Flow matrix only has 419 transitions (discarded 706 similar events)
// Phase 1: matrix 419 rows 123 cols
[2021-05-10 15:03:47] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:47] [INFO ] Implicit Places using invariants in 188 ms returned []
[2021-05-10 15:03:47] [INFO ] Flow matrix only has 419 transitions (discarded 706 similar events)
// Phase 1: matrix 419 rows 123 cols
[2021-05-10 15:03:47] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:47] [INFO ] State equation strengthened by 277 read => feed constraints.
[2021-05-10 15:03:48] [INFO ] Implicit Places using invariants and state equation in 823 ms returned [21, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1014 ms to find 2 implicit places.
[2021-05-10 15:03:48] [INFO ] Flow matrix only has 419 transitions (discarded 706 similar events)
// Phase 1: matrix 419 rows 121 cols
[2021-05-10 15:03:48] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-10 15:03:48] [INFO ] Dead Transitions using invariants and state equation in 446 ms returned []
Starting structural reductions, iteration 1 : 121/130 places, 1125/1861 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 1125/1125 (removed 0) transitions.
[2021-05-10 15:03:48] [INFO ] Flow matrix only has 419 transitions (discarded 706 similar events)
// Phase 1: matrix 419 rows 121 cols
[2021-05-10 15:03:48] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:03:48] [INFO ] Dead Transitions using invariants and state equation in 420 ms returned []
Finished structural reductions, in 2 iterations. Remains : 121/130 places, 1125/1861 transitions.
Stuttering acceptance computed with spot in 10615 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-06 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 s8 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 EnergyBus-PT-none-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-06 finished in 12523 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((((p1 U (p2||G(p1)))||p0)&&(X(p3) U ((p1&&X(p3))||X(G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 13 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 124 transition count 1364
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 124 transition count 1364
Applied a total of 12 rules in 11 ms. Remains 124 /130 variables (removed 6) and now considering 1364/1861 (removed 497) transitions.
[2021-05-10 15:03:59] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
// Phase 1: matrix 478 rows 124 cols
[2021-05-10 15:03:59] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-10 15:03:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2021-05-10 15:03:59] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
// Phase 1: matrix 478 rows 124 cols
[2021-05-10 15:03:59] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-10 15:03:59] [INFO ] State equation strengthened by 337 read => feed constraints.
[2021-05-10 15:04:00] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [20, 96]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 752 ms to find 2 implicit places.
[2021-05-10 15:04:00] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
// Phase 1: matrix 478 rows 122 cols
[2021-05-10 15:04:00] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:04:00] [INFO ] Dead Transitions using invariants and state equation in 501 ms returned []
Starting structural reductions, iteration 1 : 122/130 places, 1364/1861 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 1364/1364 (removed 0) transitions.
[2021-05-10 15:04:00] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
// Phase 1: matrix 478 rows 122 cols
[2021-05-10 15:04:00] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:04:01] [INFO ] Dead Transitions using invariants and state equation in 461 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/130 places, 1364/1861 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), true, (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2)))]
Running random walk in product with property : EnergyBus-PT-none-08 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p3), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p3) (AND p2 p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s13 1) (NEQ s15 1) (NEQ s34 1) (NEQ s46 1) (NEQ s70 1) (NEQ s83 1) (NEQ s90 1) (NEQ s107 1)), p0:(OR (NEQ s13 1) (NEQ s15 1) (NEQ s34 1) (NEQ s46 1) (NEQ s70 1) (NEQ s83 1) (NEQ s90 1) (NEQ s107 1)), p2:(AND (OR (NEQ s13 1) (NEQ s15 1) (NEQ s34 1) (NEQ s46 1) (NEQ s70 1) (NEQ s83 1) (NEQ s90 1) (NEQ s107 1)) (OR (NEQ s13 1) (NEQ s15 1) (NEQ s48 1) (NEQ s60 1) (NEQ s63 1) (NEQ s87 1) (NEQ s90 1) (NEQ s111 1))), p3:(OR (NEQ s13 1) (NEQ s15 1) (NEQ s48 1) (NEQ s60 1) (NEQ s63 1) (NEQ s87 1) (NEQ s90 1) (NEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 889 ms.
Product exploration explored 100000 steps with 0 reset in 968 ms.
Knowledge obtained : [p1, p0, p2, p3]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), true, (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 830 ms.
Product exploration explored 100000 steps with 0 reset in 1015 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), true, (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 13 out of 122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 122/122 places, 1364/1364 transitions.
Graph (trivial) has 76 edges and 122 vertex of which 10 / 122 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 116 transition count 1352
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 116 transition count 1519
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 116 transition count 1519
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 19 place count 116 transition count 1522
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 116 transition count 1520
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 115 transition count 1519
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 115 transition count 1519
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 115 transition count 1546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 115 transition count 1540
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 112 transition count 1534
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 112 transition count 1534
Deduced a syphon composed of 20 places in 1 ms
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 56 place count 112 transition count 1519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 112 transition count 1519
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 109 transition count 1516
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 109 transition count 1516
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 109 transition count 1516
Deduced a syphon composed of 21 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 109 transition count 1514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 108 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 107 transition count 1513
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 107 transition count 1513
Deduced a syphon composed of 20 places in 2 ms
Applied a total of 71 rules in 313 ms. Remains 107 /122 variables (removed 15) and now considering 1513/1364 (removed -149) transitions.
[2021-05-10 15:04:20] [INFO ] Redundant transitions in 2039 ms returned [974]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[974]
[2021-05-10 15:04:20] [INFO ] Flow matrix only has 449 transitions (discarded 1063 similar events)
// Phase 1: matrix 449 rows 107 cols
[2021-05-10 15:04:20] [INFO ] Computed 19 place invariants in 11 ms
[2021-05-10 15:04:21] [INFO ] Dead Transitions using invariants and state equation in 540 ms returned []
Starting structural reductions, iteration 1 : 107/122 places, 1512/1364 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 1512
Deduced a syphon composed of 21 places in 2 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 107 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 106 transition count 1508
Deduced a syphon composed of 21 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 106 transition count 1508
Deduced a syphon composed of 21 places in 2 ms
Applied a total of 5 rules in 73 ms. Remains 106 /107 variables (removed 1) and now considering 1508/1512 (removed 4) transitions.
Finished structural reductions, in 2 iterations. Remains : 106/122 places, 1508/1364 transitions.
Product exploration explored 100000 steps with 0 reset in 1054 ms.
Product exploration explored 100000 steps with 0 reset in 1043 ms.
[2021-05-10 15:04:23] [INFO ] Flatten gal took : 129 ms
[2021-05-10 15:04:24] [INFO ] Flatten gal took : 184 ms
[2021-05-10 15:04:24] [INFO ] Time to serialize gal into /tmp/LTL2938566935105317605.gal : 53 ms
[2021-05-10 15:04:24] [INFO ] Time to serialize properties into /tmp/LTL14850881800878667982.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/LTL2938566935105317605.gal, -t, CGAL, -LTL, /tmp/LTL14850881800878667982.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/LTL2938566935105317605.gal -t CGAL -LTL /tmp/LTL14850881800878667982.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(((X("((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1))"))U((("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))")&&(X("((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1))")))||(X(G("((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1))")))))&&(("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))")||(("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))")U(("(((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))&&((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1)))")||(G("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))"))))))))
Formula 0 simplified : !G((X"((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1))" U (("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))" & X"((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1))") | XG"((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1))")) & ("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))" | ("((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))" U ("(((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))&&((((((((p16!=1)||(p19!=1))||(p60!=1))||(p77!=1))||(p80!=1))||(p110!=1))||(p113!=1))||(p145!=1)))" | G"((((((((p16!=1)||(p19!=1))||(p41!=1))||(p58!=1))||(p88!=1))||(p105!=1))||(p113!=1))||(p139!=1))"))))
Detected timeout of ITS tools.
[2021-05-10 15:04:39] [INFO ] Flatten gal took : 168 ms
[2021-05-10 15:04:39] [INFO ] Applying decomposition
[2021-05-10 15:04:39] [INFO ] Flatten gal took : 171 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/graph5783114901075154726.txt, -o, /tmp/graph5783114901075154726.bin, -w, /tmp/graph5783114901075154726.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/graph5783114901075154726.bin, -l, -1, -v, -w, /tmp/graph5783114901075154726.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 15:04:41] [INFO ] Decomposing Gal with order
[2021-05-10 15:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 15:04:41] [INFO ] Removed a total of 6614 redundant transitions.
[2021-05-10 15:04:41] [INFO ] Flatten gal took : 366 ms
[2021-05-10 15:04:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 52 ms.
[2021-05-10 15:04:41] [INFO ] Time to serialize gal into /tmp/LTL4923673472804342266.gal : 6 ms
[2021-05-10 15:04:41] [INFO ] Time to serialize properties into /tmp/LTL940029571341545192.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/LTL4923673472804342266.gal, -t, CGAL, -LTL, /tmp/LTL940029571341545192.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/LTL4923673472804342266.gal -t CGAL -LTL /tmp/LTL940029571341545192.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(((X("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1))"))U((("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))")&&(X("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1))")))||(X(G("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1))")))))&&(("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))")||(("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))")U(("(((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))&&((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1)))")||(G("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))"))))))))
Formula 0 simplified : !G((X"((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1))" U (("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))" & X"((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1))") | XG"((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1))")) & ("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))" | ("((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))" U ("(((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))&&((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i4.u12.p60!=1))||(i4.u12.p77!=1))||(i2.i1.u22.p80!=1))||(i9.u23.p110!=1))||(i4.u5.p113!=1))||(u31.p145!=1)))" | G"((((((((i4.u5.p16!=1)||(i4.u7.p19!=1))||(i2.i0.u13.p41!=1))||(i2.i0.u13.p58!=1))||(i4.u7.p88!=1))||(i4.u5.p105!=1))||(i4.u5.p113!=1))||(i9.u29.p139!=1))"))))
Reverse transition relation is NOT exact ! Due to transitions t19, t50, t71, t96, t109, t118, t1815, t1832, t1833, t1834, t1836, t1845, t1846, u14.t48, u14.t84, u17.t34, u17.t90, u31.t8, u31.t9, i0.t61, i0.u24.t20, i1.t1841, i1.u4.t53, i1.u27.t94, i1.u28.t13, i1.u28.t14, i1.u33.t2, i1.u33.t3, i3.i1.t1851, i3.i1.t1853, i3.i1.t1854, i3.i1.t1856, i4.u5.t52, i4.u5.t1824, i4.u5.t1825, i4.u7.t1850, i4.u32.t5, i4.u32.t6, i9.u20.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/421/39/460
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6447989270685611551
[2021-05-10 15:04:56] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6447989270685611551
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6447989270685611551]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6447989270685611551] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6447989270685611551] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property EnergyBus-PT-none-08 finished in 58276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&((F(p2)&&p1) U G(p3))))], workingDir=/home/mcc/execution]
Support contains 13 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Graph (trivial) has 76 edges and 130 vertex of which 10 / 130 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 124 transition count 1845
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 120 transition count 1845
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 120 transition count 1841
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 116 transition count 1841
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 24 place count 109 transition count 1216
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 109 transition count 1216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 109 transition count 1215
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 108 transition count 1215
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 99 transition count 1206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 99 transition count 1204
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 65 place count 93 transition count 1216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 69 place count 93 transition count 1212
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 81 place count 93 transition count 1200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 93 transition count 1199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 83 place count 92 transition count 1199
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 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 89 place count 89 transition count 1196
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 89 transition count 1195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 88 transition count 1195
Applied a total of 91 rules in 339 ms. Remains 88 /130 variables (removed 42) and now considering 1195/1861 (removed 666) transitions.
[2021-05-10 15:04:58] [INFO ] Flow matrix only has 344 transitions (discarded 851 similar events)
// Phase 1: matrix 344 rows 88 cols
[2021-05-10 15:04:58] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-10 15:04:58] [INFO ] Implicit Places using invariants in 261 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 264 ms to find 1 implicit places.
[2021-05-10 15:05:00] [INFO ] Redundant transitions in 1742 ms returned [68]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[68]
[2021-05-10 15:05:00] [INFO ] Flow matrix only has 343 transitions (discarded 851 similar events)
// Phase 1: matrix 343 rows 87 cols
[2021-05-10 15:05:00] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-10 15:05:00] [INFO ] Dead Transitions using invariants and state equation in 457 ms returned []
Starting structural reductions, iteration 1 : 87/130 places, 1194/1861 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 1193
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 1189
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 1189
Applied a total of 6 rules in 46 ms. Remains 85 /87 variables (removed 2) and now considering 1189/1194 (removed 5) transitions.
[2021-05-10 15:05:00] [INFO ] Flow matrix only has 338 transitions (discarded 851 similar events)
// Phase 1: matrix 338 rows 85 cols
[2021-05-10 15:05:00] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-10 15:05:00] [INFO ] Implicit Places using invariants in 78 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 84/130 places, 1189/1861 transitions.
Applied a total of 0 rules in 16 ms. Remains 84 /84 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
[2021-05-10 15:05:02] [INFO ] Redundant transitions in 1837 ms returned []
[2021-05-10 15:05:02] [INFO ] Flow matrix only has 338 transitions (discarded 851 similar events)
// Phase 1: matrix 338 rows 84 cols
[2021-05-10 15:05:02] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-10 15:05:03] [INFO ] Dead Transitions using invariants and state equation in 439 ms returned []
Finished structural reductions, in 3 iterations. Remains : 84/130 places, 1189/1861 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : EnergyBus-PT-none-10 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p3 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s6 0) (EQ s8 0) (EQ s20 0) (EQ s26 0) (EQ s42 0) (EQ s55 0) (EQ s58 0) (EQ s72 0)), p1:(AND (EQ s6 1) (EQ s8 1) (EQ s28 1) (EQ s34 1) (EQ s48 1) (EQ s50 1) (EQ s58 1) (EQ s72 1)), p0:(AND (EQ s6 1) (EQ s8 1) (EQ s20 1) (EQ s26 1) (EQ s42 1) (EQ s55 1) (EQ s58 1) (EQ s72 1)), p2:(AND (EQ s6 1) (EQ s8 1) (EQ s20 1) (EQ s26 1) (EQ s42 1) (EQ s50 1) (EQ s58 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 970 ms.
Product exploration explored 100000 steps with 0 reset in 927 ms.
Knowledge obtained : [p3, (NOT p1), (NOT p0), (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(NOT p1)
Stuttering acceptance computed with spot in 84 ms :[(NOT p3), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), true]
Support contains 12 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 84/84 places, 1189/1189 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 1188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 1187
Applied a total of 3 rules in 36 ms. Remains 83 /84 variables (removed 1) and now considering 1187/1189 (removed 2) transitions.
[2021-05-10 15:05:05] [INFO ] Flow matrix only has 283 transitions (discarded 904 similar events)
// Phase 1: matrix 283 rows 83 cols
[2021-05-10 15:05:05] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-10 15:05:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2021-05-10 15:05:05] [INFO ] Flow matrix only has 283 transitions (discarded 904 similar events)
// Phase 1: matrix 283 rows 83 cols
[2021-05-10 15:05:05] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-10 15:05:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2021-05-10 15:05:05] [INFO ] Implicit Places using invariants and state equation in 303 ms returned [13, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 380 ms to find 2 implicit places.
[2021-05-10 15:05:07] [INFO ] Redundant transitions in 1628 ms returned []
[2021-05-10 15:05:07] [INFO ] Flow matrix only has 283 transitions (discarded 904 similar events)
// Phase 1: matrix 283 rows 81 cols
[2021-05-10 15:05:07] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-10 15:05:07] [INFO ] Dead Transitions using invariants and state equation in 394 ms returned []
Starting structural reductions, iteration 1 : 81/84 places, 1187/1189 transitions.
Applied a total of 0 rules in 16 ms. Remains 81 /81 variables (removed 0) and now considering 1187/1187 (removed 0) transitions.
[2021-05-10 15:05:09] [INFO ] Redundant transitions in 1477 ms returned []
[2021-05-10 15:05:09] [INFO ] Flow matrix only has 283 transitions (discarded 904 similar events)
// Phase 1: matrix 283 rows 81 cols
[2021-05-10 15:05:09] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-10 15:05:09] [INFO ] Dead Transitions using invariants and state equation in 410 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/84 places, 1187/1189 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p3), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), true]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-10 finished in 12048 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 8 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Graph (trivial) has 85 edges and 130 vertex of which 12 / 130 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 441 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 123 transition count 1416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 119 transition count 1416
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 119 transition count 1412
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 115 transition count 1412
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 24 place count 108 transition count 943
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 108 transition count 943
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 108 transition count 942
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 107 transition count 942
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 98 transition count 933
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 98 transition count 931
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 63 place count 93 transition count 939
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 67 place count 93 transition count 935
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 78 place count 93 transition count 924
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 93 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 92 transition count 923
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 86 place count 89 transition count 920
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 87 place count 89 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 88 transition count 919
Applied a total of 88 rules in 183 ms. Remains 88 /130 variables (removed 42) and now considering 919/1861 (removed 942) transitions.
[2021-05-10 15:05:10] [INFO ] Flow matrix only has 340 transitions (discarded 579 similar events)
// Phase 1: matrix 340 rows 88 cols
[2021-05-10 15:05:10] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-10 15:05:10] [INFO ] Implicit Places using invariants in 108 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
[2021-05-10 15:05:11] [INFO ] Redundant transitions in 1360 ms returned [67]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[67]
[2021-05-10 15:05:11] [INFO ] Flow matrix only has 339 transitions (discarded 579 similar events)
// Phase 1: matrix 339 rows 87 cols
[2021-05-10 15:05:11] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:05:11] [INFO ] Dead Transitions using invariants and state equation in 339 ms returned []
Starting structural reductions, iteration 1 : 87/130 places, 918/1861 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 917
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 913
Applied a total of 6 rules in 32 ms. Remains 85 /87 variables (removed 2) and now considering 913/918 (removed 5) transitions.
[2021-05-10 15:05:11] [INFO ] Flow matrix only has 334 transitions (discarded 579 similar events)
// Phase 1: matrix 334 rows 85 cols
[2021-05-10 15:05:11] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-10 15:05:12] [INFO ] Implicit Places using invariants in 137 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 84/130 places, 913/1861 transitions.
Applied a total of 0 rules in 12 ms. Remains 84 /84 variables (removed 0) and now considering 913/913 (removed 0) transitions.
[2021-05-10 15:05:13] [INFO ] Redundant transitions in 1100 ms returned []
[2021-05-10 15:05:13] [INFO ] Flow matrix only has 334 transitions (discarded 579 similar events)
// Phase 1: matrix 334 rows 84 cols
[2021-05-10 15:05:13] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-10 15:05:13] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Finished structural reductions, in 3 iterations. Remains : 84/130 places, 913/1861 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1) (EQ s20 1) (EQ s26 1) (EQ s48 1) (EQ s54 1) (EQ s58 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-11 finished in 3664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((p0&&F(p1)))||(X(p3)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 16 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 1861/1861 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 1476
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 1476
Applied a total of 10 rules in 10 ms. Remains 125 /130 variables (removed 5) and now considering 1476/1861 (removed 385) transitions.
[2021-05-10 15:05:13] [INFO ] Flow matrix only has 506 transitions (discarded 970 similar events)
// Phase 1: matrix 506 rows 125 cols
[2021-05-10 15:05:13] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-10 15:05:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2021-05-10 15:05:13] [INFO ] Flow matrix only has 506 transitions (discarded 970 similar events)
// Phase 1: matrix 506 rows 125 cols
[2021-05-10 15:05:13] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-10 15:05:13] [INFO ] State equation strengthened by 365 read => feed constraints.
[2021-05-10 15:05:14] [INFO ] Implicit Places using invariants and state equation in 679 ms returned [20, 97]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 767 ms to find 2 implicit places.
[2021-05-10 15:05:14] [INFO ] Flow matrix only has 506 transitions (discarded 970 similar events)
// Phase 1: matrix 506 rows 123 cols
[2021-05-10 15:05:14] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:05:14] [INFO ] Dead Transitions using invariants and state equation in 572 ms returned []
Starting structural reductions, iteration 1 : 123/130 places, 1476/1861 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1476/1476 (removed 0) transitions.
[2021-05-10 15:05:14] [INFO ] Flow matrix only has 506 transitions (discarded 970 similar events)
// Phase 1: matrix 506 rows 123 cols
[2021-05-10 15:05:14] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-10 15:05:15] [INFO ] Dead Transitions using invariants and state equation in 504 ms returned []
Finished structural reductions, in 2 iterations. Remains : 123/130 places, 1476/1861 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : EnergyBus-PT-none-12 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(AND (EQ s13 1) (EQ s15 1) (EQ s48 1) (EQ s60 1) (EQ s64 1) (EQ s82 1) (EQ s92 1) (EQ s116 1)), p1:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s68 1) (EQ s87 1) (EQ s91 1) (EQ s112 1)), p0:(OR (EQ s13 0) (EQ s15 0) (EQ s34 0) (EQ s46 0) (EQ s63 0) (EQ s87 0) (EQ s91 0) (EQ s104 0)), p3:(AND (EQ s13 1) (EQ s15 1) (EQ s34 1) (EQ s46 1) (EQ s63 1) (EQ s87 1) (EQ s91 1) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-12 finished in 2061 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2808809891920453808
[2021-05-10 15:05:15] [INFO ] Too many transitions (1861) to apply POR reductions. Disabling POR matrices.
[2021-05-10 15:05:15] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2808809891920453808
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2808809891920453808]
[2021-05-10 15:05:15] [INFO ] Applying decomposition
[2021-05-10 15:05:16] [INFO ] Flatten gal took : 178 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/graph12002750487663534143.txt, -o, /tmp/graph12002750487663534143.bin, -w, /tmp/graph12002750487663534143.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/graph12002750487663534143.bin, -l, -1, -v, -w, /tmp/graph12002750487663534143.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 15:05:16] [INFO ] Decomposing Gal with order
[2021-05-10 15:05:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 15:05:16] [INFO ] Removed a total of 8876 redundant transitions.
[2021-05-10 15:05:16] [INFO ] Flatten gal took : 307 ms
[2021-05-10 15:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 55 ms.
[2021-05-10 15:05:16] [INFO ] Time to serialize gal into /tmp/LTLFireability18136865646658479241.gal : 6 ms
[2021-05-10 15:05:16] [INFO ] Time to serialize properties into /tmp/LTLFireability15466632130629140213.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/LTLFireability18136865646658479241.gal, -t, CGAL, -LTL, /tmp/LTLFireability15466632130629140213.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/LTLFireability18136865646658479241.gal -t CGAL -LTL /tmp/LTLFireability15466632130629140213.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(((X(!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))")))U(((!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))"))&&(X(!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))"))))||(G(X(!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))"))))))&&((!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))"))||((!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))"))U(("((!((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1)))&&(!((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))))")||(G(!("((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))")))))))))
Formula 0 simplified : !G((X!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))" U ((!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))" & X!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))") | GX!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))")) & (!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))" | (!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))" U ("((!((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1)))&&(!((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i6.u17.p60==1))&&(i6.u17.p77==1))&&(i6.u6.p80==1))&&(i6.u6.p110==1))&&(i11.u23.p113==1))&&(i11.u33.p145==1))))" | G!"((((((((i6.u5.p16==1)&&(i6.u5.p19==1))&&(i2.u13.p41==1))&&(i2.u13.p58==1))&&(i11.u23.p88==1))&&(i2.u13.p105==1))&&(i11.u23.p113==1))&&(i2.u30.p139==1))"))))
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t25, t40, t152, t166, t177, t459, t461, t525, t527, t591, t593, t1083, t1085, t1149, t1151, t1215, t1217, t1643, t1645, t1709, t1711, t1775, t1777, t2219, t2221, t2235, t2237, t2251, t2253, t3435, t3437, t3501, t3503, t3567, t3569, t3851, t3853, t3867, t3869, t3883, t3885, t4107, t4109, t4123, t4125, t4139, t4141, t4295, t4297, t4311, t4313, t4327, t4329, t4365, t4366, t4374, t4375, t4376, t4378, t4387, u14.t87, u14.t138, u18.t62, u18.t146, i0.t111, i0.u24.t41, i3.i1.t4424, i3.i1.t4426, i3.i1.t4427, i3.i1.t4429, i3.i2.u4.t101, i3.i3.u34.t2, i3.i3.u34.t3, i6.t95, i6.u5.t100, i6.u32.t8, i9.u31.t13, i10.u29.t29, i11.t4392, i11.t4391, i11.u28.t150, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/642/83/725
Compilation finished in 27563 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2808809891920453808]
Link finished in 179 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))||(LTLAPp0==true))&&(X((LTLAPp3==true)) U (((LTLAPp1==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2808809891920453808]
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3227 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,32.326,671004,1,0,959381,55338,9097,3.69643e+06,1041,463184,1682736
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620659167782

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is EnergyBus-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875700677"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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